pdf

A 3D model blind watermarking algorithm based on quantization method

  • 2013-09-22
  • 350.42KB
  • Points it Requires : 2

Compared with non-blind algorithms, blind algorithms are more widely used because they do not need to transmit the original carrier during watermark detection. Although the robustness of blind watermarking algorithms is slightly weaker, there is still room for improvement. This paper proposes a 3D grid blind watermarking algorithm, which uses pseudo-random numbers to generate a straight line passing through the centroid of the model, selects a spherical neighborhood with the intersection of the straight line and the model as the sphere center as the embedding object, and embeds the watermark information by modulating the centroid of the vertices in the neighborhood by jitter. Because the centroid depends on the coordinates of all vertices in the spherical neighborhood, it is necessary to solve the problem of inversely estimating the coordinates of the vertices in the neighborhood from the adjusted centroid, and the corresponding algorithm is given in this paper. In addition to being immune to vertex rearrangement, the watermarking algorithm also associates each bit of watermark to multiple intersections of the straight line and the model and groups of vertices in the spherical neighborhood of multiple intersections, which can better resist shear attacks and random noise. Experimental data show the robustness of the algorithm.

unfold

You Might Like

Uploader
rubyonrails
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×