A Reversible Watermarking Algorithm for Vector Maps Based on Virtual Interval Mapping and Controllable Perturbation
In the majority of vector map reversible watermarking algorithms,there is significant correlation between the watermarked vertices.This correlation weakens the algorithms'resistance to vertex editing attacks and limits its practical effectiveness.Therefore,this paper proposes a robust and perturbation-controlled reversible watermarking algorithm for vector maps.The algorithm is designed based on the concepts of quantized index modulation and pseudo-random mapping.Firstly,a virtual interval is created as the concealed domain of the watermark based on the precision tolerance of the data,and the tolerance is employed to restrict the range of movement of the vertices.Secondly,the proximity of the adjacent vertices inside the feature is employed as a pseudo-random seed,generating a pseudo-random integer to calculate the watermark information.This process effectively reduces the correlation among the vertices.Finally,the embedding strength is used to define multiple subintervals.The position of the vertex within these subintervals is then adjusted based on the watermark information.This process allows for the embedding of a high-capacity watermark and improves the algorithm's suitability for small-scale data.Once the watermark embedding process is finished,the average value of all vertices is computed as the key to guarantee the precision of watermark extraction.The experimental results demonstrate that the proposed watermarking algorithm exhibits strong resistance against vertex addition and deletion,feature addition and deletion,cropping,simplification,translation,scaling,and other related manipulations.Additionally,it ensures that the level of disturbance remains within a manageable range.
万方数据
维普
