| DOI | Trouver le DOI : https://doi.org/10.1109/INISTA.2014.6873622 |
|---|
| Auteur | Rechercher : Hadavi, Hamid; Rechercher : Viktor, Herna L.; Rechercher : Paquet, Eric1 |
|---|
| Affiliation | - Conseil national de recherches du Canada. Technologies de l'information et des communications
|
|---|
| Format | Texte, Article |
|---|
| Conférence | 2014 IEEE International Symposium on Innovations in Intelligent Systems and Applications, INISTA 2014, 23 June 2014 through 25 June 2014, Alberobello |
|---|
| Sujet | Algorithms; Animation; Deformation; Geodesy; Intelligent systems; Mapping; Particle swarm optimization (PSO); Correspondence; Deformable object; Isometry; Markovian process; Mutation; Genetic algorithms |
|---|
| Résumé | Finding correspondences between deformable objects has wide application in many domains. In information retrieval, researchers may be interested in finding similar objects, while computer animation experts may be considering ways to morph shapes. The correspondence problem is especially challenging when the objects under consideration are suspect to non-rigid deformations, noise and/or distortions. In this paper, a novel method using Quantum Particle Swarm Optimization (QPSO) and Genetic Algorithms (GA) is presented to address this issue. In our QPSO-GA algorithm we formulate the problem of correspondence detection as an optimization problem over all possible mapping in between the geodesic distance matrices associated with two sets of point clouds. We proceed to identify the optimal mapping, by first applying Quantum Particle Swarm Optimization to the permutation matrices associated with their geodesic distance matrices and then employing Genetic Algorithms in order to guide the search. Experimental results suggest that our QPSO-GA algorithm is fast, scalable, and robust. Our method accurately identifies the correspondences between objects, even in the presence of noise and distortion. |
|---|
| Date de publication | 2014-06 |
|---|
| Dans | |
|---|
| Langue | anglais |
|---|
| Publications évaluées par des pairs | Oui |
|---|
| Numéro NPARC | 21272861 |
|---|
| Exporter la notice | Exporter en format RIS |
|---|
| Signaler une correction | Signaler une correction (s'ouvre dans un nouvel onglet) |
|---|
| Identificateur de l’enregistrement | 4e42a936-61ee-4447-aa95-8dad3dc8eed8 |
|---|
| Enregistrement créé | 2014-12-03 |
|---|
| Enregistrement modifié | 2020-04-22 |
|---|
