Dynamic Hybrid Reversible Data Hiding Based on Pixel-value-ordering

Fang Ren Fang Ren, Yi-Ping Yang Fang Ren, Zhe-Lin Zhang Yi-Ping Yang
{"title":"Dynamic Hybrid Reversible Data Hiding Based on Pixel-value-ordering","authors":"Fang Ren Fang Ren, Yi-Ping Yang Fang Ren, Zhe-Lin Zhang Yi-Ping Yang","doi":"10.53106/199115992023123406002","DOIUrl":null,"url":null,"abstract":"Reversible data hiding (RDH) using pixel-value-ordering (PVO) is a well-established technique for embedding data in a cover image by modifying the maximum and minimum in each block. This paper proposes a dynamic hybrid RDH method based on PVO. Specifically, a 3×3 block according to its complexity and two thresholds T1 and T2 is classified as three levels: extremely smooth, smooth, and rough. Different processing algorithms are used for different levels. For rough blocks, they are ignored to avoid reducing the peak signal-to-noise ratio. For smooth blocks, the proposed method employs a block subdivision algorithm that can embed up to 6 bits of data. For extremely smooth blocks, no subdivision is done and a median pixel prediction algorithm is used to predict the remaining eight pixels, which can embed up to 8 bits of data. Moreover, this paper presents a new method that computes complexity by dynamically selecting relevant pixels to enhance block classification accuracy. Extensive experiments demonstrate that the proposed method outperforms existing PVO-based methods, offering larger embedding capacity while maintaining low distortion.","PeriodicalId":345067,"journal":{"name":"電腦學刊","volume":"138 41","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"電腦學刊","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.53106/199115992023123406002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Reversible data hiding (RDH) using pixel-value-ordering (PVO) is a well-established technique for embedding data in a cover image by modifying the maximum and minimum in each block. This paper proposes a dynamic hybrid RDH method based on PVO. Specifically, a 3×3 block according to its complexity and two thresholds T1 and T2 is classified as three levels: extremely smooth, smooth, and rough. Different processing algorithms are used for different levels. For rough blocks, they are ignored to avoid reducing the peak signal-to-noise ratio. For smooth blocks, the proposed method employs a block subdivision algorithm that can embed up to 6 bits of data. For extremely smooth blocks, no subdivision is done and a median pixel prediction algorithm is used to predict the remaining eight pixels, which can embed up to 8 bits of data. Moreover, this paper presents a new method that computes complexity by dynamically selecting relevant pixels to enhance block classification accuracy. Extensive experiments demonstrate that the proposed method outperforms existing PVO-based methods, offering larger embedding capacity while maintaining low distortion.
基于像素值排序的动态混合可逆数据隐藏
使用像素值排序(PVO)的可逆数据隐藏(RDH)是一种成熟的技术,可通过修改每个块中的最大值和最小值将数据嵌入到覆盖图像中。本文提出了一种基于 PVO 的动态混合 RDH 方法。具体来说,一个 3×3 的块根据其复杂度和两个阈值 T1 和 T2 被分为三个等级:极平滑、平滑和粗糙。不同等级采用不同的处理算法。对于粗糙区块,为了避免降低峰值信噪比,会忽略它们。对于光滑区块,建议的方法采用区块细分算法,最多可嵌入 6 比特数据。对于极其平滑的区块,则不进行细分,而是采用中值像素预测算法来预测剩余的 8 个像素,最多可嵌入 8 比特数据。此外,本文还提出了一种新方法,通过动态选择相关像素来计算复杂度,从而提高区块分类的准确性。广泛的实验证明,所提出的方法优于现有的基于 PVO 的方法,在保持低失真度的同时提供了更大的嵌入容量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信