High-capacity reversible watermarking scheme of 2D-vector data
The application of two-dimensional (2D) vector map faces the security issues of copyright protection, which limit the usage of vector data in many scenarios. Reversible watermarking is a more feasible solution, which aims to restore the original data after watermark extraction. In this paper, high-capacity reversible watermarking scheme of 2D-vector data is proposed based on the idea of iterative embedding. It groups vertices as units for each polyline and selects highly correlated vertex units as cover data. Then the reversible embedding is carried out by iteratively modifying the median vertex coordinates of each selected embedding unit. This scheme can strictly recover the original vector data with watermark accurate extraction. Meanwhile, both higher payload capacity and perception invisibility are validated through theoretical analysis and comprehensive experiments. The experimental results show that the proposed reversible watermarking scheme is suitable for 2D-vector data applications where high-precision data are required.
reversible watermarking vector map copyright protection iterative embedding integer transform high capacity