Data hiding on 3-D triangle meshes

Cayre, François; Macq, Benoît

doi:10.1109/tsp.2003.809380

Cited by 162 publications

(137 citation statements)

References 17 publications

Supporting

Mentioning

134

Contrasting

Unclassified

Order By: Relevance

“…High-capacity watermarks are often fragile, embedded in the spatial domain, taking the individual vertex coordinates as the watermarking primitives. In their work, Cayre and Macq [5] developed a high-capacity blind data-hiding algorithm for triangular meshes. The chosen watermarking primitive is the projection of a vertex on its opposite edge in a triangle.…”

Section: Brief Review Of High-capacity Mesh Watermarking Techniquesmentioning

confidence: 99%

Wavelet-based high-capacity watermarking of 3-D irregular meshes

Zaid

Hachani

Puech

2014

Multimed Tools Appl

View full text Add to dashboard Cite

International audienceDigital watermarking can be used as data hiding technique to interleave cover content with auxiliary information before transmitting and storing applications. While image and video watermarking has been widely studied, much less attention has been paid to its application in 3D mesh models. This is principally due to their intrinsic irregular sampling nature. This paper proposes a high-capacity watermarking scheme for the purpose of inserting meta-data into 3D triangle meshes. Our proposal can be applied to meshes with arbitrary topology by using irregular wavelet-based analysis. The watermark is embedded in an appropriate resolution level by quantizing the norms of wavelet coefficient vectors. To ensure robustness to similarity transformation, a robust synchronization (indexing) mechanism is performed on the 3D model after irregular wavelet analysis. Experimental results show that our watermarking framework is robust to common geometric attacks and can provide relatively high data embedding rate whereas keep a relative lower distortion

show abstract

Section: Brief Review Of High-capacity Mesh Watermarking Techniquesmentioning

confidence: 99%

Wavelet-based high-capacity watermarking of 3-D irregular meshes

Zaid

Hachani

Puech

2014

Multimed Tools Appl

View full text Add to dashboard Cite

show abstract

“…If there is at least one unmarked vertex in a faceJ;', the face will be qualified to extract the embedded bit information and its centroid position vi,'will be calculated using Eq. (6). Then the distance DJ from the faceJf;'to the mesh centroid can be calculated by The embedded bit information w ' (i) can be extracted by…”

Section: The Authentication Processmentioning

confidence: 99%

A New Fragile Mesh Watermarking Algorithm for Authentication

Cheung

2005

Security and Privacy in the Age of Ubiquitous Computing

View full text Add to dashboard Cite

Abstract:In this paper, we propose a new fragile watermarking algorithm based on the global characteristics of the mesh geometry to authenticate 3D mesh models.In our method, a sequence of data bits is adaptively embedded into the mesh model by properly adjusting the vertex positions, and the bit information can be blindly extracted from the watermarked mesh model using a key. The embedding process is adaptive to the mesh model so that the watermarked mesh is perceptually indistinguishable from the original. We show that the embedded watermark is invariant to affine transformation but sensitive to other operations. Besides, the embedding strength is adjustable and can be controlled to a certain extent that even a trivial tampering with the watermarked mesh would lead the watermark signal to change. Therefore, unauthorized modifications of the mesh models can be detected and estimated.

show abstract

“…Watermark- ing of three-dimensional (3-D) meshes was first introduced in [6], where 3-D meshes include Virtual Reality Modeling Language and computer-aided design. In the recent years, several 3-D watermarking methods have been presented in [7]- [9] to improve the performance in terms of perceptual transparency, robustness and payload of the watermark.…”

Section: Introductionmentioning

confidence: 99%

A Correlation-Based Watermarking Technique of 3-D Meshes via Cyclic Signal Processing

Uto

Takemura

Kamitani

et al. 2012

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYThis paper describes a blind watermarking scheme through cyclic signal processing. Due to various rapid networks, there is a growing demand of copyright protection for multimedia data. As efficient watermarking of images, there exist two major approaches: a quantizationbased method and a correlation-based method. In this paper, we proposes a correlation-based watermarking technique of three-dimensional (3-D) polygonal models using the fast Fourier transforms (FFTs). For generating a watermark with desirable properties, similar to a pseudonoise signal, an impulse signal on a two-dimensional (2-D) space is spread through the FFT, the multiplication of a complex sinusoid signal, and the inverse FFT. This watermark, i.e., spread impulse signal, in a transform domain is converted to a spatial domain by an inverse wavelet transform, and embedded into 3-D data aligned by the principle component analysis (PCA). In the detection procedure, after realigning the watermarked mesh model through the PCA, we map the 3-D data on the 2-D space via block segmentation and averaging operation. The 2-D data are processed by the inverse system, i.e., the FFT, the division of the complex sinusoid signal, and the inverse FFT. From the resulting 2-D signal, we detect the position of the maximum value as a signature. For 3-D bunny models, detection rates and information capacity are shown to evaluate the performance of the proposed method.

show abstract

Data hiding on 3-D triangle meshes

Cited by 162 publications

References 17 publications

Wavelet-based high-capacity watermarking of 3-D irregular meshes

Wavelet-based high-capacity watermarking of 3-D irregular meshes

A New Fragile Mesh Watermarking Algorithm for Authentication

A Correlation-Based Watermarking Technique of 3-D Meshes via Cyclic Signal Processing

Contact Info

Product

Resources

About