Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
ABSTRACT. Past research on watermarking digital road maps has been focused on deterring common attacks such as adding noise to the whole.
A novel quad-Tree based blind watermarking scheme that partitions the original map according to the quad-tree and plants just one single bit in each ...
This paper focuses on two less common but increasingly used types of attack: crop attacks and merge attacks. Crop attack crops a fragment of the original map ...
Apr 19, 2023 · This study provides a vector map zero-watermarking scheme that utilizes spatial statistical information and frequency domain transformation methods
Bibliographic details on Watermarking road maps against crop and merge attacks.
By the watermark bit count, map legends are divided into groups to contain multiple watermarks. Meanwhile, a watermark bit recovery method is designed to fix ...
Missing: road merge
Nov 16, 2023 · For vector geographic data, the most common attacks are randomly deleting vertices, cropping, compression, or randomly adding vertices. The ...
A Robust Blind Watermarking of Vector Map. Li Min, Xianchen Zhu, Qiang Li. 2012. Watermarking road maps against crop and merge attacks. Kai-Ming Jiang, Kenny Q ...
This algorithm is extremely resistant to vertex addition, vertex deletion, and map cropping attacks. However, it is vulnerable to geometric attacks and its ...
Missing: merge | Show results with:merge
This paper presents a way to embed watermarks into 2D vectordata. The watermarking system provides a high capacity and is robust against the following attacks.