Embedding capacity raising in reversible data hiding based on prediction of difference expansion

  • Authors:

  • Chin-Feng Lee;Hsing-Ling Chen;Hao-Kuan Tso

  • Affiliations:

  • Department of Information Management, Chaoyang University of Technology, 168, Jifong E. Rd., Wufong Township, Taichung County 41349, Taiwan, ROC;Graduate Institute of Informatics, Doctoral Program, Chaoyang University of Technology, Taichung County 41349, Taiwan, ROC;Department of Computer Science and Communication Engineering, Army Academy R.O.C, Taoyuan County, Taiwan, ROC

  • Venue:
  • Journal of Systems and Software
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most of the proposed methods of reversible data hiding based on difference expansion require location maps to recover cover images. Although the location map can be compressed by a lossless compression algorithm, this lowers embedding capacity and increases computational cost during the procedures of embedding and extracting. The study presents an adaptive reversible data scheme based on the prediction of difference expansion. Since each cover pixel generally resembles its surrounding pixels, most of the difference values between the cover pixels and their corresponding predictive pixels are small; therefore, the proposed scheme gains from embedding capacity by taking full advantage of the large quantities of smaller difference values where secret data can be embedded. The proposed scheme offers several advantages, namely, (1) the location map is no more required, (2) the embedding capacity can be adjusted depending on the practical applications, and (3) the high embedding capacity with minimal visual distortion can be achieved. Moreover, the experimental results demonstrate that the proposed scheme yields high embedding capacity by comparing the related schemes that are proposed recently.