Reversible watermarking based on interpolation error histogram shifting

M. A. M. Abadi, H. Danyali, M. Helfroush
{"title":"Reversible watermarking based on interpolation error histogram shifting","authors":"M. A. M. Abadi, H. Danyali, M. Helfroush","doi":"10.1109/ISTEL.2010.5734139","DOIUrl":null,"url":null,"abstract":"A reversible data hiding technique with high capacity of data embedding is presented in this paper. Using both difference expansion and histogram shifting methods at the same time we have improved Luo et al.'s method to increase the amount of data that can be embedded into the host image. First the image is examined for possible overflow/underflow problem that might occur during embedding; then if needed, histogram is shifted to prevent this overflow/underflow. At next stage, interpolation error is calculated and histogram of the interpolation error is shifted to embed watermark data. Because overflow/underflow is prevented, no boundary and/or overflow map is needed and instead a much smaller location map is used so that we can fully recover the image in extraction phase. Also, overhead data is embedded into the host image along with the actual watermark; therefore, no extra data is needed to be transmitted to receiving side as needed for some reversible watermarking schemes. Experimental results show that this method can achieve higher data embedding capacity compared to other reversible watermarking schemes at same PSNR.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"27 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 5th International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2010.5734139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29

Abstract

A reversible data hiding technique with high capacity of data embedding is presented in this paper. Using both difference expansion and histogram shifting methods at the same time we have improved Luo et al.'s method to increase the amount of data that can be embedded into the host image. First the image is examined for possible overflow/underflow problem that might occur during embedding; then if needed, histogram is shifted to prevent this overflow/underflow. At next stage, interpolation error is calculated and histogram of the interpolation error is shifted to embed watermark data. Because overflow/underflow is prevented, no boundary and/or overflow map is needed and instead a much smaller location map is used so that we can fully recover the image in extraction phase. Also, overhead data is embedded into the host image along with the actual watermark; therefore, no extra data is needed to be transmitted to receiving side as needed for some reversible watermarking schemes. Experimental results show that this method can achieve higher data embedding capacity compared to other reversible watermarking schemes at same PSNR.
基于插值误差直方图移位的可逆水印
提出了一种具有高嵌入容量的可逆数据隐藏技术。同时使用差分展开和直方图移位方法,我们改进了Luo等人的方法,以增加可以嵌入到主图像中的数据量。首先检查图像在嵌入过程中可能出现的溢出/下溢问题;然后,如果需要,直方图被移动,以防止这种溢出/下溢。第二步,计算插值误差,并将插值误差的直方图平移到嵌入水印数据。由于防止了溢出/下溢,因此不需要边界和/或溢出地图,而是使用更小的位置地图,以便我们可以在提取阶段完全恢复图像。此外,开销数据与实际水印一起嵌入到主机图像中;因此,不需要像某些可逆水印方案那样向接收端传输额外的数据。实验结果表明,在相同的信噪比下,该方法比其他可逆水印方案具有更高的数据嵌入容量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信