No Cover Image

Journal article 376 views 42 downloads

Consistent segment-wise matching with multi-layer graphs

Taiwei Wang, David George, Yu-Kun Lai, Xianghua Xie Orcid Logo, Gary K.L. Tam

Computer Aided Geometric Design, Volume: 70, Pages: 31 - 45

Swansea University Author: Xianghua Xie Orcid Logo

  • 48784.pdf

    PDF | Accepted Manuscript

    Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND).

    Download (3.92MB)

Abstract

Segment-wise matching is an important problem for higher-level understanding of shapes and geometry analysis. Many existing segment-wise matching techniques assume perfect segmentation, and would suffer from imperfect or over-segmentation inputs. To handle this shortcoming, we propose a multi-layer...

Full description

Published in: Computer Aided Geometric Design
ISSN: 01678396
Published: 2019
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa48784
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2019-02-11T11:58:09Z
last_indexed 2019-07-18T15:33:08Z
id cronfa48784
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2019-07-18T13:52:34.9520714</datestamp><bib-version>v2</bib-version><id>48784</id><entry>2019-02-09</entry><title>Consistent segment-wise matching with multi-layer graphs</title><swanseaauthors><author><sid>b334d40963c7a2f435f06d2c26c74e11</sid><ORCID>0000-0002-2701-8660</ORCID><firstname>Xianghua</firstname><surname>Xie</surname><name>Xianghua Xie</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2019-02-09</date><deptcode>SCS</deptcode><abstract>Segment-wise matching is an important problem for higher-level understanding of shapes and geometry analysis. Many existing segment-wise matching techniques assume perfect segmentation, and would suffer from imperfect or over-segmentation inputs. To handle this shortcoming, we propose a multi-layer graph (MLG) to represent possible partially merged segments of input shape. We adapt the diffusion pruning technique on the MLGs to find high quality segment-wise matching. Experimental results on man-made shapes demonstrate the effectiveness of our method.</abstract><type>Journal Article</type><journal>Computer Aided Geometric Design</journal><volume>70</volume><paginationStart>31</paginationStart><paginationEnd>45</paginationEnd><publisher/><issnPrint>01678396</issnPrint><keywords>Shape analysis, computer graphics</keywords><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2019</publishedYear><publishedDate>2019-12-31</publishedDate><doi>10.1016/j.cagd.2019.04.003</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2019-07-18T13:52:34.9520714</lastEdited><Created>2019-02-09T11:42:53.7189699</Created><path><level id="1">College of Science</level><level id="2">Computer Science</level></path><authors><author><firstname>Taiwei</firstname><surname>Wang</surname><order>1</order></author><author><firstname>David</firstname><surname>George</surname><order>2</order></author><author><firstname>Yu-Kun</firstname><surname>Lai</surname><order>3</order></author><author><firstname>Xianghua</firstname><surname>Xie</surname><orcid>0000-0002-2701-8660</orcid><order>4</order></author><author><firstname>Gary K.L.</firstname><surname>Tam</surname><order>5</order></author></authors><documents><document><filename>0048784-07052019130020.pdf</filename><originalFilename>48784.pdf</originalFilename><uploaded>2019-05-07T13:00:20.5130000</uploaded><type>Output</type><contentLength>4086577</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2020-04-04T00:00:00.0000000</embargoDate><documentNotes>Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND).</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language></document></documents><OutputDurs/></rfc1807>
spelling 2019-07-18T13:52:34.9520714 v2 48784 2019-02-09 Consistent segment-wise matching with multi-layer graphs b334d40963c7a2f435f06d2c26c74e11 0000-0002-2701-8660 Xianghua Xie Xianghua Xie true false 2019-02-09 SCS Segment-wise matching is an important problem for higher-level understanding of shapes and geometry analysis. Many existing segment-wise matching techniques assume perfect segmentation, and would suffer from imperfect or over-segmentation inputs. To handle this shortcoming, we propose a multi-layer graph (MLG) to represent possible partially merged segments of input shape. We adapt the diffusion pruning technique on the MLGs to find high quality segment-wise matching. Experimental results on man-made shapes demonstrate the effectiveness of our method. Journal Article Computer Aided Geometric Design 70 31 45 01678396 Shape analysis, computer graphics 31 12 2019 2019-12-31 10.1016/j.cagd.2019.04.003 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2019-07-18T13:52:34.9520714 2019-02-09T11:42:53.7189699 College of Science Computer Science Taiwei Wang 1 David George 2 Yu-Kun Lai 3 Xianghua Xie 0000-0002-2701-8660 4 Gary K.L. Tam 5 0048784-07052019130020.pdf 48784.pdf 2019-05-07T13:00:20.5130000 Output 4086577 application/pdf Accepted Manuscript true 2020-04-04T00:00:00.0000000 Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND). true eng
title Consistent segment-wise matching with multi-layer graphs
spellingShingle Consistent segment-wise matching with multi-layer graphs
Xianghua Xie
title_short Consistent segment-wise matching with multi-layer graphs
title_full Consistent segment-wise matching with multi-layer graphs
title_fullStr Consistent segment-wise matching with multi-layer graphs
title_full_unstemmed Consistent segment-wise matching with multi-layer graphs
title_sort Consistent segment-wise matching with multi-layer graphs
author_id_str_mv b334d40963c7a2f435f06d2c26c74e11
author_id_fullname_str_mv b334d40963c7a2f435f06d2c26c74e11_***_Xianghua Xie
author Xianghua Xie
author2 Taiwei Wang
David George
Yu-Kun Lai
Xianghua Xie
Gary K.L. Tam
format Journal article
container_title Computer Aided Geometric Design
container_volume 70
container_start_page 31
publishDate 2019
institution Swansea University
issn 01678396
doi_str_mv 10.1016/j.cagd.2019.04.003
college_str College of Science
hierarchytype
hierarchy_top_id collegeofscience
hierarchy_top_title College of Science
hierarchy_parent_id collegeofscience
hierarchy_parent_title College of Science
department_str Computer Science{{{_:::_}}}College of Science{{{_:::_}}}Computer Science
document_store_str 1
active_str 0
description Segment-wise matching is an important problem for higher-level understanding of shapes and geometry analysis. Many existing segment-wise matching techniques assume perfect segmentation, and would suffer from imperfect or over-segmentation inputs. To handle this shortcoming, we propose a multi-layer graph (MLG) to represent possible partially merged segments of input shape. We adapt the diffusion pruning technique on the MLGs to find high quality segment-wise matching. Experimental results on man-made shapes demonstrate the effectiveness of our method.
published_date 2019-12-31T04:01:41Z
_version_ 1737027067497676800
score 10.898123