Reversible Data Hiding Based on Histogram Modification of Pixel Differences

TLDR

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.

Abstract

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.