基于U矩阵的增强SVD水印

Iman Omidvar Tehrani, S. Ibrahim
{"title":"基于U矩阵的增强SVD水印","authors":"Iman Omidvar Tehrani, S. Ibrahim","doi":"10.1109/ICCIT.2010.5711130","DOIUrl":null,"url":null,"abstract":"Protecting images against illegal duplications is an important fact and recently many watermarking algorithms have been published. In this paper an enhanced SVD-based watermarking algorithm is proposed. In the proposed method U component is explored for embedding the watermark. Experimental results show that imperceptibility and robustness of the algorithm is good.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An enhanced SVD based watermarking using U matrix\",\"authors\":\"Iman Omidvar Tehrani, S. Ibrahim\",\"doi\":\"10.1109/ICCIT.2010.5711130\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Protecting images against illegal duplications is an important fact and recently many watermarking algorithms have been published. In this paper an enhanced SVD-based watermarking algorithm is proposed. In the proposed method U component is explored for embedding the watermark. Experimental results show that imperceptibility and robustness of the algorithm is good.\",\"PeriodicalId\":131337,\"journal\":{\"name\":\"5th International Conference on Computer Sciences and Convergence Information Technology\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"5th International Conference on Computer Sciences and Convergence Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIT.2010.5711130\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"5th International Conference on Computer Sciences and Convergence Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIT.2010.5711130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

保护图像免受非法复制是一个重要的事实,近年来已经发表了许多水印算法。本文提出了一种增强的基于奇异值分解的水印算法。在该方法中,利用U分量来嵌入水印。实验结果表明,该算法具有良好的不可感知性和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An enhanced SVD based watermarking using U matrix
Protecting images against illegal duplications is an important fact and recently many watermarking algorithms have been published. In this paper an enhanced SVD-based watermarking algorithm is proposed. In the proposed method U component is explored for embedding the watermark. Experimental results show that imperceptibility and robustness of the algorithm is good.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Quality factors of business value and service level measurement for SOA Study on the inter-organizational tacit knowledge transfer network Network joining algorithm for mobile nodes in ubiquitous sensor networks Network security for virtual machine in cloud computing Action recognition using hybrid spatio-temporal bag-of-features
×
引用
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