A novel image watermarking scheme using blocks coefficient in DHT domain

E. Moeinaddini, Roya Ghasemkhani
{"title":"A novel image watermarking scheme using blocks coefficient in DHT domain","authors":"E. Moeinaddini, Roya Ghasemkhani","doi":"10.1109/AISP.2015.7123512","DOIUrl":null,"url":null,"abstract":"Copyright protection of digital media becomes a major problem in internet due to its nature which allows gross duplication, alteration or even stolen of data. Several watermarking methods are reported in recent years to protect copyright of digital images. A good watermarking algorithm must satisfy imperceptibility, robustness and high data hiding capacity but without compromising for any of them. In this paper a novel blind watermarking scheme in Hadamard transform domain for digital image is proposed. For embedding watermark bits we modify the DHT coefficient of two adjacent blocks in same position. Watermark is a string of characters. This algorithm offers advantages of simpler implementation, low computation cost and high resiliency under compression. The experimental results and performance analysis shows good robustness under JPEG image compression and other common image processing operations like cropping, rotation, noise addition and filtering.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":"11 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AISP.2015.7123512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Copyright protection of digital media becomes a major problem in internet due to its nature which allows gross duplication, alteration or even stolen of data. Several watermarking methods are reported in recent years to protect copyright of digital images. A good watermarking algorithm must satisfy imperceptibility, robustness and high data hiding capacity but without compromising for any of them. In this paper a novel blind watermarking scheme in Hadamard transform domain for digital image is proposed. For embedding watermark bits we modify the DHT coefficient of two adjacent blocks in same position. Watermark is a string of characters. This algorithm offers advantages of simpler implementation, low computation cost and high resiliency under compression. The experimental results and performance analysis shows good robustness under JPEG image compression and other common image processing operations like cropping, rotation, noise addition and filtering.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于DHT域分块系数的图像水印算法
数字媒体的版权保护由于其允许大量复制、修改甚至窃取数据的性质而成为互联网的一个主要问题。近年来报道了几种用于数字图像版权保护的水印方法。一个好的水印算法必须同时满足不可感知性、鲁棒性和高数据隐藏能力,但又不能牺牲其中任何一个。提出了一种新的基于Hadamard变换域的数字图像盲水印方案。为了嵌入水印位,我们修改了两个相邻块在同一位置的DHT系数。水印是一个字符串。该算法具有实现简单、计算成本低、压缩弹性高等优点。实验结果和性能分析表明,该算法在JPEG图像压缩以及裁剪、旋转、加噪和滤波等常见图像处理操作下都具有良好的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Small target detection and tracking based on the background elimination and Kalman filter A novel image watermarking scheme using blocks coefficient in DHT domain Latent space model for analysis of conventions A new algorithm for data clustering based on gravitational search algorithm and genetic operators Learning a new distance metric to improve an SVM-clustering based intrusion detection system
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1