Robust watermarking approach for 3D triangular mesh using self organization map

Mona M. Soliman, A. Hassanien, H. Onsi
{"title":"Robust watermarking approach for 3D triangular mesh using self organization map","authors":"Mona M. Soliman, A. Hassanien, H. Onsi","doi":"10.1109/ICCES.2013.6707181","DOIUrl":null,"url":null,"abstract":"The objective of this paper is to explore innovative ways to insert the maximum amount of secret information into 3D mesh models without causing perceptual distortion and also make it difficult for the attacker to guess where the watermark was inserted. It is based on clustering 3D vertices into appropriate or inappropriate candidates for watermark insertion using Self Organization Map (SOM). Two methods were used to embed the watermark into 3D model. The first method is a statistical approach that modified the distribution of vertex norms to hide watermark information into host 3D model while the second method is a mixed insertion of watermark bits into host model using vertex norm distribution and mesh vertices at the same time. The robustness of proposed techniques is evaluated experimentally by simulating attacks such as mesh smoothing, noise addition and mesh cropping.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES.2013.6707181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The objective of this paper is to explore innovative ways to insert the maximum amount of secret information into 3D mesh models without causing perceptual distortion and also make it difficult for the attacker to guess where the watermark was inserted. It is based on clustering 3D vertices into appropriate or inappropriate candidates for watermark insertion using Self Organization Map (SOM). Two methods were used to embed the watermark into 3D model. The first method is a statistical approach that modified the distribution of vertex norms to hide watermark information into host 3D model while the second method is a mixed insertion of watermark bits into host model using vertex norm distribution and mesh vertices at the same time. The robustness of proposed techniques is evaluated experimentally by simulating attacks such as mesh smoothing, noise addition and mesh cropping.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于自组织映射的三维三角形网格鲁棒水印方法
本文的目的是探索一种创新的方法,在不引起感知失真的情况下将最大数量的秘密信息插入到3D网格模型中,同时使攻击者难以猜测水印被插入的位置。该算法基于自组织映射(SOM)将三维顶点聚类到合适或不合适的候选对象中进行水印插入。采用两种方法将水印嵌入到三维模型中。第一种方法是通过统计方法修改顶点范数分布,将水印信息隐藏到宿主模型中;第二种方法是同时利用顶点范数分布和网格顶点混合插入水印位到宿主模型中。通过模拟网格平滑、噪声添加和网格裁剪等攻击,对所提技术的鲁棒性进行了实验评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Ensemble classifiers for biomedical data: Performance evaluation Hardware architecture dedicated for arithmetic mean filtration implemented in FPGA Non-fragile bilinear state feedback controller for a class of MIMO bilinear systems Learning cross-domain social knowledge from cognitive scripts Design and implementation of course timetabling system based on genetic algorithm
×
引用
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