Vector Map Watermarking Algorithm Based on Egional Curve Segmentation
In order to solve the copyright problem of the vector map in the resource sharing,this paper presents a regional curve segmentation watermarking algorithm for vector map.Vector maps is one of the most basic expression of information,and a large dataset of vector maps are often needed to perform watermark embedding.In this algorithm,the vector map is divided into several square regions.Moreover the regions are divided into different levels based on the number of points.The curves in the different regional levels are segmented into different length.According to the segmentation,the sub-curve rotates through a certain angle.And then a watermark is embedded into the vector map with the points.On account of the different curve segmentation and rotation angle,the experiment result shows that the algorithm has strong robustness against the cropping,scaling,rotation and compression attacks,and the contradiction between robustnessand and imperceptibility is resolved in the traditional watermarking algorithm.