21 October 2013 High-capacity method for hiding data in the discrete cosine transform domain
Kazem Qazanfari, Reza Safabakhsh
Author Affiliations +
Abstract
Steganography is the art and science of hiding data in different media such as texts, audios, images, and videos. Data hiding techniques are generally divided into two groups: spatial and frequency domain techniques. Spatial domain methods generally have low security and, as a result, are less attractive to researchers. Discrete cosine transform (DCT) is the most common transform domain used in steganography and JPEG compression. Since a large number of the DCT coefficients of JPEG images are zero, the capacity of DCT domain-based steganography methods is not very high. We present a high-capacity method for hiding messages in the DCT domain. We describe the method in two classes where the receiver has and where the receiver does not have the cover image. In each class, we consider three cases for each coefficient. By considering n coefficients, there are 3 n different situations. The method embeds ⌊log 2  3 n ⌋ bits in these n coefficients. We show that the maximum reachable capacity by our method is 58% higher than the other general steganography methods. Experimental results show that the histogram-based steganalysis methods cannot detect the stego images produced by the proposed method while the capacity is increased significantly.
© 2013 SPIE and IS&T 0091-3286/2013/$25.00 © 2013 SPIE and IS&T
Kazem Qazanfari and Reza Safabakhsh "High-capacity method for hiding data in the discrete cosine transform domain," Journal of Electronic Imaging 22(4), 043009 (21 October 2013). https://doi.org/10.1117/1.JEI.22.4.043009
Published: 21 October 2013
Lens.org Logo
CITATIONS
Cited by 16 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Steganography

Data hiding

Receivers

Steganalysis

Computer security

Image processing

Digital watermarking

RELATED CONTENT


Back to Top