A DCT-Based Blind Watermarking Algorithm for Vector Digital Maps

Abstract:

This paper presented a new DCT-based watermarking algorithm for vector digital maps. A watermark bit is embedded by modifying the relationship of several high-frequency coefficients in DCT domain. To enhance data accuracy and robustness of the watermark, we proposed a Double Error Estimation method. This method allowed watermarks to be embedded when the vertices with distortion are smaller than thresholds. Experiments show that the watermarks are resilient to random noise, general geometric transformation, data scrambling and cropping. The algorithm is blind and it is easy to implement.

• Periodical: Advanced Materials Research (Volumes 179-180)
• Pages: 1053-1058
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.179-180.1053
• Online since: January 2011
• Authors: Xun Wang, Ding Jun Huang, Zhi Yong Zhang
• Keywords: DCT, Digital Watermarking, Double Error Estimation, Vector Map

References

[1] Cox GS, deJager G. A survey of point pattern matching techniques and a new approach to point pattern recognition [A]. In : Proceedings of Symposium on Communication and Signal Processing , Lesotho , 1993. 243～248.

DOI: 10.1109/comsig.1992.274276

[2] Johnson Neil F, Duric Zoran, Jajodia Sushil. Information Hiding: Steganography and Watermarking-Attacks and Countermeasures [ M ]. Portland: Kluwer Academic Publishers, (2000).

DOI: 10.1007/978-1-4615-4375-6_4

[3] M. Kurihara, N. Komatsu, H. Arita. Watermarking Vector Digital Maps, Tokyo: Special Interest Group Report Vol. 2000, No. 36, Information Processing Society of Japan.

[4] I. Kitamura, S. Kanai, and T. Kishinami, Watermarking vector digital map using wavelet transformation, Proc. Annual Conference of the Geographical Information Systems Association(GISA), Tokyo, pp.417-421, (2000).

[5] R. Ohbuchi, H. Ueda, S. Endoh, Robust watermarking of vector digital maps, in Proc. IEEE Conference on Multimedia and Expo 2002, Lausanne, Swistzerland, pp.1-4, (2002).

DOI: 10.1109/icme.2002.1035847

[6] V. Solachidis, N. Nikolaidis, I. Pitas, Watermaking polygonal lines using fourier descriptors. ICASSP2000, Instablul Turkey, 2000. 5-9.

DOI: 10.1109/icassp.2000.859213

[7] N. Nikolaidis, N. Pitas, A. Giannoula, Watermarking of sets of polygonal lines using fusion techniques. Proc IEEE International Conference on Multimedia and Expo. Lauzanne, Switzerland, 549-552, (2002).

DOI: 10.1109/icme.2002.1035674

[8] R. Ohbuchi, H. Ueda, S. Endoh, Watermarking 2D vector maps in the mesh-spectral domain. 2003 International Conference on Shape Modeling and Applications, Seoul, Korea. IEEE Computer Society, pp.12-16 May (2003).

DOI: 10.1109/smi.2003.1199619

[9] R. Ohbuchi, A. Mukaiyama, S. Takahashi, A frequency-domain approach to watermarking 3D shapes, Computer Graphics Forum 21(3), pp.1-10, (2002).

DOI: 10.1111/1467-8659.00597

[10] VOIGT M, YANG B , BUSCH C. Reversible watermarking of 2D-vector data[C] /Proc of the 2004 Multimedia and Security Workshop on Multimedia and Security. Germany , Magdeburg, 2004 : 160-165.

DOI: 10.1145/1022431.1022459

[11] Han-ling Zhang, Ming-ming Gao. A Semi-fragile Digital Watermarking Algorithm for 2D Vector Graphics Tamper Localization, Proceedings of the 2009 International Conference on Multimedia Information Networking and Security, Volume 01: 549-552.

DOI: 10.1109/mines.2009.224

[12] Parag Agarwal , Balakrishnan Prabhakaran, Robust blind watermarking mechanism for point sampled geometry, Proceedings of the 9th workshop on Multimedia & security, September 20-21, 2007, Dallas, Texas, USA, 2007 : 175 – 186.

DOI: 10.1145/1288869.1288894

[13] B. Vallet and B. Lévy. Spectral geometry processing with manifold harmonics. In Proceedings of Eurographics, volume 27, pages 251-260, (2008).

DOI: 10.1111/j.1467-8659.2008.01122.x