一种新的三维三角形网格空间域水印掩蔽方法

M. Ashourian, R. Enteshary
{"title":"一种新的三维三角形网格空间域水印掩蔽方法","authors":"M. Ashourian, R. Enteshary","doi":"10.1109/TENCON.2003.1273359","DOIUrl":null,"url":null,"abstract":"We examine a new masking scheme for three-dimensional mesh watermarking in the spatial domain. The masking factor at each point is defined based an estimate of the average difference between the position of connected vertices to a vertex. We test the proposed watermarking scheme by embedding a random binary sequence and applying different attacks, such as additive random noise, compression by MPEG-4 SNHC, and mesh simplification, which shows that the proposed masking scheme can improve the robustness of the spatial domain watermarking scheme.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"A new masking method for spatial domain watermarking of three-dimensional triangle meshes\",\"authors\":\"M. Ashourian, R. Enteshary\",\"doi\":\"10.1109/TENCON.2003.1273359\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We examine a new masking scheme for three-dimensional mesh watermarking in the spatial domain. The masking factor at each point is defined based an estimate of the average difference between the position of connected vertices to a vertex. We test the proposed watermarking scheme by embedding a random binary sequence and applying different attacks, such as additive random noise, compression by MPEG-4 SNHC, and mesh simplification, which shows that the proposed masking scheme can improve the robustness of the spatial domain watermarking scheme.\",\"PeriodicalId\":405847,\"journal\":{\"name\":\"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region\",\"volume\":\"81 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.2003.1273359\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.2003.1273359","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

研究了一种新的空间域三维网格水印掩蔽方案。每个点的掩蔽因子是基于连接顶点与顶点之间位置的平均差值的估计来定义的。我们通过嵌入随机二值序列并应用加性随机噪声、MPEG-4 SNHC压缩和网格简化等不同攻击对所提出的水印方案进行了测试,结果表明所提出的掩蔽方案可以提高空间域水印方案的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new masking method for spatial domain watermarking of three-dimensional triangle meshes
We examine a new masking scheme for three-dimensional mesh watermarking in the spatial domain. The masking factor at each point is defined based an estimate of the average difference between the position of connected vertices to a vertex. We test the proposed watermarking scheme by embedding a random binary sequence and applying different attacks, such as additive random noise, compression by MPEG-4 SNHC, and mesh simplification, which shows that the proposed masking scheme can improve the robustness of the spatial domain watermarking scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信