Paper Info
Title
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 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.
Year
DOI
Venue
2011
10.1117/12.872384
Proceedings of SPIE
Keywords
Field
DocType
Feature Vertices,3D Synchronization,3D Watermarking,Graph Theory
Graph center,Robustness (computer science),Spanning tree,Artificial intelligence,Minimum spanning tree,Computer vision,Mathematical optimization,Minimum degree spanning tree,Vertex (geometry),k-minimum spanning tree,Euclidean minimum spanning tree,Algorithm,Physics
Conference
Volume
ISSN
Citations 
7864
0277-786X
0
PageRank 
References 
Authors
0.34
5
4
Name
Order
Citations
PageRank
Nicolas Tournier111.41
William Puech253576.74
Gérard Subsol394.33
J. P. Pedeboy4193.91