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.

中文翻译：

---

可逆数据隐藏的通用扩展转移模型：理论研究和实际算法设计

作为一种特定的数据隐藏技术，可逆数据隐藏（RDH）最近受到了广泛的关注。通过这种技术，嵌入数据和原始封面图像都可以从标记图像中准确提取。在我们之前的工作中，通过引入所谓的可逆嵌入函数（REF），提出了 RDH 的通用扩展移位模型。借助 REF，可以设计 RDH，并建立相应的率失真公式，从而提供一种优化可逆嵌入性能的方法。在本文中，通过扩展我们之前的工作，研究了一维直方图的最佳 REF，并且当对覆盖像素的最大修改被限制为一个小值时，所有最佳 REF 都是在这种情况下推导出来的。而且，