Finding Robust Vertices for 3D Synchronization Based on Euclidean Minimum Spanning Tree - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2011

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.
Fichier principal
Vignette du fichier
SPIE11.pdf (285.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00845510 , version 1 (27-08-2013)

Identifiers

Cite

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. pp.78640W, ⟨10.1117/12.872384⟩. ⟨lirmm-00845510⟩
99 View
249 Download

Altmetric

Share

Gmail Facebook X LinkedIn More