| DOI | Trouver le DOI : https://doi.org/10.1109/3DV.2015.14 |
|---|
| Auteur | Rechercher : Madi, Kamel; Rechercher : Paquet, Eric1; Rechercher : Seba, Hamida; Rechercher : Kheddouci, Hamamache |
|---|
| Affiliation | - Conseil national de recherches du Canada. Technologies de l'information et des communications
|
|---|
| Format | Texte, Article |
|---|
| Conférence | 2015 International Conference on 3D Vision (3DV), October 19-22, 2015, Lyon, France |
|---|
| Sujet | pattern recognition; edit distance; graph matching; graph decomposition; triangle-stars; deformable objects; 3D objects |
|---|
| 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 |
|---|
| Maison d’édition | IEEE |
|---|
| Dans | |
|---|
| Langue | anglais |
|---|
| Publications évaluées par des pairs | Oui |
|---|
| Numéro NPARC | 23001485 |
|---|
| Exporter la notice | Exporter en format RIS |
|---|
| Signaler une correction | Signaler une correction (s'ouvre dans un nouvel onglet) |
|---|
| Identificateur de l’enregistrement | a8cdf6aa-465e-4228-ae02-f720240c6483 |
|---|
| Enregistrement créé | 2017-02-17 |
|---|
| Enregistrement modifié | 2020-04-22 |
|---|
