Next Article in Journal
Semantic Modelling and Publishing of Traditional Data Collection Questionnaires and Answers
Previous Article in Journal
Can Social Robots Make Societies More Human?
Previous Article in Special Issue
Perceptual Hashing Based Forensics Scheme for the Integrity Authentication of High Resolution Remote Sensing Image
Article Menu

Export Article

Open AccessArticle
Information 2018, 9(12), 296;

An Efficient Robust Multiple Watermarking Algorithm for Vector Geographic Data

Key Laboratory of Virtual Geographic Environment, Ministry of Education, Nanjing Normal University, Nanjing 210023, China
State Key Laboratory Cultivation Base of Geographical Environment Evolution, Nanjing 210023, China
Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application, Nanjing 210023, China
Field Engineering College, Army Engineering University of PLA, Nanjing 210007, China
School of Networks and Tele-Communications Engineering, Jinling Institute of Technology, Nanjing 211169, China
Author to whom correspondence should be addressed.
Received: 31 October 2018 / Revised: 16 November 2018 / Accepted: 22 November 2018 / Published: 24 November 2018
(This article belongs to the Special Issue The Security and Digital Forensics of Cloud Computing)
Full-Text   |   PDF [10174 KB, uploaded 24 November 2018]   |  


Vector geographic data play an important role in location information services. Digital watermarking has been widely used in protecting vector geographic data from being easily duplicated by digital forensics. Because the production and application of vector geographic data refer to many units and departments, the demand for multiple watermarking technology is increasing. However, multiple watermarking algorithm for vector geographic data draw less attention, and there are many urgent problems to be solved. Therefore, an efficient robust multiple watermark algorithm for vector geographic data is proposed in this paper. The coordinates in vector geographic data are first randomly divided into non-repetitive sets. The multiple watermarks are then embedded into the different sets. In watermark detection correlation, the Lindeberg theory is used to build a detection model and to confirm the detection threshold. Finally, experiments are made in order to demonstrate the detection algorithm, and to test its robustness against common attacks, especially against cropping attacks. The experimental results show that the proposed algorithm is robust against the deletion of vertices, addition of vertices, compression, and cropping attacks. Moreover, the proposed detection algorithm is compatible with single watermarking detection algorithms, and it has good performance in terms of detection efficiency. View Full-Text
Keywords: multiple watermarking; vector geographic data; watermark detection; robustness; digital forensics multiple watermarking; vector geographic data; watermark detection; robustness; digital forensics

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Wang, Y.; Yang, C.; Zhu, C.; Ding, K. An Efficient Robust Multiple Watermarking Algorithm for Vector Geographic Data. Information 2018, 9, 296.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Information EISSN 2078-2489 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top