Digital watermarking of polygonal meshes with linear operators of scale functions

Digital watermarking is already used to establish the copyright of graphics, audio and text, and is now increasingly important for the protection of geometric data as well. Watermarking polygonal models in the spectral domain gives protection against similarity transformation, mesh smoothing, and ad...

Full description

Saved in:
Bibliographic Details
Published in:Computer aided design 2010-03, Vol.42 (3), p.163-172
Main Authors: Choi, Hyeong-In, Kim, Tae-wan, Kwon, Song-Hwa, Moon, Hwan Pyo, Park, Sung Ha, Shin, Heon-Ju, Sohn, Jung-Kyo
Format: Article
Language:English
Subjects:
3D mesh processing
Additives
Digital signal processing
Digital watermarking
Finite element method
Linear operators
Mathematical analysis
Mathematical models
Spectra
Spectral decomposition
Watermarking
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Digital watermarking is already used to establish the copyright of graphics, audio and text, and is now increasingly important for the protection of geometric data as well. Watermarking polygonal models in the spectral domain gives protection against similarity transformation, mesh smoothing, and additive random noise attacks. However, drawbacks exist in analyzing the eigenspace of Laplacian matrices. In this paper we generalize an existing spectral decomposition and propose a new spatial watermarking technique based on this generalization. While inserting the watermark, we avoid the cost of finding the eigenvalues and eigenvectors of a Laplacian matrix in spectral decomposition; instead we use linear operators derived from scaling functions that are generated from Chebyshev polynomials. Experimental results show how the cost of inserting and detecting watermarks can be traded off against robustness under attacks like additive random noise and affine transformation.
ISSN:0010-4485
1879-2685
DOI:10.1016/j.cad.2009.09.002