Data hiding - Theory and algorithms

Pierre Moulin; Ralf Koetter

doi:10.1142/9789812709066_0004

Data hiding - Theory and algorithms

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Abstract

This paper reviews the fundamentals of the data hiding problem. Data hiding can be viewed as a game between two teams (embedder/decoder vs attacker), and optimal data-hiding and attack strategies may be developed in this context. This paper presents a framework for developing such strategies as well as practical codes. The theory is applied to image watermarking examples.

Original language	English (US)
Title of host publication	Mathematics And Computation In Imaging Science And Information Processing
Publisher	World Scientific Publishing Co.
Pages	131-176
Number of pages	46
ISBN (Electronic)	9789812709066
DOIs	https://doi.org/10.1142/9789812709066_0004
State	Published - Jan 1 2007

ASJC Scopus subject areas

General Mathematics
General Engineering
General Computer Science

Online availability

10.1142/9789812709066_0004

Library availability

Discover UIUC Full Text

Cite this

@inbook{72b1f6b32872400bbc2257d81d102c86,

title = "Data hiding - Theory and algorithms",

abstract = "This paper reviews the fundamentals of the data hiding problem. Data hiding can be viewed as a game between two teams (embedder/decoder vs attacker), and optimal data-hiding and attack strategies may be developed in this context. This paper presents a framework for developing such strategies as well as practical codes. The theory is applied to image watermarking examples.",

author = "Pierre Moulin and Ralf Koetter",

note = "Publisher Copyright: {\textcopyright} 2007 by World Scientific Publishing Co. Pte. Ltd.",

year = "2007",

month = jan,

day = "1",

doi = "10.1142/9789812709066_0004",

language = "English (US)",

pages = "131--176",

booktitle = "Mathematics And Computation In Imaging Science And Information Processing",

publisher = "World Scientific Publishing Co.",

}

TY - CHAP

T1 - Data hiding - Theory and algorithms

AU - Moulin, Pierre

AU - Koetter, Ralf

PY - 2007/1/1

Y1 - 2007/1/1

N2 - This paper reviews the fundamentals of the data hiding problem. Data hiding can be viewed as a game between two teams (embedder/decoder vs attacker), and optimal data-hiding and attack strategies may be developed in this context. This paper presents a framework for developing such strategies as well as practical codes. The theory is applied to image watermarking examples.

AB - This paper reviews the fundamentals of the data hiding problem. Data hiding can be viewed as a game between two teams (embedder/decoder vs attacker), and optimal data-hiding and attack strategies may be developed in this context. This paper presents a framework for developing such strategies as well as practical codes. The theory is applied to image watermarking examples.

UR - http://www.scopus.com/inward/record.url?scp=85115678734&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85115678734&partnerID=8YFLogxK

U2 - 10.1142/9789812709066_0004

DO - 10.1142/9789812709066_0004

M3 - Chapter

AN - SCOPUS:85115678734

SP - 131

EP - 176

BT - Mathematics And Computation In Imaging Science And Information Processing

PB - World Scientific Publishing Co.

ER -

Data hiding - Theory and algorithms

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this