Three Dimensional Point Clouds Watermarking Algorithm Based on Sphere Degenerated Octree

Article Preview

Abstract:

To ensure the security and integrity of three dimensional point clouds model during transmission in the network, according to their own characteristics, after the pretreatment of PCA (Primary Component Analysis), three dimensional point clouds watermarking embedding algorithm based on sphere degenerated octree was proposed, and the octree that contained the original point clouds model was subdivided multilevel from top to bottom, and the nodes of the octree were ordered. And three dimensional point clouds watermarking extraction algorithm was proposed, and the original point clouds model and the watermarked model were registered accurately, and the occurrence of synchronization error was avoided. Experimental results showed that the presented algorithm was robust to many attacks such as rotation, translation, uniform scaling, vertices reordering, simplifying, noise and cropping under blind detection.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 314-316)

Pages:

2064-2070

Citation:

Online since:

August 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Jing Zhang and Guoqin zheng, "A geometry property based watermarking scheme for three dimensional meshes," Journal of Computer-aided Design and Computer Graphic, 2005, Vol. 17, No 4, pp.740-747(In Chinese).

Google Scholar

[2] Quan Liu and Yang Liu, "Watermarking of 3D polygonal meshes based on feature points," IEEE Transactions on Industrial Electronics and Application, 2007, Vol. 2, No 5, pp.1837-1841 (In Chinese).

DOI: 10.1109/iciea.2007.4318728

Google Scholar

[3] Tao Xu and Yanning zhang, "Zero-watermarking technique of three-dimensional meshes," Journal of Jilin University (Engineering and Technology Edition), 2007, Vol. 37, No 4, pp.901-904(In Chinese).

Google Scholar

[4] Jun Li and Ya Yu, "Algorithm for 3D surface model digital watermarking," Computer Science, 2007, Vol. 34, No 8, pp.248-282(In Chinese).

Google Scholar

[5] Wang Liu and Shenghe. Sun, "Digital watermarking algorithm for NURBS models based on 2D-DCT," Computer Engineering and Design, 2006, Vol. 27, No 21, pp.4064-4067(In Chinese).

Google Scholar

[6] Wang Liu, Shouda Jiang, and Shenghe Sun, "Robust watermarking for volume data based on 3D-DCT," Acta Electronica Sinica, 2005, Vol. 33, No 12, pp.2174-2177(In Chinese).

Google Scholar

[7] Wang Liu and Chunhui Zhao, "Blind watermarking for volume data model," Journal of Electronic Measurement and Instrument, 2009, Vol. 23, No 10, pp.13-18(In Chinese).

DOI: 10.3724/sp.j.1187.2009.10013

Google Scholar

[8] D. Cotting, T. Weyrich, and M. Pauly, "Robust watermarking of point sampled geometry," Proceedings of International Conference on Shape Modeling and Application.Genova,Italy:2004, pp.233-242.

DOI: 10.1109/smi.2004.1314510

Google Scholar

[9] R. Ohbuchi, A. Mukaiyama, and S. Takahashi, "Watermarking a 3D shape model defined as a pointset," Proceedings of the International Conference on Cyber Worlds.Tokyo,Japan:2004, pp.392-399.

DOI: 10.1109/cw.2004.70

Google Scholar

[10] A. Kalivas, A. Tefas, and I. Pitas, "Watermarking of 3D models using principal component analysis," Proceedings of Acoustics, Speech and signal Processing (ICASSP'03). New York:ACM Press,2003, pp.676-679.

DOI: 10.1109/icassp.2003.1200061

Google Scholar

[11] Lixin Wu and Jieqing Yu, "Global 3D-grid based on sphere degenerated octree and its distortion features," Geography and Geo-Information Science, 2009, Vol. 25, No 1, pp.1-4(In Chinese).

Google Scholar

[12] Jieqing Yu and Lixin Wu, "On coding and decoding for sphere degenerated octree grid," Geography and Geo-Information Science, 2009, Vol. 25, No 1, pp.5-9(In Chinese).

Google Scholar

[13] O. D. Faugeras and M. Hebert, "The representation recognition and locating 3-D objects," International Journal of Robotic Research, 1986, Vol. 5, No 3, pp.27-52.

Google Scholar

[14] K. S. Arun, T. S. Huang, and S. D. Blostein, "Least square fitting of two 3-D point sets," IEEE Transactions on Pattern Analysis and Machine Intelligence, 1987, Vol. 9, No 5, pp.698-700.

DOI: 10.1109/tpami.1987.4767965

Google Scholar

[15] S. Melax, "A simple fast and effective polygon reduction algorithm," Game Developer, 1998, Vol. 5, No 11, pp.44-49.

Google Scholar