×

Applying 3D polygonal mesh watermarking for transmission security protection through sensor networks. (English) Zbl 1407.94170

Summary: Although many research works have been carried out in the area of transmission 3D data through sensor networks, the security issue of transmission remains to be unsolved. It is important to develop systems for copyright protection and digital right management (DRM). In this paper, a blind watermarking algorithm is proposed to protect the transmission security of 3D polygonal meshes through sensor networks. Our method is based on selecting prominent feature vertices (prongs) on the mesh and then embedding the same watermark into their neighborhood regions. The embedding algorithm is based on modifying the distribution of vertex norms by using quadratic programming (QP). Decoding results are obtained by a majority voting scheme over neighborhood regions of these prongs. Assuming that cropping cannot remove all prongs, we can achieve robustness against the cropping attack both theoretically and experimentally. Experiments indicate that the proposed method is also robust against noise, smoothing, and mesh simplification. The proposed method has provided a solution for 3D polygonal watermarking which is potential to withstand a variety of attacks.

MSC:

94A62 Authentication, digital signatures and secret sharing
68P25 Data encryption (aspects in computer science)
90C20 Quadratic programming

Software:

Metro
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Dugelay, J. L.; Baskurt, A.; Daoudi, M., 3D Object Processing: Compression, Indexing and Watermarking (2008), West Sussex, UK: Wiley, West Sussex, UK
[2] Rondao-Alface, P.; Macq, B., From 3D mesh data hiding to blind and robust 3D shape watermarking: a survey, Transactions on Data Hiding and Multimedia Security II. Transactions on Data Hiding and Multimedia Security II, Lecture Notes in Computer Science Transactions on Data Hiding and Multimedia Security, 4499, 91-115 (2007), Berlin, Germany: Springer, Berlin, Germany · Zbl 1149.68375 · doi:10.1007/978-3-540-73092-7_5
[3] Wang, K.; Lavoue, G.; Denis, F.; Baskurt, A., A comprehensive survey on three-dimensional mesh watermarking, IEEE Transactions on Multimedia, 10, 8, 1513-1527 (2008) · doi:10.1109/TMM.2008.2007350
[4] Piegl, L.; Tiller, W., The NURBS Book (1997), Berlin, Germany: Springer, Berlin, Germany · Zbl 0868.68106
[5] Adams, B.; Keiser, R.; Pauly, M.; Guibas, L. J.; Gross, M.; dutré, P., Efficient raytracing of deforming point-sampled surfaces, Proceedings of the 26th Annual Conference of the European Association for Computer Graphics (EUROGRAPHICS ’05)
[6] Oomes, S.; Snoeren, P.; Dijkstra, T., 3D shape representation: transforming polygons into voxels, Proceedings of the 1st International Conference on Scale-Space Theory in Computer Vision
[7] Ohbuchi, R.; Masuda, H.; Aono, M., Watermarking three-dimensional polygonal models through geometric and topological modifications, IEEE Journal on Selected Areas in Communications, 16, 4, 551-559 (1998) · doi:10.1109/49.668977
[8] Yeo, B.-L.; Yeung, M. M., Watermarking 3D objects for verification, IEEE Computer Graphics and Applications, 19, 1, 36-45 (1999) · doi:10.1109/38.736467
[9] Benedens, O.; Busch, C., Towards blind detection of robust watermarks in polygonal models, Computer Graphics Forum, 19, 3, 199-208 (2000) · doi:10.1111/1467-8659.00412
[10] Cayre, F.; Macq, B., Data hiding on 3-D triangle meshes, IEEE Transactions on Signal Processing, 51, 4, 939-949 (2003) · Zbl 1369.94577 · doi:10.1109/TSP.2003.809380
[11] Zafeiriou, S.; Tefas, A.; Pitas, I., Blind robust watermarking schemes for copyright protection of 3D mesh objects, IEEE Transactions on Visualization and Computer Graphics, 11, 5, 596-607 (2005) · doi:10.1109/TVCG.2005.71
[12] Bors, A. G., Watermarking mesh-based representations of 3-D objects using local moments, IEEE Transactions on Image Processing, 15, 3, 687-701 (2006) · doi:10.1109/TIP.2005.863116
[13] Cho, J.-W.; Prost, R.; Jung, H.-Y., An oblivious watermarking for 3-D polygonal meshes using distribution of vertex norms, IEEE Transactions on Signal Processing, 55, 1, 142-155 (2007) · Zbl 1391.94829 · doi:10.1109/TSP.2006.882111
[14] Kanai, S.; Date, H.; Kishinami, T., Digital watermarking for 3D polygons using multiresolution wavelet decomposition, Proceedings of the 6th IFIP WG 5.2 International Workshop on Geometric Modeling: Fundamentals and Applications (GEO)-6
[15] Praun, E.; Hoppe, H.; Finkelstein, A., Robust mesh watermarking, Proceedings of the 26th International Conference on Computer Graphics and Interactive Techniques (SIGGRAPH ’99)
[16] Yin, K.; Pan, Z.; Shi, J.; Zhang, D., Robust mesh watermarking based on multiresolution processing, Computers & Graphics, 25, 3, 409-420 (2001) · doi:10.1016/S0097-8493(01)00065-6
[17] Ohbuchi, R.; Mukaiyama, A.; Takeaways, S., A frequency-domain approach to watermarking 3D shapes, Proceedings of Annual Conference of the European Association for Computer Graphics (EUROGRAPHICS ’02)
[18] Cayre, F.; Rondao-Alface, P.; Schmitt, F.; Macq, B.; Maître, H., Application of spectral decomposition to compression and watermarking of 3D triangle mesh geometry, Signal Processing, 18, 4, 309-319 (2003) · doi:10.1016/S0923-5965(02)00147-9
[19] Wu, J.; Kobbelt, L., Efficient spectral watermarking of large meshes with orthogonal basis functions, The Visual Computer, 21, 8-10, 848-857 (2005) · doi:10.1007/s00371-005-0311-5
[20] Ohbuchi, R.; Masuda, H.; Aono, M., Watermarking three-dimensional polygonal models, Proceedings of the 5th ACM International Conference on Multimedia
[21] Yu, Z.; Ip, H. H. S.; Kwok, L. F., A robust watermarking scheme for 3D triangular mesh models, Pattern Recognition, 36, 11, 2603-2614 (2003) · doi:10.1016/S0031-3203(03)00086-4
[22] Liu, Q.; Yang, L., Watermarking of 3D polygonal meshes based on feature points, Proceedings of the 2nd IEEE Conference on Industrial Electronics and Applications (ICIEA ’07) · doi:10.1109/ICIEA.2007.4318728
[23] Roudet, C.; Dupont, F.; Baskurt, A., Multiresolution mesh segmentation based on surface roughness and wavelet analysis, Visual Communications and Image Processing (VCIP ’07)
[24] Rondao-Alface, P.; Craene, M. D.; Macq, B., Three-dimensional image quality measurement for the benchmarking of 3D watermarking schemes, The 17th Annual Symposium on Electronic Imaging—Security, Steganography, and Watermarking of Multimedia Contents VII · doi:10.1117/12.589129
[25] Rondao-Alface, P.; Macq, B.; Cayre, F., Blind and robust watermarking of 3D models: how to withstand the cropping attack?, Proceedings of the 14th IEEE International Conference on Image Processing (ICIP ’07) · doi:10.1109/ICIP.2007.4379866
[26] Katz, S.; Leifman, G.; Tal, A., Mesh segmentation using feature point and core extraction, The Visual Computer, 21, 8-10, 649-658 (2005) · doi:10.1007/s00371-005-0344-9
[27] Valette, S.; Kompatsiaris, I.; Strintzis, M., A polygonal mesh partitioning algorithm based on protrusion conquest for perceptual 3D shape description, Proceedings of the Workshop Towards Semantic Virtual Environments (SVE ’05)
[28] Cristina, C.; Rodríguez-Aragón, L. J.; Cabello, E., Automatic 3D face feature plints extraction with spin images, Proceedings of the 3rd International Conference on Image Analysis and Recognition (ICIAR ’06)
[29] Page, D. L.; Koschan, A. F.; Sukumar, S. R.; Roui-Abidi, B.; Abidi, M. A., Shape analysis algorithm based on information theory, Proceedings of the International Conference on Image Processing (ICIP ’03)
[30] Yagel, R.; Cohen, D.; Kaufman, A., Normal estimation in 3 D discrete space, The Visual Computer, 8, 5-6, 278-291 (1992) · doi:10.1007/BF01897115
[31] Tellier, P.; Debled-rennesson, I., 3D discrete normal vectors, Proceedings of th 8th International Conference on Discrete Geometry for Computer Imagery (DGCI ’99)
[32] Dijkstra, E. W., A note on two problems in connexion with graphs, Numerische Mathematik, 1, 1, 269-271 (1959) · Zbl 0092.16002 · doi:10.1007/BF01386390
[33] Kimmel, R.; Sethian, J. A., Computing geodesic paths on manifolds, Proceedings of the National Academy of Sciences of the United States of America, 95, 15, 8431-8435 (1998) · Zbl 0908.65049 · doi:10.1073/pnas.95.15.8431
[34] Giard, J.; Macq, B., From mesh parameterization to geodesic distance estimation, Proceedings of the 25th European Workshop on Computational Geometry (EuroCG ’09)
[35] Giard, J.; Macq, B., Fast geodesic distance approximation using mesh decimation and front propagation, Image Processing: Algorithms and Systems VII · doi:10.1117/12.805599
[36] Hu, R.; Rondao-Alface, P.; Macq, B., Constrained optimisation of 3D polygonal mesh watermarking by quadratic programming, Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP ’09) · doi:10.1109/ICASSP.2009.4959880
[37] Boyd, S.; Vandenberghe, L., Convex Optimization (2004), Cambridge, UK: Cambridge University Press, Cambridge, UK · Zbl 1058.90049
[38] Cignoni, P.; Rocchini, C.; Scopigno, R., Metro: measuring error on simplified surfaces, Computer Graphics Forum, 17, 2, 167-174 (1998) · doi:10.1111/1467-8659.00236
[39] Field, D. A., Laplacian smoothing and Delaunay triangulations, Communications in Applied Numerical Methods, 4, 6, 709-712 (1988) · Zbl 0664.65107 · doi:10.1002/cnm.1630040603
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.