A robust high-capacity watermarking algorithm

Yi Ta Wu, Frank Y. Shih, Yih Tyng Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2006 IEEE International Conference on Electro Information Technology
Pages442-447
Number of pages6
DOIs
StatePublished - Dec 1 2006
Event2006 IEEE International Conference on Electro Information Technology - East Lansing, MI, United States
Duration: May 7 2006May 10 2006

Publication series

Name2006 IEEE International Conference on Electro Information Technology

Other

Other2006 IEEE International Conference on Electro Information Technology
CountryUnited States
CityEast Lansing, MI
Period5/7/065/10/06

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Biomedical Engineering
  • Automotive Engineering

Keywords

  • Chaotic map
  • Digital watermarking
  • Multimedia security
  • Robust watermarking

Fingerprint Dive into the research topics of 'A robust high-capacity watermarking algorithm'. Together they form a unique fingerprint.

Cite this