By Topic

High Capacity Information Hiding Using Interpolation Technique

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yang, C.-H.T. ; Dept. of Comput. Sci., Husan Chuang Univ., Hsinchu ; Chiu, Y.-P.

We propose a high capacity and imperceptible data hiding method in this paper. The hidden data can be easily to be embedded in a gray level cover image by simple least significant bits substitution, and to be extracting without using the original image. We divide the cover image into small 5 by 5 blocks with nonoverlapping boundaries, shrink them into four overlapping 3 by 3 blocks for each 5 by 5 block, and generate back to 5 by 5 blocks by interpolation technique. If the blocks own parts of edges of this cover image, they are the candidates of embedding positions. We check the middle of the four 3 by 3 overlapping blocks of each 5 by 5 block if the absolute value of the difference between the interpolation gray level and the original gray level is less than a threshold and is larger than zero, we may embed secret data in that position. We apply a pseudorandom number generator to the hidden data before embedding. Simply follow the embedding steps to extract the embedded data where the location is embedded then shuffle back the order to find the original hidden data. The experiment results demonstrate our method is quite simple and imperceptible.

Published in:

Innovative Computing Information and Control, 2008. ICICIC '08. 3rd International Conference on

Date of Conference:

18-20 June 2008