Share Email Print

Proceedings Paper

Finding robust vertices for 3D synchronization based on Euclidean minimum spanning tree
Author(s): N. Tournier; W. Puech; G. Subsol; J.-P. Pedeboy
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Synchronization in 3D data hiding is one of the main problems. We need to know where we can embed information, 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.

Paper Details

Date Published: 27 January 2011
PDF: 7 pages
Proc. SPIE 7864, Three-Dimensional Imaging, Interaction, and Measurement, 78640W (27 January 2011); doi: 10.1117/12.872384
Show Author Affiliations
N. Tournier, LIRMM, CNRS, Univ. de Montpellier 2 (France)
Stratégies S.A. (France)
W. Puech, LIRMM, CNRS, Univ. de Montpellier 2 (France)
G. Subsol, LIRMM, CNRS, Univ. de Montpellier 2 (France)
J.-P. Pedeboy, Stratégies S.A. (France)

Published in SPIE Proceedings Vol. 7864:
Three-Dimensional Imaging, Interaction, and Measurement
J. Angelo Beraldin; Ian E. McDowall; Atilla M. Baskurt; Margaret Dolinsky; Geraldine S. Cheok; Michael B. McCarthy; Ulrich Neuschaefer-Rube, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?