Capacity-approaching codes for reversible data hiding

  • Authors:
  • Weiming Zhang;Biao Chen;Nenghai Yu

  • Affiliations:
  • Department of Electrical Engineering & Information Science, University of Science and Technology of China, Hefei, China and Department of Information Research, Zhengzhou Information Science an ...;Department of Electrical Engineering & Information Science, University of Science and Technology of China, Hefei, China;Department of Electrical Engineering & Information Science, University of Science and Technology of China, Hefei, China

  • Venue:
  • IH'11 Proceedings of the 13th international conference on Information hiding
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

By reversible data hiding, the original cover can be losslessly restored after the embedded information is extracted. Kalker and Willems established a rate-distortion model for reversible data hiding, in which they proved the capacity bound and proposed a recursive code construction. In this paper we improve the recursive construction by designing a data embedding method for all-zero covers and a more efficient compression algorithm. We prove that the proposed codes can approach the capacity bound under various distortion constraints. We also apply this coding method to RS method for spatial images, and the experimental results show that the novel codes can significantly reduce the embedding distortion.