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

DOIResolve DOI:
AuthorSearch for: ; Search for: ; Search for: ; Search for:
Proceedings title2015 International Conference on 3D Vision
Conference2015 International Conference on 3D Vision (3DV), October 19-22, 2015, Lyon, France
Subjectpattern recognition; edit distance; graph matching; graph decomposition; triangle-stars; deformable objects; 3D objects
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.
Publication date
AffiliationInformation and Communication Technologies; National Research Council Canada
Peer reviewedYes
NPARC number23001485
Export citationExport as RIS
Report a correctionReport a correction
Record identifiera8cdf6aa-465e-4228-ae02-f720240c6483
Record created2017-02-17
Record modified2017-02-17
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)