Abstract

This paper presented a new zero-watermarking algorithm for vector digital maps based on statistical characteristics. The watermark information is constructed by utilizing the original data's characteristics. We divide the map into rings by using concentric circles and count the number of vertices in each ring, which is the feature information. A zero watermark image is constructed by using feature information and copyright information. Experiments show that the watermarks are resilient to translation, scaling, vertex deletion and growth, rotation, random noise, objects scrambling and cropping, making it a robust algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call