Translator Disclaimer
4 February 2010 Sensitivity analysis of Euclidean minimum spanning tree
Author Affiliations +
Abstract
In 3D steganography and watermarking, the synchronization of the hidden data is a major problem. We need to know where the message is embedded in order to extract the correct information. Various algorithms have been proposed for the last couple of years and we focused on a method based on Euclidean minimum spanning tree (EMST) for the mesh vertices. In this paper we analyze the sensitivity of the EMST structure in order to propose a new method more robust. We present a new theoretical analysis and we propose to visualize the robustness of the EMST. Moreover, we can apply this analysis to various applications that can be useful in 3D steganography such fragile area detection and prediction of the 3D object robustness during transmission on a noisy channel.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
N. Tournier, W. Puech, G. Subsol, and J.-P. Pedeboy "Sensitivity analysis of Euclidean minimum spanning tree", Proc. SPIE 7526, Three-Dimensional Image Processing (3DIP) and Applications, 75260G (4 February 2010); https://doi.org/10.1117/12.839455
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Data hiding technique in JPEG compressed domain
Proceedings of SPIE (July 31 2001)
Online system for managing watermarked-images database
Proceedings of SPIE (January 16 2005)
Content-based watermarking technique
Proceedings of SPIE (March 21 2001)
Watermarking of 3D objects based on 2D apparent contours
Proceedings of SPIE (February 16 2006)

Back to Top