Non-local PPVO-based reversible data hiding using opposite direction pairwise embedding

IF 3.8 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Guojun Fan , Lei Lu , Xiaodong Song , Zijing Li , Zhibin Pan
{"title":"Non-local PPVO-based reversible data hiding using opposite direction pairwise embedding","authors":"Guojun Fan ,&nbsp;Lei Lu ,&nbsp;Xiaodong Song ,&nbsp;Zijing Li ,&nbsp;Zhibin Pan","doi":"10.1016/j.jisa.2025.104030","DOIUrl":null,"url":null,"abstract":"<div><div>In recent years, pixel-value-ordering (PVO) has become a frequently used framework in which researchers have developed many novel reversible data hiding (RDH) methods. Aiming at enlarging the embedding capacity, the well-known pixel-based PVO (PPVO) was proposed. In PPVO, each pixel is predicted by a block of context pixels in its local region and the context size is fixed for each round of embedding, which makes it difficult to perform effectively for pixels located in textured regions. In this paper, firstly, we propose to acquire context pixels from the whole cover image to realize a non-local PPVO, which is implemented on a one-dimensional global sorted array obtained by our newly designed quadruple layer predictor. With the proposed predictor that has a high accuracy, the contexts used for PPVO prediction become smoother, facilitating to achieve a better performance. Secondly, by utilizing the one-dimensional property, we introduce dynamic context sizes assignment to each to-be-modified pixel, reducing the pixel numbers in smooth sequence while increasing the pixel numbers in rough sequence to enlarge embedding capacity. Thirdly, we design an opposite direction pairwise embedding scheme to improve the overall embedding performance once again, which is hard to achieve in the original PPVO because of the spatial and causal constraints. As a result, the proposed method achieves significant overall performance compared to state-of-the-art methods.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"90 ","pages":"Article 104030"},"PeriodicalIF":3.8000,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Security and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214212625000687","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In recent years, pixel-value-ordering (PVO) has become a frequently used framework in which researchers have developed many novel reversible data hiding (RDH) methods. Aiming at enlarging the embedding capacity, the well-known pixel-based PVO (PPVO) was proposed. In PPVO, each pixel is predicted by a block of context pixels in its local region and the context size is fixed for each round of embedding, which makes it difficult to perform effectively for pixels located in textured regions. In this paper, firstly, we propose to acquire context pixels from the whole cover image to realize a non-local PPVO, which is implemented on a one-dimensional global sorted array obtained by our newly designed quadruple layer predictor. With the proposed predictor that has a high accuracy, the contexts used for PPVO prediction become smoother, facilitating to achieve a better performance. Secondly, by utilizing the one-dimensional property, we introduce dynamic context sizes assignment to each to-be-modified pixel, reducing the pixel numbers in smooth sequence while increasing the pixel numbers in rough sequence to enlarge embedding capacity. Thirdly, we design an opposite direction pairwise embedding scheme to improve the overall embedding performance once again, which is hard to achieve in the original PPVO because of the spatial and causal constraints. As a result, the proposed method achieves significant overall performance compared to state-of-the-art methods.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Information Security and Applications
Journal of Information Security and Applications Computer Science-Computer Networks and Communications
CiteScore
10.90
自引率
5.40%
发文量
206
审稿时长
56 days
期刊介绍: Journal of Information Security and Applications (JISA) focuses on the original research and practice-driven applications with relevance to information security and applications. JISA provides a common linkage between a vibrant scientific and research community and industry professionals by offering a clear view on modern problems and challenges in information security, as well as identifying promising scientific and "best-practice" solutions. JISA issues offer a balance between original research work and innovative industrial approaches by internationally renowned information security experts and researchers.
×
引用
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学术官方微信