The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Scalar costa scheme for information embedding
Abstract
Research on information embedding, 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 paper, 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, in 1983, Costa proposed 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 paper 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Secure spread spectrum watermarking for multimedia
Cox, I. J., Kilian, J., Leighton, F. T., & Shamoon, T. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.650120 · Cited by 5,299
Channel coding with multilevel/phase signals
Ungerboeck, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056454 · Cited by 3,751
Writing on dirty paper (Corresp.)
Costa, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056659 · Cited by 3,735
Sphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
Near optimum error correcting coding and decoding: turbo-codes
Berrou, C., & Glavieux, A. (1996) · IEEE Transactions on Communications · doi:10.1109/26.539767 · Cited by 2,761
Chen, B., & Wornell, G. W. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.923725 · Cited by 2,095
Sphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1988) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2016-7 · Cited by 1,532
CODING FOR CHANNEL WITH RANDOM PARAMETERS
Gel'fand, S. I., & Pinsker, M. S. (1980) · Cited by 890
Nested linear/lattice codes for structured multiterminal binning
Zamir, R., Shamai, S., & Erez, U. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003821 · Cited by 876
Information-theoretic analysis of information hiding
Moulin, P., & O'Sullivan, J. A. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.808134 · Cited by 673
Watermarking as communications with side information
Cox, I. J., Miller, M. L., & McKellips, A. L. (1999) · Proceedings of the IEEE · doi:10.1109/5.771068 · Cited by 522
Gray, R. M., & Stockham, T. G. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256489 · Cited by 409
Dither Signals and Their Effect on Quantization Noise
Schuchman, L. (1964) · IEEE Transactions on Communications · doi:10.1109/tcom.1964.1088973 · Cited by 408
Digital watermarking and information embedding using dither modulation
Chen, B., & Wornell, G. W. (2002) · IEEE International Workshop on Multimedia Signal Processing (MMSP) · doi:10.1109/mmsp.1998.738946 · Cited by 165
Digital watermarking of MPEG-2 coded video in the bitstream domain
Hartung, F. H., & Girod, B. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1997.595326 · Cited by 131
Self-citationDither modulation: a new approach to digital watermarking and information embedding
Chen, B., & Wornell, G. W. (1999) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.344684 · Cited by 108
Design and analysis of digital watermarking, information embedding, and data hiding systems
Chen, B., & Wornell, G. W. (2000) · Cited by 74
Achievable performance of digital watermarking systems
Chen, B., & Wornell, G. W. (2003) · IEEE International Conference on Multimedia Computing and Systems (ICMCS) · doi:10.1109/mmcs.1999.779113 · Cited by 67
Preprocessed and postprocessed quantization index modulation methods for digital watermarking
Chen, B., & Wornell, G. W. (2000) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.384995 · Cited by 61
Provably robust digital watermarking
Chen, B., & Wornell, G. W. (1999) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.371232 · Cited by 52
Power-spectrum condition for energy-efficient watermarking
Su, J. K., & Girod, B. (2002) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2002.806535 · Cited by 50
Self-citationPower-spectrum condition for energy-efficient watermarking
Su, J. K., & Girod, B. (2003) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.1999.821618 · Cited by 40
Self-citationRobust optimization solution to the data hiding problem using distributed source coding principles
Chou, J. C., Pradhan, S. S., Ghaoui, L. E., et al. (2000) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.382959 · Cited by 30
Cited by
On the achievable throughput of a multiantenna Gaussian broadcast channel
Caire, G., & Shamai, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813523 · Cited by 2,527
Moulin, P., & Koetter, R. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2005.859599 · Cited by 306
Watermarking security: theory and practice
Cayre, F., Fontaine, C., & Furon, T. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.855418 · Cited by 300
A survey of Deep Neural Network watermarking techniques
Li, Y., Wang, H., & Barni, M. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.07.051 · Cited by 177
Metadata
- Authors
- Eggers, J. J., Bauml, R., Tzschoppe, R., & Girod, B.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2003-04
- Volume
- 51
- Issue
- 4
- Pages
- 1003-1019
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2139490206
- Cited by
- 357
- References
- 24
- FWCI
- 38.97
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.