Share Email Print

Proceedings Paper

Sensitivity analysis of Euclidean minimum spanning tree
Author(s): N. Tournier; W. Puech; G. Subsol; J.-P. Pedeboy
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 4 February 2010
PDF: 10 pages
Proc. SPIE 7526, Three-Dimensional Image Processing (3DIP) and Applications, 75260G (4 February 2010); doi: 10.1117/12.839455
Show Author Affiliations
N. Tournier, LIRMM Lab., CNRS, Univ. Montpellier II (France)
Strategies S.a. (France)
W. Puech, LIRMM Lab., CNRS, Univ. Montpellier II (France)
G. Subsol, LIRMM Lab., CNRS, Univ. Montpellier II (France)
J.-P. Pedeboy, Strategies S.a. (France)

Published in SPIE Proceedings Vol. 7526:
Three-Dimensional Image Processing (3DIP) and Applications
Atilla M. Baskurt, Editor(s)

© SPIE. Terms of Use
Back to Top