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

Auteur	Rechercher : Madi, Kamel; Rechercher : Paquet, Eric¹; Rechercher : Seba, Hamida; Rechercher : Kheddouci, Hamamache
Affiliation	Conseil national de recherches du Canada. Technologies de l'information et des communications
Format	Texte, Allocution
Conférence	International Conference on 3D Vision (3DV 2015), October 19-22, 2015, Lyon, France
Résumé	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.
Date de publication	2015-10
Langue	anglais
Publications évaluées par des pairs	Oui
Numéro NPARC	21276886
Exporter la notice	Exporter en format RIS
Signaler une correction	Signaler une correction (s'ouvre dans un nouvel onglet)
Identificateur de l’enregistrement	c52f5db6-409d-4521-8ed5-48d6a9fccb8a
Enregistrement créé	2015-10-30
Enregistrement modifié	2024-01-31