High-Capacity Image Steganography Based on Side Match Block Matching

Jaeyoung Kim, Hanhoon Park

Abstract


In this paper, we proposed an image steganography method which exploits a variant of block matching (BM) algorithm, called side match block matching (SMBM), and discrete wavelet transform (DWT) for embedding high-capacity images. The proposed method can greatly improve the embedding capacity by using SMBM. In addition, the proposed method resolves the problem with the loss of least significant bits in previous BM-based steganography methods and improves the confidentiality by embedding secret information in the DWT high frequency regions.

Keywords


Image Steganography; Block Matching; Discrete Wavelet Transform; High-Capacity; Side Match Block Matching;

Full Text:

PDF

References


A. Cheddad, J. Condell, K. Curran, and P. Mc Kevitt, “Digital image steganography: survey and analyses of current methods,” Sig. Proc., vol. 90, no. 3, pp. 727-752, 2010.

C.-K. Chan and L.M. Cheng, “Hiding data in images by simple LSB substitution,” Patt. Recog., vol. 37, no. 3, pp. 469-474, 2004.

D.C. Wu and W.H. Tsai, “A steganographic method for images by pixel-value differencing,” Patt. Recog. Lett., vol. 24, pp. 1613-1626, 2003.

R.O. El Safy, H.H. Zayed, and A. El Dessouki, “An adaptive steganographic technique based on integer wavelet transform,” in Proc. Int. Conf. Netw. and Media Conv., 2009, pp. 111–117.

T. Bhattacharya, N. Dey, and S.R.B. Chaudhuri, “A session based multiple image hiding technique using DWT and DCT,” Int. J. Comp. Appl., vol. 38, no. 5, pp. 398–409, 2012.

R.-Z. Wang and Y.-D. Tsai, “An image-hiding method with high hiding capacity based on best-block matching and k-means clustering,” Patt. Recog., vol. 40, no. 2, pp. 398-409, 2007.

T. Kim, “Side match and overlap match vector quantizers for images,” IEEE Trans. Image Proc., vol. 1, no. 4, pp. 170–185, 1992.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

ISSN: 2180-1843

eISSN: 2289-8131