基于非局部图预测的图像可逆数据隐藏
Non-Local Graph-Based Prediction For Reversible Data Hiding In Images
摘要:
可逆数据隐藏(RDH)是理想的应用中,隐藏的信息和覆盖介质都需要恢复没有损失。在许多RDH方法中,预测误差扩展(PEE)包含两个步骤:i)预测目标像素值,以及ii)根据预测误差的值嵌入。通常,较高的预测性能导致较大的嵌入容量和/或较低的信号失真。利用图信号处理(GSP)的最新进展,我们提出像素预测作为一个图形信号恢复问题,其中适当的边缘权重的基础图形计算使用一个类似的补丁搜索在一个半局部邻域。具体来说,对于每个候选补丁,我们首先检查其结构张量的特征值,以估计其局部光滑度。如果足够光滑,我们提出了一个最大后验概率(MAP)的问题,使用二次拉普拉斯正则化或图形全变差(GTV)项作为信号先验。虽然使用第一个先验的MAP问题有一个封闭的形式的解决方案,我们设计了一个有效的算法,第二个先验使用交替方向的乘法器(ADMM)与嵌套的近端梯度下降。实验结果表明,与更好的质量基于GSP的预测,在低容量的嵌入图像的视觉质量明显超过国家的最先进的方法。
英文摘要:
Reversible data hiding (RDH) is desirable in applications where both the hidden message and the cover medium need to be recovered without loss. Among many RDH approaches is prediction-error expansion (PEE), containing two steps: i) prediction of a target pixel value, and ii) embedding according to the value of prediction-error. In general, higher prediction performance leads to larger embedding capacity and/or lower signal distortion. Leveraging on recent advances in graph signal processing (GSP), we pose pixel prediction as a graph-signal restoration problem, where the appropriate edge weights of the underlying graph are computed using a similar patch searched in a semi-local neighborhood. Specifically, for each candidate patch, we first examine eigenvalues of its structure tensor to estimate its local smoothness. If sufficiently smooth, we pose a maximum a posteriori (MAP) problem using either a quadratic Laplacian regularizer or a graph total variation (GTV) term as signal prior. While the MAP problem using the first prior has a closed-form solution, we design an efficient algorithm for the second prior using alternating direction method of multipliers (ADMM) with nested proximal gradient descent. Experimental results show that with better quality GSP-based prediction, at low capacity the visual quality of the embedded image exceeds state-of-the-art methods noticeably.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。