Nonparametric steganalysis of QIM data hiding using approximate entropy

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 6819, Issue , 2008, Pages

  Malik, Hafiz ^a,b   Subbalakshmi, K P ^b   Chandramouli, R ^b  

^a Department of Electrical and Computer Engineering   (United States)

^b Stevens Institute of Technology   (United States)

Author keywords

Algorithmic entropy; Approximate entropy; Complexity; Dither modulation; Entropy; Quantization index modulation; Steganalysis; Steganography

Indexed keywords

APPROXIMATION THEORY; CRYPTOGRAPHY; DATA REDUCTION; EMBEDDED SYSTEMS; MESSAGE PASSING; RANDOM PROCESSES;

ALGORITHMIC ENTROPY; APPROXIMATE ENTROPY; DITHER MODULATION; QUANTIZATION INDEX MODULATION; STEGANALYSIS; STEGANOGRAPHY;

IMAGE ANALYSIS;

EID: 42949085230     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.767313     Document Type: Conference Paper

References (24)

1. M. Costa, "Writing on dirty paper," IEEE Transactions on Information Theory 29, pp. 439-441, May 1983.
2. J. Eggers and B. Girod, Informed Watermarking, Kluwer Academic Publisher, 2002.
3. R. Chandramouli, "A mathematical framework for active steganalysis," ACM Multimedia Systems 9, pp. 303-311, September 2003.
4. P. Guillon, T. Furon, and P. Duhamel, "Applied public-key steganography," in Proc. IS&T/SPIE, pp. 38-49, 2002.
5. K. Sullivan, Z. Bi, U. Madhow, S. Chandrasekaran, and B. Manjunath, "Steganalysis of quantization index modulation data hiding," in IEEE Int. Conf. Image Processing (ICIP), 2, pp. 1165-1168, 2004.
6. "http://en.wikipedia.org/wiki/zero-day_attack,"
7. R. Chandramouli and K. Subbalakshmi, "Current trends in steganalysis: A critical survey," in IEEE Int. Conf. on Control, Automation, Robotics and Vision, ICARCV, 2, pp. 964-967.
8. S. Geman and D. Geman, "Stochastic relaxation, gibbs distributions and the bayesian restoration of images," IEEE Trans. on Pattern Analysis and Machine Intelligence 14(6), 1984.
9. C. Shannon, "A mathematical theory of communication," The Bell System Technical Journal 27, pp. 379423 & 623-656, 1948.
10. A. Kolmogorov, "A new metric invariant of transitive automorphisms of lebesgue spaces," Dokl. Akad. Nauk SSSR119(5), pp. 861-864, 1958.
11. Y. Sinai, "On the concept of entropy for a dynamical system," Dokl. Akad. Nauk SSSR124, pp. 768-771, 1959.
12. A. Lempel and J. Ziv, "On the complexity of finite sequences," IEEE Transactions on Information Theory 22(1).
13. S. Pincus, "Approximate entropy as a measure of system complexity," Proc. Natl. Acad. Sci. USA 88, pp. 2297-2301, March 1991.
14. S. Pincus and A. Goldberger, "Physiological time-series analysis: What does regularity quantify?," Am. J. Physiol (Heart Circ Physiol) 266(4 Pt 2).
15. S. Pincus, "Approximate entropy as a complexity measure," CHAOS 5(1), pp. 110-117, 1995.
16. D. Ornstien and B. Weiss, "How sampling reveals a process," Ann. of Prob. 18, pp. 905-930, 1990.
17. S. Pincus, "Approximating markov chains," Proc. Natl. Acad. Sci. USA 89, pp. 4432-4436, 1992.
18. S. Pincus and R. Kalman, "Not all (possibly) "random" sequences are created equal," Proceedings of the National Academy of Science USA 94, pp. 3513-3518, 1997.
19. nd ed., 1994.
20. S. Pincus and L. Goldberger, "Physiological time-series analysis: What does regularity quantify," American Physiological Society (Modeling in Physiology), pp. H1648-H1656, 1994.
21. S. Pincus and W. Huang, "Approximate entropy: Statistical properties and applications," Communications in Statistics: Theory and Methods 21(11), pp. 3061-3077, 1992.
22. S. Pincus and B. Singer, "Randomness and degree of irregularity," Proceedings of the National Academy of Science USA 93, pp. 2083-2088, 1996.
23. nd ed., 2000.
24. "Ucid: An uncompressed colour image database." available at http://www-users.aston.ac.uk/schaefeg/datasets/UCID/ucid.html.