Finding Robust Vertices for 3D Synchronization Based on Euclidean Minimum Spanning Tree

Abstract : Synchronization in 3D data hiding is one of the main problems. We need to know where we can embed informa- tion, and be able to find this space in order to extract the message. Various algorithms propose synchronization techniques by triangle or vertex path in a 3D mesh. In this paper, we proposed a new synchronization technique based on Euclidean minimum spanning tree computing (EMST) and the analysis of the displacement of the vertices without moving the connections in the tree. Based on the analysis of the vertices, we select the most robust vertices and synchronize these areas by computing a new EMST called "robust EMST". Then, we analyze the robustness of the technique, i.e. the stability of the most robust vertices selection; and demonstrate the consistence of the criterion selection with the vertex displacement.
Type de document :
Communication dans un congrès
Electronic Imaging, Jan 2011, San Francisco, CA, United States. SPIE (7864), pp.78640W, 2011, Three-Dimensional Imaging, Interaction, and Measurement. 〈10.1117/12.872384〉
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00845510
Contributeur : William Puech <>
Soumis le : mardi 27 août 2013 - 15:27:38
Dernière modification le : jeudi 11 janvier 2018 - 06:26:18
Document(s) archivé(s) le : mercredi 5 avril 2017 - 13:14:12

Fichier

SPIE11.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Nicolas Tournier, William Puech, Gérard Subsol, Jean-Pierre Pedeboy. Finding Robust Vertices for 3D Synchronization Based on Euclidean Minimum Spanning Tree. Electronic Imaging, Jan 2011, San Francisco, CA, United States. SPIE (7864), pp.78640W, 2011, Three-Dimensional Imaging, Interaction, and Measurement. 〈10.1117/12.872384〉. 〈lirmm-00845510〉

Partager

Métriques

Consultations de la notice

72

Téléchargements de fichiers

206