A novel multi-stage watermarking scheme of vector maps

Vector maps are distributed frequently among various departments and subscribers, and traditional single-stage watermarking technology cannot provide powerful multi-copyright protection of them. In this paper, a novel multi-stage watermarking algorithm is proposed for vector maps, aiming at robustne...

Full description

Saved in:
Bibliographic Details
Published in:Multimedia tools and applications 2021, Vol.80 (1), p.877-897
Main Authors: Qiu, Yinguo, Duan, Hongtao
Format: Article
Language:English
Subjects:
Algorithms
Apexes
Computer Communication Networks
Computer Science
Copyright
Data Structures and Information Theory
Multimedia Information Systems
Polar coordinates
Robustness
Special Purpose and Application-Based Systems
Watermarking
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Vector maps are distributed frequently among various departments and subscribers, and traditional single-stage watermarking technology cannot provide powerful multi-copyright protection of them. In this paper, a novel multi-stage watermarking algorithm is proposed for vector maps, aiming at robustness enhancement and maximum-supported watermark capacity improvement. A watermark generation method is designed based on QR code to shorten watermark length, and watermarks are embedded into polar coordinates of map vertices so as to improve the robustness of the proposed scheme. Another method of copyright information combination is raised to keep watermark length invariant along with the increasing of the total stages of watermark data, and the maximum-supported stages of watermarks can be thus improved without affecting the robustness of watermarking algorithm. Moreover, each stage of copyright information occupies a specified space within the final watermark data, and non-interference among various watermarks can be guaranteed and different copyright data can be efficiently distinguished after watermark extraction. Compared with the existing researches, the proposed scheme can increase effectively the size of maximum-supported watermark capacity, and it has strong robustness under common geometric and non-geometric attacks, which have been validated by both theoretical analysis and comprehensive experiments.
ISSN:1380-7501
1573-7721
DOI:10.1007/s11042-020-09776-8