一种新颖的鲁棒三维网格水印算法

Dazhi Han, Xingqiang Yang, Cai-ming Zhang
{"title":"一种新颖的鲁棒三维网格水印算法","authors":"Dazhi Han, Xingqiang Yang, Cai-ming Zhang","doi":"10.1109/WKDD.2009.189","DOIUrl":null,"url":null,"abstract":"the main objective of 3D mesh watermarking is to maximize the watermark strength while minimizing the visual distortion. In this paper, we propose a novel 3D mesh watermarking based on the human visual system and mesh curvature. We analyze the region’s mean curvature and fluctuation of curvature, and then choose the appropriate regions with high visual masking degree, in order to embed the watermark by using the Interpolation Algorithm. The experimental results show that the watermark is capacious, invisible and robust against various attacks.","PeriodicalId":143250,"journal":{"name":"2009 Second International Workshop on Knowledge Discovery and Data Mining","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Novel Robust 3D Mesh Watermarking Ensuring the Human Visual System\",\"authors\":\"Dazhi Han, Xingqiang Yang, Cai-ming Zhang\",\"doi\":\"10.1109/WKDD.2009.189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"the main objective of 3D mesh watermarking is to maximize the watermark strength while minimizing the visual distortion. In this paper, we propose a novel 3D mesh watermarking based on the human visual system and mesh curvature. We analyze the region’s mean curvature and fluctuation of curvature, and then choose the appropriate regions with high visual masking degree, in order to embed the watermark by using the Interpolation Algorithm. The experimental results show that the watermark is capacious, invisible and robust against various attacks.\",\"PeriodicalId\":143250,\"journal\":{\"name\":\"2009 Second International Workshop on Knowledge Discovery and Data Mining\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-01-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Second International Workshop on Knowledge Discovery and Data Mining\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WKDD.2009.189\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Second International Workshop on Knowledge Discovery and Data Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WKDD.2009.189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

三维网格水印的主要目标是使水印强度最大化,同时使视觉失真最小化。本文提出了一种基于人眼视觉系统和网格曲率的三维网格水印算法。首先分析区域的平均曲率和曲率波动,然后选择合适的视觉掩蔽度高的区域,利用插值算法嵌入水印。实验结果表明,该水印具有容量大、不可见性好、抗各种攻击能力强的特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Robust 3D Mesh Watermarking Ensuring the Human Visual System
the main objective of 3D mesh watermarking is to maximize the watermark strength while minimizing the visual distortion. In this paper, we propose a novel 3D mesh watermarking based on the human visual system and mesh curvature. We analyze the region’s mean curvature and fluctuation of curvature, and then choose the appropriate regions with high visual masking degree, in order to embed the watermark by using the Interpolation Algorithm. The experimental results show that the watermark is capacious, invisible and robust against various attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信