Resumen
The existing digital watermarking schemes for vector maps focus mainly on the process of watermark embedding, while few works have been conducted on the topic of the self-optimization of watermark data in the process of watermark detection. There is thus still much room for accuracy improvement in watermark detection. In this paper, a model of mixed watermark data construction is built first. It constructs the error-correction codes and checking code of the original copyright watermark data and combines them to generate the final watermark data. Additionally, a lossless compression algorithm is designed for watermark data to constrain the total watermark length. Based on the constructed model, a self-error-correction-based reversible watermarking scheme is put forward for vector maps. In this scheme, map vertices are divided into non-intersecting groups first according to stability, and mixed watermark data are then embedded with respective vertex groups. Simulation results demonstrate that the watermark capacity of this scheme is 1.0000, the coordinate error caused by the watermark embedding process can be limited to no more than 0.00001 when the strength of watermark embedding is set to five, and several watermark bits can be effectively detected and corrected after watermark extraction. Experimental results and analysis show that it can strike a good balance among reversibility, invisibility, capacity and robustness. It can provide a novel solution to improve the watermark detection accuracy of digital watermarking schemes for vector maps.