Finding robust vertices for 3D synchronization based on Euclidean minimum spanning tree

N. Tournier; W. Puech; G. Subsol; J.-P. Pedeboy

doi:10.1117/12.872384

Translator Disclaimer

27 January 2011 Finding robust vertices for 3D synchronization based on Euclidean minimum spanning tree

N. Tournier, W. Puech, G. Subsol, J.-P. Pedeboy

Author Affiliations +

Proceedings Volume 7864, Three-Dimensional Imaging, Interaction, and Measurement; 78640W (2011) https://doi.org/10.1117/12.872384
Event: IS&T/SPIE Electronic Imaging, 2011, San Francisco Airport, California, United States

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.

Citation Download Citation

N. Tournier, W. Puech, G. Subsol, and J.-P. Pedeboy "Finding robust vertices for 3D synchronization based on Euclidean minimum spanning tree", Proc. SPIE 7864, Three-Dimensional Imaging, Interaction, and Measurement, 78640W (27 January 2011); https://doi.org/10.1117/12.872384

ACCESS THE FULL ARTICLE