Optimal embedding for watermarking in discrete data spaces

Stéphane Bounkong, Borémi Toch, David Saad

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

Abstract

In this paper, we address the problem of robust information embedding in digital data. Such a process is carried out by introducing modifications to the original data that one would like to keep minimal. It assumes that the data, which includes the embedded information, is corrupted before the extraction is carried out. We propose a principled way to tailor an efficient embedding process for given data and noise statistics.
Original languageEnglish
Title of host publicationInformation hiding
Subtitle of host publication7th international workshop, IH 2005, Barcelona, Spain, June 6-8, 2005. Revised selected papers
EditorsMauro Barni, Jordi Herrera-Joancomartí, Stefan Katzenbeisser, Fernando Pérez-González
Place of PublicationBerlin (DE)
PublisherSpringer
Pages77-90
Number of pages14
ISBN (Electronic)978-3-540-31481-3
ISBN (Print)978-3-540-29039-1
DOIs
Publication statusPublished - 2006
Event7th International Workshop on Information Hiding - Barcelona, Spain
Duration: 6 Jun 20058 Jun 2005

Publication series

NameLecture notes in computer science
PublisherSpringer
Volume3727
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Workshop

Workshop7th International Workshop on Information Hiding
Abbreviated titleIH 2005
CountrySpain
CityBarcelona
Period6/06/058/06/05

Fingerprint

Watermarking
Statistics

Cite this

Bounkong, S., Toch, B., & Saad, D. (2006). Optimal embedding for watermarking in discrete data spaces. In M. Barni, J. Herrera-Joancomartí, S. Katzenbeisser, & F. Pérez-González (Eds.), Information hiding: 7th international workshop, IH 2005, Barcelona, Spain, June 6-8, 2005. Revised selected papers (pp. 77-90). (Lecture notes in computer science; Vol. 3727). Berlin (DE): Springer. https://doi.org/10.1007/11558859_7
Bounkong, Stéphane ; Toch, Borémi ; Saad, David. / Optimal embedding for watermarking in discrete data spaces. Information hiding: 7th international workshop, IH 2005, Barcelona, Spain, June 6-8, 2005. Revised selected papers. editor / Mauro Barni ; Jordi Herrera-Joancomartí ; Stefan Katzenbeisser ; Fernando Pérez-González. Berlin (DE) : Springer, 2006. pp. 77-90 (Lecture notes in computer science).
@inproceedings{2ee070cfb2a144ecbf06f453f0843037,
title = "Optimal embedding for watermarking in discrete data spaces",
abstract = "In this paper, we address the problem of robust information embedding in digital data. Such a process is carried out by introducing modifications to the original data that one would like to keep minimal. It assumes that the data, which includes the embedded information, is corrupted before the extraction is carried out. We propose a principled way to tailor an efficient embedding process for given data and noise statistics.",
author = "St{\'e}phane Bounkong and Bor{\'e}mi Toch and David Saad",
year = "2006",
doi = "10.1007/11558859_7",
language = "English",
isbn = "978-3-540-29039-1",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "77--90",
editor = "Mauro Barni and Jordi Herrera-Joancomart{\'i} and Stefan Katzenbeisser and Fernando P{\'e}rez-Gonz{\'a}lez",
booktitle = "Information hiding",
address = "Germany",

}

Bounkong, S, Toch, B & Saad, D 2006, Optimal embedding for watermarking in discrete data spaces. in M Barni, J Herrera-Joancomartí, S Katzenbeisser & F Pérez-González (eds), Information hiding: 7th international workshop, IH 2005, Barcelona, Spain, June 6-8, 2005. Revised selected papers. Lecture notes in computer science, vol. 3727, Springer, Berlin (DE), pp. 77-90, 7th International Workshop on Information Hiding, Barcelona, Spain, 6/06/05. https://doi.org/10.1007/11558859_7

Optimal embedding for watermarking in discrete data spaces. / Bounkong, Stéphane; Toch, Borémi; Saad, David.

Information hiding: 7th international workshop, IH 2005, Barcelona, Spain, June 6-8, 2005. Revised selected papers. ed. / Mauro Barni; Jordi Herrera-Joancomartí; Stefan Katzenbeisser; Fernando Pérez-González. Berlin (DE) : Springer, 2006. p. 77-90 (Lecture notes in computer science; Vol. 3727).

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

TY - GEN

T1 - Optimal embedding for watermarking in discrete data spaces

AU - Bounkong, Stéphane

AU - Toch, Borémi

AU - Saad, David

PY - 2006

Y1 - 2006

N2 - In this paper, we address the problem of robust information embedding in digital data. Such a process is carried out by introducing modifications to the original data that one would like to keep minimal. It assumes that the data, which includes the embedded information, is corrupted before the extraction is carried out. We propose a principled way to tailor an efficient embedding process for given data and noise statistics.

AB - In this paper, we address the problem of robust information embedding in digital data. Such a process is carried out by introducing modifications to the original data that one would like to keep minimal. It assumes that the data, which includes the embedded information, is corrupted before the extraction is carried out. We propose a principled way to tailor an efficient embedding process for given data and noise statistics.

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

UR - http://link.springer.com/chapter/10.1007/11558859_7

U2 - 10.1007/11558859_7

DO - 10.1007/11558859_7

M3 - Conference contribution

AN - SCOPUS:33746636830

SN - 978-3-540-29039-1

T3 - Lecture notes in computer science

SP - 77

EP - 90

BT - Information hiding

A2 - Barni, Mauro

A2 - Herrera-Joancomartí, Jordi

A2 - Katzenbeisser, Stefan

A2 - Pérez-González, Fernando

PB - Springer

CY - Berlin (DE)

ER -

Bounkong S, Toch B, Saad D. Optimal embedding for watermarking in discrete data spaces. In Barni M, Herrera-Joancomartí J, Katzenbeisser S, Pérez-González F, editors, Information hiding: 7th international workshop, IH 2005, Barcelona, Spain, June 6-8, 2005. Revised selected papers. Berlin (DE): Springer. 2006. p. 77-90. (Lecture notes in computer science). https://doi.org/10.1007/11558859_7