Linear Data Relocation and Reconstruction Algorithm for Vector Map

Abstract

AbstractTo protect the copyright of the two-dimensional vector map, this paper analyzed the well-known digital watermark algorithms in the domestic and international and proposed the linear data relocation and reconstruction algorithm. The innovation of this algorithm was based linear data instead of feature points to embed the watermark images into the vector map. It extracted the coordinates of vertices of line entities and sorted. Then, it relocated the vertices coordinates and embedded the scrambled binary watermark images. Finally, it calculated the similarity between the original watermark images and the extracted ones. We judged the correctness of the watermark information according to the similarity. The experiments show the linear data relocation and reconstruction algorithm has strong robustness in random noise attack, distortion, cropping and deletion of the map, without great amount calculation.KeywordsDigital watermarkVector mapLine entityRobustness