Zero-Watermarking for Vector Maps Combining Spatial and Frequency Domain Based on Constrained Delaunay Triangulation...

With its lossless properties, zero-watermarking has attracted a lot of attention in the field of copyright protection for vector maps. However, the common zero-watermarking algorithm puts too much emphasis on mining for global features, making it vulnerable to cropping attacks, and the robustness is not comprehensive enough. This study provides a vector map zero-watermarking scheme that utilizes spatial statistical information and frequency domain transformation methods in an effort to solve the aforementioned issue. In order to make the scheme more resistant to cropping and compression, it is constructed on the basis of feature point extraction and point constraint blocking of the original vector map. Within each sub-block, feature points are used to build constraint Delaunay triangulation networks (CDTN), and the angular values within the triangle networks are then extracted as spatial statistics. The angle value sequence is further transformed by discrete Fourier transform (DFT), and the binarized phase sequence is used as the final feature information to build a zero watermark by executing an exclusive disjunction operation with the encrypted copyright watermark image, both of which contribute to the scheme's robustness and security. The results of the attack experiments show that the proposed vector map zero-watermarking can restore identifiable copyright images under common geometric attacks, cropping attacks, and coordinate system transformations, demonstrating a high level of robustness. The theoretical basis for the robustness of this watermarking scheme is the stability of CDTN and the geometric invariance of DFT coefficients, and both theory and experiment validate the method's validity.