期刊文献+

基于最小均方差下的3D模型数字水印算法 被引量:3

A 3-D Model Watermarking Algorithm Based on Minimum Mean Square Error
下载PDF
导出
摘要 使得三维模型变换带来的误差能量,最小影射到嵌入水印上.为使嵌入的水印对于三维模型的拓扑变换和几何变换都具有鲁棒性,提出一种基于最小均方差的3D几何模型算法,算法首先通过对三维网格顶点排序和挑选,排序和挑选的原则是使得被挑选的顶点具有最小的边距和,即通过对3D模型网格顶点优化选择,使得选择后的顶点受到拓扑攻击影响最小;然后,计算选择后顶点扰动均方误差能量,将水印嵌入到受误差能量影响最小的空间,使得嵌入的水印受到几何攻击影响最小.实验结果表明,算法对几何攻击和拓扑攻击具有好的抵御能力. In this paper, the basic idea is to lead to the embedding watermark that has the least value of error energy, which is caused by various transforms of 3D model. In order to the embedding watermark that has the robustness to the topological and geometrical attacks, we firstly choose the vertexes of 3D mesh, and the principle of chosen vertexes has the shortest edge among vertexes. Namely, those chosen vertexes have the least influenced to topology transform of the 3D geometry model. Then, resisting to the geometrical transforms, we calculate the Mean Square Error of triangle mesh vertexes, and project them to the space that has the least mean square error value. So, we obtain that the robustness of the approach lies in hiding a watermark in the space that is least susceptible to the 3D model potential modification. AS a result, our algorithm is able to resist the topological and geometrical attaeks, The robustness of our method is demonstrated by various attacks through computer simulation.
出处 《郑州大学学报(工学版)》 CAS 2006年第4期101-105,共5页 Journal of Zhengzhou University(Engineering Science)
关键词 3D网格水印 均方误差最小 鲁棒性 安全性 3D mesh watermark minimum mean square error robustness security
  • 相关文献

参考文献10

  • 1SU K,KUNDUR D,HATZINAKOS D.Statistical invisibility for collusion-resistant digital video watermarking[J].IEEE Trans Multimedia,2005,7(1):43 ~ 51.
  • 2WEI L,XUE X Y,PEI Z L.Localized robust audio watermarking robust against time scale modification[J].IEEE Trans Multimedia,2006,8 (1):60 ~ 69.
  • 3邱保志,张西芝.基于网格的参数自动化聚类算法[J].郑州大学学报(工学版),2006,27(2):91-93. 被引量:14
  • 4OHBUCHI R,MASUDA H,AONO M.Watermarking three-dimensional polygonal models through geometric and topological modifications[J].IEEE Journal on Selected Areas in Communication,1998,16 (4):551 ~ 560.
  • 5BENEDENS O.Geometry-based watermarking of 3D models[J].IEEE Computer Graph,Special Issue on Image Security,1999,19(1):46 ~ 55.
  • 6PRAUN E,HOPPE H,FINKELSTEIN A.Robust mesh watermarking[A].Proceeding of ACM Conference on Computer Graphics[C].Los Angles:ACM,1999.69 ~76.
  • 7ADRIAN G B.Watermarking mesh-based representations of 3-D objects using local moments[J].IEEE Trans Image Processing,2006,15(3):687 ~ 701.
  • 8张贤达.矩阵分析[M].北京:清华大学出版社,2004.
  • 9NEUGEBAUER P.Geometrical cloning of 3D objects via simultaneous registration of multiple range images[A].International Conference on Shape Modeling and Applications[C].USA:IEEE Computer Society,1997.130 ~ 139.
  • 10喻志强,赵荣椿,叶豪盛,梁爽.自适应于局部几何特征的三维模型水印算法[J].计算机工程与应用,2002,38(22):23-27. 被引量:14

二级参考文献14

  • 1Ohbuchi R, Masuda H, Aono M.Watennarking three-dimensionalpolygonal models through geometric and topological modifications[J].IEEE Journal on Selected Areas in Communication, 1998; 16(4):551~560
  • 2Benedens O.Geometry-based watermarking of 3D models[J].IEEEComputer Graphics and Applications, 1999:46~55
  • 3Minerva Yeung,Boon-Lock Yeo. Fragile watermarking of three-di-mensional objects[C].In:Proceeding of International Conference onImage Processing vol.2,Los Angeles: IEEE ComputerSociety, 1998:442~446
  • 4Praun E,Hoppe H,Finkelstein A.Robust mesh watermarking[J].S1G-GRAPH'99 Proceedings, New York: ACM Press, 1999: 325~334
  • 5KangKang Yin,Zhigeng Pan,Jiaoying Shi et al. Robust mesh water-marking based on multiresolution processing[J].Computers & Graph-ics, 2001; 25: 409~420
  • 6Chen Y, Medioni G.Object modeling by registration of multiple rangeimages[J].Image and Vision Computing, 1992; 10(3): 145~155
  • 7Besl P J,Mckay N D.A method for registration of 3-d shapes[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1992; 14(2) :239~256
  • 8Eaugeras O D.The representation,recognition,and locating of 3-d ob-jects[J].International Journal on Robotic Research,1986;5(3):27~52
  • 9Stan Melax. A Simple,Fast,and Effective Polygon Reduction Algo-rithm[J].Game Developer, 1998; 11:44~49
  • 10ESTER M, KRIEGEL H P, SANDER J, et al. A density- based algorithm for discovering clusters in large spatial databases with noise [ A ]. Proceeding of 2nd int Conf On Knowledge Discovery and Data Mining[ C ], Portland : AAAI Press, 1996. 226 - 231.

共引文献32

同被引文献16

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部