Robust Coverless Image Steganography Based on DCT and LDA Topic Classification
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
In order to improve the robustness and capability of resisting image steganalysis, a novel coverless image steganography algorithm based on discrete cosine transform and latent dirichlet allocation (LDA) topic classification is proposed. First, latent dirichlet allocation topic model is utilized for classifying the image database. Second, the images belonging to one topic are selected, and 8 × 8 block discrete cosine transform is performed to these images. Then robust feature sequence is generated through the relation between direct current coefficients in the adjacent blocks. Finally, an inverted index which contains the feature sequence, dc, location coordinates, and image path is created. For the purpose of achieving image steganography, the secret information is converted into a binary sequence and partitioned into segments, and the image whose feature sequence equals to the secret information segments is chosen as the cover image according to the index. After that, all cover images are sent to the receiver. In the whole process, no modification is done to the original images. Experimental results and analysis show that the proposed algorithm can resist the detection of existing steganalysis algorithms, and has better robustness against common image processing and better ability to resist steganalysis compared with the existing coverless image steganography algorithms. Meanwhile, it is resistant to geometric attacks to some extent. It has great potential application in secure communication of big data environment.
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
ImageNet: A large-scale hierarchical image database
Deng, J., Dong, W., Socher, R., Li, L.-J., Li, K., & Fei-Fei, L. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206848 · Cited by 65,333 · cited 1×
“2) The ImageNet database [42]: It is a database with more than 22,000 categories and 15 million images, and it is created by the Stanford University Computer Vision Lab.”
MethodDistinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Histograms of Oriented Gradients for Human Detection
Dalal, N., & Triggs, B. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.177 · Cited by 33,584
Speeded-Up Robust Features (SURF)
Bay, H., Ess, A., Tuytelaars, T., & Van Gool, L. (2008) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2007.09.014 · Cited by 13,557 · cited 2×
“[39], the feature sequence can be extracted from pixel and texture feature.”
BackgroundMethodPCA-SIFT: a more distinctive representation for local image descriptors
Ke, Y., & Sukthankar, R. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315206 · Cited by 3,237
Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search
Jegou, H., Douze, M., & Schmid, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88682-2_24 · Cited by 1,901 · cited 1×
“1) The INRIA Holidays database [41]: this database is created by Herve Jegou et al.”
MethodLu, S., Jaffer, A., Jin, X., Zhao, H., & Mao, X. (2012) · IEEE Computer Graphics and Applications · doi:10.1109/mcg.2011.51 · Cited by 22
Metadata
- Authors
- Zhang, X., Peng, F., & Long, M.
- Venue
- IEEE Transactions on Multimedia
- Published
- 2018-12
- Volume
- 20
- Issue
- 12
- Pages
- 3223-3238
- ISSN
- 1520-9210 (ISSN-L)
- 1941-0077
- OpenAlex
- W2804809630
- Cited by
- 251
- References
- 7
- FWCI
- 11.34
- 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.