The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
New blind steganalysis and its implications
Abstract
The contribution of this paper is two-fold. First, we describe an improved version of a blind steganalysis method previously proposed by Holotyak et al. and compare it to current state-of-the-art blind steganalyzers. The features for the blind classifier are calculated in the wavelet domain as higher-order absolute moments of the noise residual. This method clearly shows the benefit of calculating the features from the noise residual because it increases the features' sensitivity to embedding, which leads to improved detection results. Second, using this detection engine, we attempt to answer some fundamental questions, such as "how much can we improve the reliability of steganalysis given certain a priori side-information about the image source?" Moreover, we experimentally compare the security of three steganographic schemes for images stored in a raster format - (1) pseudo-random ±1 embedding using ternary matrix embedding, (2) spatially adaptive ternary ±1 embedding, and (3) perturbed quantization while converting a 16-bit per channel image to an 8-bit gray scale image.
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
Cox, I. (2002) · Journal of Electronic Imaging · doi:10.1117/1.1494075 · Cited by 2,289
The Prisoners’ Problem and the Subliminal Channel
Simmons, G. J. (1984) · Advances in Cryptology · doi:10.1007/978-1-4684-4730-9_5 · Cited by 977
Steganalysis using image quality metrics
Avcibas, I., Memon, N., & Sankur, B. (2003) · IEEE Transactions on Image Processing · doi:10.1109/tip.2002.807363 · Cited by 562
Detecting Hidden Messages Using Higher-Order Statistics and Support Vector Machines
Lyu, S., & Farid, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36415-3_22 · Cited by 450
Steganalysis of additive-noise modelable information hiding:
Harmsen, J. J., & Pearlman, W. A. (2003) · SPIE Proceedings · doi:10.1117/12.476813 · Cited by 400
Kivanc Mihcak, M., Kozintsev, I., & Ramchandran, K. (1999) · 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258) · doi:10.1109/icassp.1999.757535 · Cited by 283
Image Steganography and Steganalysis: Concepts and Practice
Chandramouli, R., Kharrazi, M., & Memon, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24624-4_3 · Cited by 213
Image Steganalysis with Binary Similarity Measures
Avcıbaş, İ., Kharrazi, M., Memon, N., & Sankur, B. (2005) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/asp.2005.2749 · Cited by 190
Steganalysis using color wavelet statistics and one-class support vector machines
Lyu, S., & Farid, H. (2004) · SPIE Proceedings · doi:10.1117/12.526012 · Cited by 168
A General Framework for Structural Steganalysis of LSB Replacement
Ker, A. D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11558859_22 · Cited by 158
Xuan, G., Shi, Y. Q., Gao, J., et al. (2005) · Lecture notes in computer science · doi:10.1007/11558859_20 · Cited by 157
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
Self-citationDigital Watermarking and Steganography
(2008) · Elsevier eBooks · doi:10.1016/b978-0-12-372585-1.x5001-3 · Cited by 1,656
Ensemble Classifiers for Steganalysis of Digital Media
Kodovsky, J., Fridrich, J., & Holub, V. (2012) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2011.2175919 · Cited by 1,064
Self-citationUsing 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
Deep Learning Hierarchical Representations for Image Steganalysis
Ye, J., Ni, J., & Yi, Y. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2710946 · Cited by 823
Metadata
- Authors
- Goljan, M., Fridrich, J., & Holotyak, T.
- Venue
- SPIE Proceedings
- Publisher
- SPIE
- Published
- 2006-02-02
- Volume
- 6072
- Pages
- 607201-607201
- ISSN
- 0277-786X (ISSN-L)
- OpenAlex
- W2004686575
- Cited by
- 265
- References
- 11
- FWCI
- 20.92
- Type
- conference paper
- 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.