An improved orthogonal dirty-paper coding method for watermarking applications

Xiaotian Xu*, Yong Liang Guan, Kah Chan Teh, Boon Chong Ng

*Corresponding author for this work

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

Abstract

This paper presents an improved orthogonal dirty-paper coding method for digital watermarking applications such as multimedia data authentication or digital rights management. The dirty-paper coding is based on the orthogonal Walsh-Hadamard Codes with Binning. Codeword selection is based on maximum correlation to the encoder side information. In contrast to the conventional dirty-paper codes, the encoder side information is based on a constrained extraction of the host data. The decoding error rate expression of the proposed dirty-paper watermarking scheme is derived and verified by simulations to be fairly accurate. It is found that this watermarking method is able to achieve very low visual distortion to host image and very good detection probability for the embedded watermark information.

Original languageEnglish
Title of host publicationProceedings of the 2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference, DEST 2007
Pages491-494
Number of pages4
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference, DEST 2007 - Cairns, Australia
Duration: Feb 21 2007Feb 23 2007

Publication series

NameProceedings of the 2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference, DEST 2007

Conference

Conference2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference, DEST 2007
Country/TerritoryAustralia
CityCairns
Period2/21/072/23/07

ASJC Scopus Subject Areas

  • Electrical and Electronic Engineering

Keywords

  • Dirty-paper coding
  • Watermarking

Fingerprint

Dive into the research topics of 'An improved orthogonal dirty-paper coding method for watermarking applications'. Together they form a unique fingerprint.

Cite this