Abstract

A lot of watermarking algorithms for vector geographic data are presented in the literature. Due to widely application of digital watermarking, more demands are required, such as multiple watermarking algorithm. However, vector geographic data attracted less research focus on multiple watermarking. Consequently, a multiple watermarking algorithm for vector geographic data is proposed. In particular, the vertices are mapped to the logic domains firstly based on the constructed function. Then every domain is subdivided into blocks according to dichotomy and the number of embedding watermarks. Then, every watermark is embedded in the corresponding block. During the watermark detection, the watermarks are detected without the original vector geographic data. Finally, the experiments are made to test the multiple watermark capacity and robustness against attacks, with an emphasis on cropping attacks. The experimental results show that the proposed algorithm has good robustness against common attacks, such as, data simplification, vertex addition, vertex deletion, feature deletion, and cropping attacks. Moreover, the algorithm provides high multiple watermark capacity.

Highlights

  • Digital watermarking has been used to protect the vector geographic data for more than ten years

  • We proposed a multiple watermarking algorithm for vector geographic data using vertex coordinates mapping and logic domain subdivision

  • The algorithm aims to improve the robustness against common attacks with an emphasis on cropping attacks

Read more

Summary

Introduction

Digital watermarking has been used to protect the vector geographic data for more than ten years. Many watermarking algorithms have been proposed for vector geographic data [4, 9,10,11,12, 18, 19, 21, 22, 24, 25, 29]. Because of the requirement of multiple authorizations, any damage to any watermark is undesired This means that all watermarks should be preserved after cropping the vector geographic data. These two methods require as a precondition that all watermarks are provided To overcome these restrictions, the third method is to divide the cover data into blocks according to a quad-tree algorithm and to embed watermarks in different blocks.

The proposed multiple watermarking algorithm
Watermark generation
Coordinate mapping and domain subdivision
Embedding multiple watermarks
Percentage Results
Experimental results and analysis
Algorithm robustness
Polygon 5861
The robustness of the algorithm against a cropping attack
Multiple watermark capacity
Conclusions
Compliance with ethical standards

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.