Graph edit distance based on triangle-stars decomposition for deformable 3D objects recognition

AuthorSearch for: ; Search for: ; Search for: ; Search for:
ConferenceInternational Conference on 3D Vision (3DV 2015), October 19th to 22nd, Lyon, France
AbstractWe consider the problem of comparing deformable 3D objects represented by graphs, i.e., triangular tessellations. We propose a new algorithm to measure the distance between triangular tessellations using a new decomposition of triangular tessellations into triangle-Stars. The proposed algorithm assures a minimum number of disjoint triangle-Stars, offers a better measure by covering a larger neighborhood and uses a set of descriptors which are invariant or at least oblivious under most common deformations. We prove that the proposed distance is a pseudo-metric. We analyse its time complexity and we present a set of experimental results which confirm the high performance and accuracy of our algorithm.
AffiliationNational Research Council Canada; Information and Communication Technologies
Peer reviewedYes
NPARC number21276886
Export citationExport as RIS
Report a correctionReport a correction
Record identifierc52f5db6-409d-4521-8ed5-48d6a9fccb8a
Record created2015-10-30
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)
Date modified: