5 December 2001 Spectrum spreading algorithm for efficient embedding of watermarks
Author Affiliations +
Abstract
Time-domain and frequency-domain spreading algorithms are presented in this paper. However, detection algorithm does not rely on correlation method, but based on patchwork method. Time-domain algorithm can survive translation and clipping attacks. Frequency-domain algorithm is robust against compression attack. Embedding and detection functions are presented. Simulation results show the effectiveness of the algorithms.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
In Kwon Yeo, Hyoung-Joong Kim, "Spectrum spreading algorithm for efficient embedding of watermarks", Proc. SPIE 4475, Mathematics of Data/Image Coding, Compression, and Encryption IV, with Applications, (5 December 2001); doi: 10.1117/12.449587; https://doi.org/10.1117/12.449587
PROCEEDINGS
9 PAGES


SHARE
KEYWORDS
Digital watermarking

Error analysis

Image processing

Detection and tracking algorithms

Image compression

Signal to noise ratio

Signal detection

RELATED CONTENT

Quantization watermarking
Proceedings of SPIE (May 09 2000)
Improved watermarking scheme by reference signal mingling
Proceedings of SPIE (April 29 2002)
A new method for outlier removal in time delay based...
Proceedings of SPIE (September 18 2003)
An adaptive watermarking scheme in the DCT domain
Proceedings of SPIE (September 16 2005)

Back to Top