Zero-watermarking Algorithms For Spatial Vector Linear Data

With the development of network technology and the coming for era of big data,exchange and sharing of vector geospatial data becomes very active,it is widely used in many fields,such as mapping,navigation and military.The application of new technology has brought great convenience for the learning methods and lifestyle of the people,however,the security of the vector geospatial data cannot be ignored.As the current mainstream technology in the field of data security,digital watermarking technology is widely used in the field of copyright protection of vector geospatial data.Under the circumstance of does not affect the using value of data and without being perceived by the human perception system,digital watermarking technology directly embeds digital watermarking information into the carrier data.It can confirm copyright ownership of original data and provide security authentication.In order to meet the high-precision and practicality needs,some scholars have put forward the concept of zero-watermark.After zero-watermarking technology was successfully applied to the field of copyright protection of vector geospatial data.Zero-watermarking technology has obvious advantages in the aspect of vector geospatial data copyright protection.Therefore,there has great important theoretical significance and practical application value for the study the zero-watermarking technology of vector geospatial data.This paper uses the zero-watermarking technology and combines with the characteristics of vector linear data,which is the most important elements in the vector geospatial data,there is the depth theoretical research and experimental analysis about the generation of watermark image,construction and testing of zero-watermarking image for the zero-watermarking of the vector linear data.The main research contents and innovations are as follows:1.It analyzes and summarize the research background and status of the current digital watermark of the vector geospatial data,analyzes the concept and characteristics of zero-watermarking,introduces the structure and characteristics of vector linear data,analyzes the scrambling technology of watermark image and mathematical theory commonly used in the process of data encryption,further makes clear the contents and goals of this paper and determines the technical route and organizational structure of this article.2.A zero-watermarking algorithm for vector linear data is promised,which based on Arnold method and Douglas-Peucker algorithm.In this algorithm,the Arnold method is employed to shuffle the watermarking image,and the Douglas-Peucker algorithm is used to extract the characteristics.Finally,the XOR operation is done between them and the zero-watermark image is constructed.This algorithm can resist common geometric attacks including translation,rotation and scaling.It also has good robustness to Douglas-Peucker compression and cropping attack.3.A zero-watermarking algorithm for vector linear data based on logistic chaotic mapping and DFT is proposed.Firstly,the algorithm analyzes and summaries the application of DFT in digital watermarking of vector geospatial data.Then,the Logistic chaotic method is employed to shuffle the watermark image,and the XOR operation is done between the shuffled watermark image and binary matrixes consisting of phase values,which is obtained by the DFT.Finally,the zero-watermark images are constructed.The algorithm can resist common geometric attacks including translation and rotation.It also has good robustness to the format conversion and projection transformation attacks.This paper analyzes and summarizes the current research status about digital watermarking technology of vector geospatial data.In order to address the contradiction between robustness and imperceptibility in current digital watermarking algorithm combined with structural features of spatial vector linear data,two kinds of zero-watermarking algorithm for linear feature vector data are presented.The experiment is conducted to verify and analyze the feasibility of the algorithm,the results show that the algorithm works well.