Please use this identifier to cite or link to this item:
|標題:||A HIGH VERIFICATION CAPACITY REVERSIBLE FRAGILE WATERMARKING SCHEME FOR 3D MODELS||作者:||Wang, J.T.
|關鍵字:||Fragile watermarking;Three dimensional (3D) models;Principal component;analysis (PCA);Quantization index modulation (QIM);Authentication;Reversibility;Spread spectrum;point-sampled geometry;authentication;steganography;objects;images;meshes||Project:||International Journal of Innovative Computing Information and Control||期刊/報告no：:||International Journal of Innovative Computing Information and Control, Volume 7, Issue 1, Page(s) 365-378.||摘要:||
The protection and authentication problems for three dimensional (3D) models have become more and more important. The capability of accurately verifying, locating, and recovering any tampered vertex is one of the most important issues. Published fragile watermarking 3D model schemes have a main drawback, the synchronization problem. To increase the capacity of verification and overcome this drawback, a high verification capacity reversible fragile watermarking scheme for 3D models in the spatial domain is proposed in this paper. Initially, a reversible quantization index modulation embedding scheme employs the principal component analysis (PCA) and modulates the distance from the vertex coordinate to the gravity center of the cover model. And, the spread spectrum technique is adopted to improve the robustness while obeying the sensitive fragility and low distortion requirements for watermarking 3D models. The proposed method can achieve that 100% vertices of the cover model can be watermarked, extracted and verified, while the other 3D fragile watermarking schemes can not. In the meanwhile, the synchronization problem is overcome. Moreover, the proposed method is immune to the causality and convergence problems. Finally, the proposed scheme is robust against vertex reordering and similarity transformation attacks.
|Appears in Collections:||資訊科學與工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.