Graph Edit Distance based on Triangle-Stars Decomposition for Deformable 3D Objects Recognition

Kamel Madi 1 Eric Paquet Hamida Seba 1 Hamamache Kheddouci 1
1 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01215859
Contributor : Kamel Madi <>
Submitted on : Thursday, October 15, 2015 - 10:43:30 AM
Last modification on : Wednesday, October 31, 2018 - 12:24:25 PM

Identifiers

Citation

Kamel Madi, Eric Paquet, Hamida Seba, Hamamache Kheddouci. Graph Edit Distance based on Triangle-Stars Decomposition for Deformable 3D Objects Recognition. International Conference on 3D Vision (3DV 2015), Oct 2015, Lyon, France. ⟨10.1109/3DV.2015.1⟩. ⟨hal-01215859⟩

Share

Metrics

Record views

282