Graph Edit Distance Based on Triangle-Stars Decomposition for Deformable 3D Objects Recognition
3DV '15 Proceedings of the 2015 International Conference on 3D Vision(2015)
摘要
We 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.
更多查看译文
关键词
computational complexity,computational geometry,graph theory,object recognition,deformable 3D object recognition,graph edit distance,pseudo-metric,time complexity,triangle-star decomposition,triangular tessellation,3D objects,Deformable objects,Edit distance,Graph decomposition,Graph matching,Pattern recognition,Triangle-Stars
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要