Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00845510
Contributor : William Puech <>
Submitted on : Tuesday, August 27, 2013 - 3:27:38 PM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM
Document(s) archivé(s) le : Wednesday, April 5, 2017 - 1:14:12 PM

File

SPIE11.pdf
Files produced by the author(s)

Identifiers

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

Share

Metrics

Record views

186

Files downloads

503