| DOI | Resolve DOI: https://doi.org/10.1109/3DV.2015.14 |
|---|
| Author | Search for: Madi, Kamel; Search for: Paquet, Eric1; Search for: Seba, Hamida; Search for: Kheddouci, Hamamache |
|---|
| Affiliation | - National Research Council of Canada. Information and Communication Technologies
|
|---|
| Format | Text, Article |
|---|
| Conference | 2015 International Conference on 3D Vision (3DV), October 19-22, 2015, Lyon, France |
|---|
| Subject | pattern recognition; edit distance; graph matching; graph decomposition; triangle-stars; deformable objects; 3D objects |
|---|
| 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. |
|---|
| Publication date | 2015-10 |
|---|
| Publisher | IEEE |
|---|
| In | |
|---|
| Language | English |
|---|
| Peer reviewed | Yes |
|---|
| NPARC number | 23001485 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | a8cdf6aa-465e-4228-ae02-f720240c6483 |
|---|
| Record created | 2017-02-17 |
|---|
| Record modified | 2020-04-22 |
|---|
