General Expansion-Shifting Model for Reversible Data Hiding: Theoretical Investigation and Practical Algorithm Design
General Expansion-Shifting Model for Reversible Data Hiding: Theoretical Investigation and Practical Algorithm Design
复制标题
DOI：
10.1109/tcsvt.2022.3166207
复制
发表时间：
2022-09
影响因子：
8.4
通讯作者：
Haorui Wu;Xiaolong Li;Xiangyang Luo;Xinpeng Zhang;Yao Zhao
中科院分区：
文献类型：
--
作者：
Haorui Wu;Xiaolong Li;Xiangyang Luo;Xinpeng Zhang;Yao Zhao
可逆数据隐藏作为一种特殊的数据隐藏技术，近年来受到了广泛的关注。通过该技术，可以准确地从标记图像中提取嵌入数据和原始封面图像。在我们之前的工作中，通过引入所谓的可逆嵌入函数（REF），提出了RDH的一般扩展移位模型。利用REF，可以设计RDH并建立相应的率失真公式，为优化可逆嵌入性能提供了一种途径。本文在扩展前人工作的基础上，研究了一维直方图的最优REF，在覆盖像素的最大修改被限制为一个小值的情况下，得到了所有最优REF。此外，在推导一维直方图和多直方图修正的最优REF的基础上，提出了一种实用的RDH方案，并通过实验验证了该方案在容量畸变性能方面优于现有的一些算法。
As a specific data hiding technique, reversible data hiding (RDH) has recently received extensive attention. By this technique, both the embedded data and the original cover image can be exactly extracted from the marked image. In our previous work, a general expansion-shifting model for RDH is proposed by introducing the so-called reversible embedding function (REF). With REF, RDH can be designed and the corresponding rate-distortion formulations can be established, providing an approach to optimize the reversible embedding performance. In this paper, by extending our previous work, optimal REF for one-dimensional histogram is investigated, and all optimal REF are derived in this case when the maximum modification to the cover pixel is limited as a small value. Moreover, based on the derived optimal REF for one-dimensional histogram and multiple histograms modification, a practical RDH scheme is presented and it is experimental verified better than some state-of-the-art algorithms in terms of capacity-distortion performance.