Loading…
Organic skeleton correspondence using part arrangements
Shape correspondence between semantically similar organic shapes with large shape variations is a difficult problem in shape analysis. Since part geometries are no longer similar, we claim that the challenge is to extract and compare prominent shape substructures, which are recurring part arrangemen...
Saved in:
Published in: | Applied Mathematics-A Journal of Chinese Universities 2019-09, Vol.34 (3), p.326-339 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 339 |
container_issue | 3 |
container_start_page | 326 |
container_title | Applied Mathematics-A Journal of Chinese Universities |
container_volume | 34 |
creator | Li, Shu-hua Liu, Xiu-ping Cao, Jun-jie Wang, Shi-yao |
description | Shape correspondence between semantically similar organic shapes with large shape variations is a difficult problem in shape analysis. Since part geometries are no longer similar, we claim that the challenge is to extract and compare prominent shape substructures, which are recurring part arrangements among semantically related shapes. Our main premise is that the challenge can be solved more efficiently on curve skeleton graphs of shapes, which provide a concise abstraction of shape geometry and structure. Instead of directly searching exponentially many skeleton subgraphs, our method extracts the intrinsic reflectional symmetry axis of the skeleton to guide the generation of subgraphs as part arrangements. For any two subgraphs from two skeletons, their orientations are aligned and their pose variations are normalized for matching. Finally, the matchings of all subgraph pairs are evaluated and accumulated to the skeletal feature node correspondences. The comparison results with the state-of-the-art work show that our method significantly improves the efficiency and accuracy of the semantic correspondence between a variety of shapes. |
doi_str_mv | 10.1007/s11766-019-3696-z |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2283380458</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2283380458</sourcerecordid><originalsourceid>FETCH-LOGICAL-c304t-ddc82a27392ee62c20a8e68270a899152a455c2c26f3771b569853a2166aa9bd3</originalsourceid><addsrcrecordid>eNp1kE1LAzEQhoMoWGp_gLcFz9GZZPN1lOIXFHrRc0izadnaZtdk92B_vSkrePI0w_C-78w8hNwi3COAesiISkoKaCiXRtLTBZmhMZxCXYvL0gMIisDxmixy3gMA1qoWQs-IWqedi62v8mc4hKGLle9SCrnvYhOiD9WY27irepeGyqXk4i4cQxzyDbnaukMOi986Jx_PT-_LV7pav7wtH1fUc6gH2jReM8cUNywEyTwDp4PUTJVqDArmyhm-zOWWK4UbIY0W3DGU0jmzafic3E25feq-xpAHu-_GFMtKy5jmXEMtdFHhpPKpyzmFre1Te3Tp2yLYMyI7IbIFkT0jsqfiYZMnF215K_0l_2_6Ad_waJY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2283380458</pqid></control><display><type>article</type><title>Organic skeleton correspondence using part arrangements</title><source>Springer Link</source><creator>Li, Shu-hua ; Liu, Xiu-ping ; Cao, Jun-jie ; Wang, Shi-yao</creator><creatorcontrib>Li, Shu-hua ; Liu, Xiu-ping ; Cao, Jun-jie ; Wang, Shi-yao</creatorcontrib><description>Shape correspondence between semantically similar organic shapes with large shape variations is a difficult problem in shape analysis. Since part geometries are no longer similar, we claim that the challenge is to extract and compare prominent shape substructures, which are recurring part arrangements among semantically related shapes. Our main premise is that the challenge can be solved more efficiently on curve skeleton graphs of shapes, which provide a concise abstraction of shape geometry and structure. Instead of directly searching exponentially many skeleton subgraphs, our method extracts the intrinsic reflectional symmetry axis of the skeleton to guide the generation of subgraphs as part arrangements. For any two subgraphs from two skeletons, their orientations are aligned and their pose variations are normalized for matching. Finally, the matchings of all subgraph pairs are evaluated and accumulated to the skeletal feature node correspondences. The comparison results with the state-of-the-art work show that our method significantly improves the efficiency and accuracy of the semantic correspondence between a variety of shapes.</description><identifier>ISSN: 1005-1031</identifier><identifier>EISSN: 1993-0445</identifier><identifier>DOI: 10.1007/s11766-019-3696-z</identifier><language>eng</language><publisher>Hangzhou: Editorial Committee of Applied Mathematics - A Journal of Chinese Universities</publisher><subject>Applications of Mathematics ; Graph theory ; Mathematics ; Mathematics and Statistics ; Substructures</subject><ispartof>Applied Mathematics-A Journal of Chinese Universities, 2019-09, Vol.34 (3), p.326-339</ispartof><rights>Editorial Committee of Applied Mathematics 2019</rights><rights>Copyright Springer Nature B.V. 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Li, Shu-hua</creatorcontrib><creatorcontrib>Liu, Xiu-ping</creatorcontrib><creatorcontrib>Cao, Jun-jie</creatorcontrib><creatorcontrib>Wang, Shi-yao</creatorcontrib><title>Organic skeleton correspondence using part arrangements</title><title>Applied Mathematics-A Journal of Chinese Universities</title><addtitle>Appl. Math. J. Chin. Univ</addtitle><description>Shape correspondence between semantically similar organic shapes with large shape variations is a difficult problem in shape analysis. Since part geometries are no longer similar, we claim that the challenge is to extract and compare prominent shape substructures, which are recurring part arrangements among semantically related shapes. Our main premise is that the challenge can be solved more efficiently on curve skeleton graphs of shapes, which provide a concise abstraction of shape geometry and structure. Instead of directly searching exponentially many skeleton subgraphs, our method extracts the intrinsic reflectional symmetry axis of the skeleton to guide the generation of subgraphs as part arrangements. For any two subgraphs from two skeletons, their orientations are aligned and their pose variations are normalized for matching. Finally, the matchings of all subgraph pairs are evaluated and accumulated to the skeletal feature node correspondences. The comparison results with the state-of-the-art work show that our method significantly improves the efficiency and accuracy of the semantic correspondence between a variety of shapes.</description><subject>Applications of Mathematics</subject><subject>Graph theory</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Substructures</subject><issn>1005-1031</issn><issn>1993-0445</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp1kE1LAzEQhoMoWGp_gLcFz9GZZPN1lOIXFHrRc0izadnaZtdk92B_vSkrePI0w_C-78w8hNwi3COAesiISkoKaCiXRtLTBZmhMZxCXYvL0gMIisDxmixy3gMA1qoWQs-IWqedi62v8mc4hKGLle9SCrnvYhOiD9WY27irepeGyqXk4i4cQxzyDbnaukMOi986Jx_PT-_LV7pav7wtH1fUc6gH2jReM8cUNywEyTwDp4PUTJVqDArmyhm-zOWWK4UbIY0W3DGU0jmzafic3E25feq-xpAHu-_GFMtKy5jmXEMtdFHhpPKpyzmFre1Te3Tp2yLYMyI7IbIFkT0jsqfiYZMnF215K_0l_2_6Ad_waJY</recordid><startdate>20190901</startdate><enddate>20190901</enddate><creator>Li, Shu-hua</creator><creator>Liu, Xiu-ping</creator><creator>Cao, Jun-jie</creator><creator>Wang, Shi-yao</creator><general>Editorial Committee of Applied Mathematics - A Journal of Chinese Universities</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20190901</creationdate><title>Organic skeleton correspondence using part arrangements</title><author>Li, Shu-hua ; Liu, Xiu-ping ; Cao, Jun-jie ; Wang, Shi-yao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c304t-ddc82a27392ee62c20a8e68270a899152a455c2c26f3771b569853a2166aa9bd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Applications of Mathematics</topic><topic>Graph theory</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Substructures</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Shu-hua</creatorcontrib><creatorcontrib>Liu, Xiu-ping</creatorcontrib><creatorcontrib>Cao, Jun-jie</creatorcontrib><creatorcontrib>Wang, Shi-yao</creatorcontrib><collection>CrossRef</collection><jtitle>Applied Mathematics-A Journal of Chinese Universities</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Shu-hua</au><au>Liu, Xiu-ping</au><au>Cao, Jun-jie</au><au>Wang, Shi-yao</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Organic skeleton correspondence using part arrangements</atitle><jtitle>Applied Mathematics-A Journal of Chinese Universities</jtitle><stitle>Appl. Math. J. Chin. Univ</stitle><date>2019-09-01</date><risdate>2019</risdate><volume>34</volume><issue>3</issue><spage>326</spage><epage>339</epage><pages>326-339</pages><issn>1005-1031</issn><eissn>1993-0445</eissn><abstract>Shape correspondence between semantically similar organic shapes with large shape variations is a difficult problem in shape analysis. Since part geometries are no longer similar, we claim that the challenge is to extract and compare prominent shape substructures, which are recurring part arrangements among semantically related shapes. Our main premise is that the challenge can be solved more efficiently on curve skeleton graphs of shapes, which provide a concise abstraction of shape geometry and structure. Instead of directly searching exponentially many skeleton subgraphs, our method extracts the intrinsic reflectional symmetry axis of the skeleton to guide the generation of subgraphs as part arrangements. For any two subgraphs from two skeletons, their orientations are aligned and their pose variations are normalized for matching. Finally, the matchings of all subgraph pairs are evaluated and accumulated to the skeletal feature node correspondences. The comparison results with the state-of-the-art work show that our method significantly improves the efficiency and accuracy of the semantic correspondence between a variety of shapes.</abstract><cop>Hangzhou</cop><pub>Editorial Committee of Applied Mathematics - A Journal of Chinese Universities</pub><doi>10.1007/s11766-019-3696-z</doi><tpages>14</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1005-1031 |
ispartof | Applied Mathematics-A Journal of Chinese Universities, 2019-09, Vol.34 (3), p.326-339 |
issn | 1005-1031 1993-0445 |
language | eng |
recordid | cdi_proquest_journals_2283380458 |
source | Springer Link |
subjects | Applications of Mathematics Graph theory Mathematics Mathematics and Statistics Substructures |
title | Organic skeleton correspondence using part arrangements |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T06%3A31%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Organic%20skeleton%20correspondence%20using%20part%20arrangements&rft.jtitle=Applied%20Mathematics-A%20Journal%20of%20Chinese%20Universities&rft.au=Li,%20Shu-hua&rft.date=2019-09-01&rft.volume=34&rft.issue=3&rft.spage=326&rft.epage=339&rft.pages=326-339&rft.issn=1005-1031&rft.eissn=1993-0445&rft_id=info:doi/10.1007/s11766-019-3696-z&rft_dat=%3Cproquest_cross%3E2283380458%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c304t-ddc82a27392ee62c20a8e68270a899152a455c2c26f3771b569853a2166aa9bd3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2283380458&rft_id=info:pmid/&rfr_iscdi=true |