ACM Home Page
Please provide us with feedback. Feedback
Robust blind watermarking mechanism for point sampled geometry
Full text PdfPdf (396 KB)
Source
International Multimedia Conference archive
Proceedings of the 9th workshop on Multimedia & security table of contents
Dallas, Texas, USA
SESSION: Geometry in watermarking table of contents
Pages: 175 - 186  
Year of Publication: 2007
ISBN:978-1-59593-857-2
Authors
Parag Agarwal  University of Texas at Dallas, Richardson, TX
Balakrishnan Prabhakaran  University of Texas at Dallas, Richardson, TX
Sponsors
ACM: Association for Computing Machinery
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 79,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1288869.1288894
What is a DOI?

ABSTRACT

Watermarking schemes for copyright protection of point cloud representation of 3D models operate only on the geometric data, and are also applicable to mesh based representations of 3D models, defined using geometry and topological information. For building such generic copyright schemes for 3D models, this paper presents a robust spatial blind watermarking mechanism for 3D point sampled geometry. To find the order in which points are to be encoded/decoded, a clustering approach is proposed. The points are divided into clusters, and ordering is achieved using inter-cluster and intra-cluster ordering. Inter-cluster ordering achieves local ordering of points, whereas intra-cluster ordering does it globally. Once ordered, a sequence of clusters is chosen based on nearest neighbor heuristic. An extension of quantization index of bit encoding scheme is proposed, and used to encode and decode inside the clusters. The encoding mechanism makes the technique robust against uniform affine transformations (rotation, scaling, and transformation), reordering attack and topology altering (e.g. retriangulation) attack when applied to 3D meshes as well. Replication of watermark provides robustness against localized noise addition, cropping, simplification and global noise addition attacks. Security of the scheme is analyzed, and the time complexity is estimated as O (n log n), where n is the number of 3D points. Theoretical bounds on hiding capacity are estimated, and experiments show that a high hiding capacity is high, with embedding rate greater than 3 bits/point. The bit encoding method reduces the distortions and makes the watermark imperceptible, indicated by a signal to noise ratio greater than 100 dB.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Arya, S., and Mount, D. M. Computational Geometry: Proximity and Location. In The Handbook of Data Structures and Applications, eds. D. Mehta and S. Sahni, Chapman & Hall/CRC, Boca Raton, 2005, 63.1--63.22.
 
2
Autodesk-Maya: http://www.autodesk.com
 
3
Alface, P., and Macq, B. Blind watermarking of 3D Meshes Using Robust Feature Points Detection. In Proceedings of International Conference on Image Processing 2005, Volume 1, 11-14 Sept. 2005 Page(s):693--696.
 
4
 
5
 
6
 
7
Bors, A. Watermarking Mesh-Based Representations of 3-D Objects Using Local Moments. Image Processing, IEEE Transactions on, Volume: 15 Issue: 3 March 2006, Page(s): 687--701.
 
8
 
9
Cayre, F., and Macq, B. Data hiding on 3-D triangle meshes. Signal Processing, IEEE Transactions on, Volume: 51 Issue: 4 Apr 2003, Page(s): 939--949.
 
10
Chen, B., and Wornell, G. W. Quantization index modulation: A class of provably good methods for digital watermarking and information embedding. In IEEE Trans. on Information Theory, vol 47, pp. 1423--1443, May 2001.
 
11
 
12
 
13
 
14
Fast Scan 3D http://www.fastscan3d.com/download/samples
 
15
Harte, T., and Bors, A. Watermarking 3D models. Image Processing. 2002. Proceedings. 2002 International Conference on, Volume 3, 24-28 June 2002 Page(s):661--664 vol.3.
 
16
Kanai, S., Date, H., and Kishinami, T. Digital watermarking for 3-D polygons using mutltiresolution wavelet decomposition. In Proc. 6th IFIP WG 6.2 GEO-6 Tokyo, Japan, 1998, pp. 296--307.
 
17
Large Geometric Models Archive: http://www.static.cc.gatech.edu/projects/large_models/
 
18
 
19
Petitcolas, F., Anderson, R. J., and Kuhn, M. G. Information Hiding: A Survey. In Proc. IEEE special issue on Protection of Multimedia Content, 1999.
 
20
Ohbuchi, R., Masuda, H., and Aono, M. Watermarking three-dimensional polygonal models through geometric and topological modifications. IEEE J. Select. Areas Commun. vol. 16, pp. 551--560, 1998.
 
21
22
 
23


Collaborative Colleagues:
Parag Agarwal: colleagues
Balakrishnan Prabhakaran: colleagues