The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes
Abstract
This paper proposes a complete practical methodology for minimizing additive distortion in steganography with general (nonbinary) embedding operation. Let every possible value of every stego element be assigned a scalar expressing the distortion of an embedding change done by replacing the cover element by this value. The total distortion is assumed to be a sum of per-element distortions. Both the payload-limited sender (minimizing the total distortion while embedding a fixed payload) and the distortion-limited sender (maximizing the payload while introducing a fixed total distortion) are considered. Without any loss of performance, the nonbinary case is decomposed into several binary cases by replacing individual bits in cover elements. The binary case is approached using a novel syndrome-coding scheme based on dual convolutional codes equipped with the Viterbi algorithm. This fast and very versatile solution achieves state-of-the-art results in steganographic applications while having linear time and space complexity w.r.t. the number of cover elements. We report extensive experimental results for a large set of relative payloads and for different distortion profiles, including the wet paper channel. Practical merit of this approach is validated by constructing and testing adaptive embedding schemes for digital images in raster and transform domains. Most current coding schemes used in steganography (matrix embedding, wet paper codes, etc.) and many new ones can be implemented using this framework.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
Arikan, E. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2021379 · Cited by 4,476
Using High-Dimensional Image Models to Perform Highly Undetectable Steganography
Pevný, T., Filler, T., & Bas, P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-16435-4_13 · Cited by 1,009
Self-citationCODING FOR CHANNEL WITH RANDOM PARAMETERS
Gel'fand, S. I., & Pinsker, M. S. (1980) · Cited by 890
Steganalysis by subtractive pixel adjacency matrix
Pevný, T., Bas, P., & Fridrich, J. (2009) · Proceedings of the 11th ACM workshop on Multimedia and security · doi:10.1145/1597817.1597831 · Cited by 769
Self-citationStatistically undetectable jpeg steganography
Fridrich, J., Pevný, T., & Kodovský, J. (2007) · doi:10.1145/1288869.1288872 · Cited by 377
Self-citationMoulin, P., & Koetter, R. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2005.859599 · Cited by 306
Gibbs Construction in Steganography
Filler, T., & Fridrich, J. (2010) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2010.2077629 · Cited by 302
Self-citationMatrix Embedding for Large Payloads
Fridrich, J., & Soukal, D. (2006) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2006.879281 · Cited by 278
Self-citationKodovský, J., & Fridrich, J. (2009) · Proceedings of the 11th ACM workshop on Multimedia and security · doi:10.1145/1597817.1597830 · Cited by 259
Self-citationBatch Steganography and Pooled Steganalysis
Ker, A. D. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74124-4_18 · Cited by 138
The square root law of steganographic capacity for Markov covers
Filler, T., Ker, A. D., & Fridrich, J. (2009) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.805911 · Cited by 96
Self-citationImproving Embedding Efficiency of Covering Codes for Applications in Steganography
Zhang, W., Wang, S., & Zhang, X. (2007) · IEEE Communications Letters · doi:10.1109/lcomm.2007.070438 · Cited by 91
Modern steganalysis can detect YASS
Kodovský, J., Pevný, T., & Fridrich, J. (2010) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.838768 · Cited by 89
Self-citationOn completeness of feature spaces in blind steganalysis
Kodovský, J., & Fridrich, J. (2008) · ACM workshop on Multimedia and security · doi:10.1145/1411328.1411352 · Cited by 41
Self-citation
Cited by
Rich Models for Steganalysis of Digital Images
Fridrich, J., & Kodovsky, J. (2012) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2012.2190402 · Cited by 2,144
“While the latter may rightfully seem rather out-of-reach due to the fact that steganography can be designed to minimize the disturbance in a fixed model space using the Feature-Correction Method (FCM) [8], [26] or the framework described in [10], [12], model preservation will likely become increasingly more difficult…”
Self-citation”Break Our Steganographic System”: The Ins and Outs of Organizing BOSS
Bas, P., Filler, T., & Pevný, T. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24178-9_5 · Cited by 1,250
Self-citationUniversal distortion function for steganography in an arbitrary domain
Holub, V., Fridrich, J., & Denemark, T. (2014) · EURASIP Journal on Information Security · doi:10.1186/1687-417x-2014-1 · Cited by 1,202
Self-citationDesigning steganographic distortion using directional filters
Holub, V., & Fridrich, J. (2012) · 2012 IEEE International Workshop on Information Forensics and Security (WIFS) · doi:10.1109/wifs.2012.6412655 · Cited by 966
Self-citationA new cost function for spatial image steganography
Li, B., Wang, M., Huang, J., & Li, X. (2014) · 2014 IEEE International Conference on Image Processing (ICIP) · doi:10.1109/icip.2014.7025854 · Cited by 632
Metadata
- Authors
- Filler, T., Judas, J., & Fridrich, J.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2011-09
- Volume
- 6
- Issue
- 3
- Pages
- 920-935
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2134527668
- Cited by
- 966
- References
- 18
- FWCI
- 28.64
- 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.