An information hiding scheme by applying the dynamic programming strategy to LSB matching revisited

Authors:
Chi-Shiang Chan;Ching-Yun Chang
Affiliations:
Asia University, Wufeng, Taiwan, R.O.C.;Oxford University, Oxford, United Kingdom
Venue:
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Year:
2009

Citing 5
Cited 1

Techniques for data hiding

IBM Systems Journal
An iterative method of palette-based image steganography

Pattern Recognition Letters
LSB-Based Steganography Using Reflected Gray Code

IEICE - Transactions on Information and Systems
Improved detection of LSB steganography in grayscale images

IH'04 Proceedings of the 6th international conference on Information Hiding
Data hiding in images via multiple-based number conversion and lossy compression

IEEE Transactions on Consumer Electronics

Information Hiding Using Ant Colony Optimization Algorithm

International Journal of Technology Diffusion

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 2006, Mielikainen proposed LSB matching revisited to achieve image hiding. This method is able to embed two secret bits into a pair of cover pixels by adding or subtracting one from either of the pixel values of the cover pixels. In this paper we apply a dynamic programming strategy to LSB matching revisited, so as to further reduce the number of modified pixels. First, our method produces an optimal substitution table for LSB matching revisited by using the dynamic programming strategy. The secret data are then transformed according to the substitution table. Finally, the transformed secret data are embedded into a cover image by using LSB matching revisited. As shown in our experimental results, the number of modified pixels in our method is fewer than that in LSB matching revisited.