A robust high-capacity watermarking algorithm
Document Type
Conference Proceeding
Publication Date
12-1-2006
Abstract
We present a new robust high-capacity watermarking algorithm using the block-based chaotic map and the intersection-based pixels collection. The block-based chaotic map is created to break the local spatial similarity of an image partially. The intersection-based pixels collection is utilized to generate a container and a reference register which is used to indicate the location of the container for watermark embedding and extracting. Experimental results demonstrate that our algorithm can achieve robust high-capacity performance in comparisons with the current watermarking algorithm. It can embed more than 5,050 bits of information in an image of size 202X202. It can achieve a low message error rate of less than 0.22 even under various attacks such as additive noise, low-pass filtering, and lossy compression.
Identifier
34250837917 (Scopus)
ISBN
[078039593X, 9780780395930]
Publication Title
2006 IEEE International Conference on Electro Information Technology
External Full Text Location
https://doi.org/10.1109/EIT.2006.252127
First Page
442
Last Page
447
Recommended Citation
Wu, Yi Ta; Shih, Frank Y.; and Wu, Yih Tyng, "A robust high-capacity watermarking algorithm" (2006). Faculty Publications. 18709.
https://digitalcommons.njit.edu/fac_pubs/18709
