Dirty-paper trellis-code watermarking with orthogonal arcs

Taekyung Kim, Taesuk Oh, Yong Cheol Kim, Seongjong Choi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Dirty-paper trellis-code watermarking with random-valued arcs is slow since the embedding into the cover work is performed on path-level which entails many Viterbi decodings through random convergence. We present a fast deterministic embedding in a trellis-code with orthogonal arcs. The proposed algorithm has a speedup factor of the message size since it is based on arc-level modification of the cover work in a bit-by-bit manner. Experimental results show that the proposed embedding provides higher fidelity and lower BER against various types of attacks, compared with conventional informed methods.

Original languageEnglish
Title of host publicationAdvances in Image and Video Technology - First Pacific Rim Symposium, PSIVT 2006, Proceedings
PublisherSpringer Verlag
Number of pages10
ISBN (Print)354068297X, 9783540682974
StatePublished - 2006
Event1st Pacific Rim Symposium on Image and Video Technology, PSIVT 2006 - Hsinchu, Taiwan, Province of China
Duration: 10 Dec 200613 Dec 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4319 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference1st Pacific Rim Symposium on Image and Video Technology, PSIVT 2006
Country/TerritoryTaiwan, Province of China


  • Informed watermarking
  • Orthogonal arc
  • Trellis-code


Dive into the research topics of 'Dirty-paper trellis-code watermarking with orthogonal arcs'. Together they form a unique fingerprint.

Cite this