.png){kind=icon}
返回
Flexible patch moving modes for pixel-value-ordering based reversible data hiding methods
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2022.119154.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Pixel-value-ordering (PVO) is one of the most popular frameworks in the research of reversible data hiding (RDH) in recent years. In most PVO-based methods, the cover image is divided into non-overlapped blocks to embed secret data into the maximum and minimum pixels of each block. In these methods, the image division processing is just like moving a patch with constant step lengths in both horizontal and vertical directions. As a result, the block amount, as well as the embedding capacity (EC), is limited by the image size and the patch size. In this paper, we propose one-dimensional and two-dimensional flexible patch moving (FPM) modes to move the patch with adaptive step lengths. After enlarging the EC by employing FPM, an average-difference-based complexity computation is also proposed to cooperate with FPM to further improve the embedding performance. Finally, multiple pairwise embedding schemes are adaptively applied on blocks with different complexities to enhance the embedding performance once again. Experimental results illustrate that the proposed FPM modes work well on many PVO-based methods. Moreover, the proposed method achieves an obvious improvement in fidelity when compared with some state-of-the-art RDH schemes.
Keyword:
Reversible data hiding
Pixel -value -ordering
Flexible patch moving
Adaptive complexity
Pairwise modification
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
分享收藏Study on the Purification Effects of Constructed Wetland Plants in TP Disposal in Living Wastewater
PREAI
分享收藏
分享收藏
查看更多内容