Zero watermarking algorithm for vector geographic data based on the number of neighboring features

16Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Zero watermarking is an important part of copyright protection of vector geographic data. However, how to improve the robustness of zero watermarking is still a critical challenge, especially in resisting attacks with significant distortion. We proposed a zero watermarking method for vector geographic data based on the number of neighboring features. The method makes full use of spatial characteristics of vector geographic data, including topological characteristics and statistical characteristics. First, the number of first-order neighboring features (NFNF) and the number of second-order neighboring features (NSNF) of every feature in vector geographic data are counted. Then, the watermark bit is determined by the NFNF value, and the watermark index is determined by the NSNF value. Finally, combine the watermark bits and the watermark indices to construct a watermark. Experiments verify the theoretical achievements and good robustness of this method. Simulation results also demonstrate that the normalized coefficient of the method is always kept at 1.00 under the attacks that distort data significantly, which has the superior performance in comparison to other methods.

Cite

CITATION STYLE

APA

Zhou, Q., Zhu, C., Ren, N., Chen, W., & Gong, W. (2021). Zero watermarking algorithm for vector geographic data based on the number of neighboring features. Symmetry, 13(2), 1–18. https://doi.org/10.3390/sym13020208

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free