Towards lower bounds on embedding distortion in information hiding

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose two efficient information hiding algorithms in the least significant bits of JPEG coefficients of images. Our algorithms embed information by modifying JPEG coefficients in such a way that the introduced distortion is minimized. We derive the expected value of the additional error due to distortion as a function of the message length and the probability distribution of the JPEG quantization errors of cover images. We have implemented our methods in Java and performed the extensive experiments with them. The experiments have shown that our theoretical predictions agree closely with the actual introduced distortions. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Kim, Y., Duric, Z., & Richards, D. (2006). Towards lower bounds on embedding distortion in information hiding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4283 LNCS, pp. 362–376). Springer Verlag. https://doi.org/10.1007/11922841_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free