Scheme for hiding images by finding optimal one-to-two substitution table using dynamic programming strategy

Abstract

, Chang et al. (Pattern Recognition, 2003 (7), 1583-1595) proposed a way to find an optimal one-to-one substitution table using a dynamic programming strategy in image hiding. The present paper introduces a new method which uses the one-to-two substitution table to help with image hiding. First, a square-error matrix with three dimensions was built up. After applying a dynamic programming strategy on the square-error matrix, one can obtain the optimal one-to-two substitution table. According to the experimental results, the new method is capable of offering much better stego-image quality than the LSB substitution method and the one-to-one substitution method.

Multi‐round dynamic swap optimisation for table‐based steganography

“…One of the authors of this paper, in Chang et al [18], proposed substituting the secret message by dynamic programming optimisation and then embedding the transformed message by modulus function. Chan and Chang [19] improved the dynamic programming algorithm to a one-to-two substitution function. Zhang et al [20] and Wang and Zhang [21] proposed an optimisation scheme for the look-up table-based steganography using dynamic programming.…”