Three-dimensional histogram shifting for reversible data hiding
Three-dimensional histogram shifting for reversible data hiding
复制标题
DOI：
10.1007/s00530-016-0529-2
复制
发表时间：
2016-09
影响因子：
3.9
通讯作者：
Juan Zhao;Zhitang Li
中科院分区：
文献类型：
--
作者：
Juan Zhao;Zhitang Li
直方图移位是一种重要的可逆数据隐藏方法。然而，在传统的直方图移位算法中，每个像素、差值或预测误差都被分别改变以隐藏一个数据比特，这限制了容量失真嵌入的性能。针对可逆数据隐藏问题，提出了一种有效的三维直方图移位算法。以H.264视频为封面，展示了该方法。在他人未推断的4×4量化离散余弦变换亮度块中，随机选取3个交流电系数作为可嵌入组。根据所选系数组的不同取值，可将其划分为不同的集合。根据这些集合，数据可能会被隐藏。在传统的直方图移位算法中，一个系数最多修改一次，只能隐藏一个信息比特，而在相同代价下可以隐藏两个数据比特。通过实验验证了该方法的优越性。
Histogram shifting is an important method of reversible data hiding. However, every pixel, difference, or prediction-error is respectively changed to hide a data bit in the traditional histogram shifting, which constrains the capacity-distortion embedding performance. An efficient three-dimensional histogram shifting is proposed for reversible data hiding in this paper. Take H.264 videos as covers to show this method. In a 4 × 4 quantized discrete cosine transform luminance block, which is not inferred by others, three alternating current coefficients are selected randomly as an embeddable group. According to the different values of the selected coefficient groups, they could be divided into different sets. Data could be hidden according to these sets. In the traditional histogram shifting, only one information bit could be hidden with at most one modification of one coefficient, whereas two data bits could be hidden at the same cost by using the proposed scheme. The superiority of the presented technique is verified through experiments.