IEEE Transactions on Circuits and Systems for Video Technology · 2009 · 578 citations · 25 references
ComputingComputer ScienceComputer SystemsCryptographyDigital CommunicationDigital ImagingDigital Image ProcessingImage ProcessingBinary StructureData HidingHistogram EqualizationImage SteganographySteganography
The paper proposes a reversible data hiding scheme that uses histogram modification of pixel differences. The scheme employs a binary‑tree structure to pair peak points, uses pixel‑difference histograms for high capacity with low distortion, and applies histogram shifting to avoid overflow and underflow. Experimental results show the proposed method outperforms existing reversible data hiding schemes.
In this letter, we present a reversible data hiding scheme based on histogram modification. We exploit a binary tree structure to solve the problem of communicating pairs of peak points. Distribution of pixel differences is used to achieve large hiding capacity while keeping the distortion low. We also adopt a histogram shifting technique to prevent overflow and underflow. Performance comparisons with other existing schemes are provided to demonstrate the superiority of the proposed scheme.
25
Zhicheng Ni, Yun-Qing Shi, Nirwan Ansari et al. · IEEE Transactions on Circuits and Systems for Video Technology · 2006 · 2.6K citations
Lossless generalized-LSB data embedding
M.U. Celik, Gaurav Sharma, A. Murat Tekalp et al. · IEEE Transactions on Image Processing · 2005 · 1.2K citations