Scalar Costa Scheme for Information Embedding (2002)
Cached
Download Links
| Venue: | IEEE Transactions on Signal Processing |
| Citations: | 67 - 1 self |
BibTeX
@ARTICLE{Eggers02scalarcosta,
author = {Joachim J. Eggers and Robert Bäuml and Roman Tzschoppe and Bernd Girod},
title = {Scalar Costa Scheme for Information Embedding},
journal = {IEEE Transactions on Signal Processing},
year = {2002},
volume = {51},
pages = {1003--1019}
}
Years of Citing Articles
OpenURL
Abstract
Research on information embedding and particularly information hiding techniques has received considerable attention within the last years due to its potential application in multimedia security. Digital watermarking, which is an information hiding technique where the embedded information is robust against malicious or accidental attacks, might offer new possibilities to enforce the copyrights of multimedia data. In this article, the specific case of information embedding into independent identically distributed (IID) data and attacks by additive white Gaussian noise (AWGN) is considered. The original data is not available to the decoder. For Gaussian data, Costa proposed already in 1983 a scheme that theoretically achieves the capacity of this communication scenario. However, Costa's scheme is not practical. Thus, several research groups have proposed suboptimal practical communication schemes based on Costa's idea. The goal of this artical is to give a complete performance analysis of the scalar Costa scheme (SCS) which is a suboptimal technique using scalar embedding and reception functions. Information theoretic bounds and simulation results with state-of-the-art coding techniques are compared. Further, reception after amplitude scaling attacks and the invertibility of SCS embedding are investigated. Keywords Information embedding, communication with side-information, blind digital watermarking, scalar Costa scheme I.







