| Author | Search for: Madi, Kamel; Search for: Paquet, Eric1; Search for: Seba, Hamida; Search for: Kheddouci, Hamamache |
|---|
| Name affiliation | - National Research Council of Canada. Information and Communication Technologies
|
|---|
| Format | Text, Address |
|---|
| Conference | International Conference on 3D Vision (3DV 2015), October 19th to 22nd, Lyon, France |
|---|
| 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. |
|---|
| Language | English |
|---|
| Peer reviewed | Yes |
|---|
| NPARC number | 21276886 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | c52f5db6-409d-4521-8ed5-48d6a9fccb8a |
|---|
| Record created | 2015-10-30 |
|---|
| Record modified | 2020-03-03 |
|---|
