A Robust Mesh Watermarking Based On Progressive Meshes

Digitized multimedia data facilitate the processing, distribution and storage of m-ultimedia information, enhance the efficiency and accuracy of information presentation. But the undesirable side effects are obvious: the unauthorized redistribution of the copyrighted multimedia data without loss of fidelity. Intellectual property protection is one of the most pressing concern for content creators and owners who distribute an-d deliver their content in the Information Era. Digital watermarking, which originate-from steganography, provides a novel way for the protection of intellectual property rights, and becomes a hot spot in the research field of multimedia data security in recent years.Current watermarking technology focuses on media types like still images, and video and audio streams. In contrast, 3D watermarking models have received a little attention from researchers. But, more and more CAD-based 3D data is entering the World Wide Web. Accordingly, companies or copyright owners who present or sell their products in virtual space will face copyright-related problems. The straight forward demand is to prevent their 3D-based material from unauthorized use. As a new way for the protection of information copyright, digital watermarking will possess extensive application perspective in this area.Watermarking for 3D objects frequently encountered in computer graphics ,this algorithm focuses on the selected vertex which will embed watermarking by the pm progress, in the embedding, coefficient of watermark is related to the distance form vertex to the center point and adjacent information of the vertex .experimental results and attack analysis show that the watermarking algorithm is robust .we work mainly on the following:<1> progress the pm algorithm to fit the watermarking embed algorithm.by the noise attacking, analysis show that detail of the model is not good for robust watermarking.<3>we present a new watermarking embed algorithm, in this algorithm, the coef-ficient of the watermarking is not fixed, which is related with the vertex attribute, results show that the algorithm is robust, especially for noise attacking.<3>we enhance the security of the algorithm, for in the extracting watermarking progress, we must to know the coefficient of the embedding watermarking, which can be the key...