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

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.