Adaptive lossless steganographic scheme with centralized difference expansion

  • Authors:

  • Chih-Chiang Lee;Hsien-Chu Wu;Chwei-Shyong Tsai;Yen-Ping Chu

  • Affiliations:

  • Department of Computer Science and Engineering, National Chung Hsing University, 250, Kuo Kuang Road, Taichung City, Taiwan, ROC;Department of Information Management, National Taichung Institute of Technology, 129, Section 3, San Min Road, Taichung City, Taiwan, ROC;Department of Management Information Systems, National Chung Hsing University, Taiwan, ROC;Department of Computer Science and Information Engineering, Tunghai University, 181, Section 3, Taichung Port Road, Situn District, Taichung City, Taiwan, ROC

  • Venue:
  • Pattern Recognition
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, a novel adaptive lossless data hiding scheme is presented that is capable of offering greater embedding capacity than the existing schemes. Unlike the fixed hiding capacity each block provides in most of the currently available lossless data hiding approaches, the proposed method utilizes a block-based lossless data embedding algorithm where the quantity of the hidden information each block bears is variable. To both reduce the image distortion and increase the hiding capacity, the payload of each block depends on its cover image complexity. Due to the fact that schemes with difference expansion tend to damage the image quality seriously in the edge areas, in the proposed scheme, smoother areas are chosen to conceal more secret bits. This way, a better balance can be reached between the embedding ratio and the stego-image quality. In addition, when recovered the cover image can came back to its old self to the last bit without any distortion at all. Experimental results, as this paper will show, have demonstrated that the proposed method is capable of hiding more secret data while maintaining imperceptible stego-image quality degradation.