Aiming at problems of current watermarking schemes for vector maps
e.g.
cannot embed abundant copyright data
low robustness
etc.
we propose a novel high-payload and reversible watermarking algorithm for vector maps
based on QR code and polar coordinate transformation. Copyright information is firstly hidden in a QR code
which is then considered as the copyright image and embedded into map vertices. To enhance the robustness of our scheme under geometric transformation
we embed watermarks into polar coordinates of vertices. After watermark extraction
this scheme cannot only obtain the original QR code
but also strictly recover the original vector data. Compared with current schemes
the proposed scheme can effectively increase the size of watermark payload
and it has strong robustness against common geometric and non-geometric attacks.
关键词
Keywords
references
Wang X T, Shao C Y, Xu X G, et al. Reversible data-hiding scheme for 2-D vector maps based on difference expansion[J]. IEEE Transactions on Information Forensics % Security, 2007, 2(3): 311-320. DOI: 311
Voigt M, Yang B, Brush C. Reversible watermarking of 2d-vector data[C]//Proceedings of the 2004 Multimedia and Security Workshop on Multimedia and Security. IEEE, 2004: 160-165.
Voigt M, Yang B, Brush C. High-capacity reversible watermarking for 2D vector data[C]//Proceedings of SPIE-The International Society for Optical Engineering. SPIE, 2005, 5681: 409-417.
Douglas D H, Peucker T K. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature[J]. Can Cartogr, 1973, 10(2): 112-122. DOI: 112
Sun J G, Zhang G Y, Yao A H, et al. A reversible digital watermarking algorithm for vector maps[J]. International Journal of Network Security, 2014, 16(1): 40-45. DOI: 40
Cao L J, Men C G, Ji R R. High-capacity reversible watermarking scheme of 2D-vector data[J]. Signal, Image and Video Processing, 2015, 9(6): 1387-1394. DOI: 1387