Finding optimal least-significant-bit substitution in image hiding by dynamic programming strategy

By Chin-chen Chang, Ju Yuan Hsiao, Chi-Shiang Chan. Pattern Recognition, 2003

399 citations recorded by the source corpus.

Subfields: Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/8ef97a7ccaf28ea6bdf8551ade0fe982880d2fa3

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

1. Nan-I Wu
2. Chwei-Shyong Tsai
3. Min-Shiang Hwang
4. Wei-Liang Tai
5. Chia-Chen Lin
6. H-C Wu
7. Chun-Sen Tseng
8. Hung-Min Sun

Citations in the corpus

• A high quality steganographic method with pixel-value differencing and modulus function (2008, methodology): “In addition, Chang et al. (2003) have also presented a fast and efficient optimal LSB method based on the dynamic programming strategy that improves the computation time of Wang et al.'s scheme (Wang et al., 2001).”
• Reversible hiding in DCT-based compressed images (2007, methodology): “’s scheme [3], a dynamic programming strategy was employed to find the optimal LSB substitution for image hiding.”
• Image steganographic scheme based on pixel-value differencing and LSB replacement methods (2005, methodology): “proposed an efficient method of dynamic programming strategy [1].”
• Adaptive Data Hiding in Edge Areas of Images With Spatial LSB Domain Systems (2008, background): “As a result, many new sophisticated LSB approaches have been proposed to improve this drawback [ 12 ], [13].”