Watermarking 2D Vector Maps in the Mesh-Spectral Domain
SMI '03 Proceedings of the Shape Modeling International 2003
Rights protection for relational data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A Vector Watermarking Using the Generalized Square Mask
ITCC '01 Proceedings of the International Conference on Information Technology: Coding and Computing
A Blind Watermarking of Vector Graphics Images
ICCIMA '03 Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications
Illustration Watermarks for Vector Graphics
PG '03 Proceedings of the 11th Pacific Conference on Computer Graphics and Applications
A high capacity watermarking system for digital maps
Proceedings of the 2004 workshop on Multimedia and security
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Toward Blind Robust Watermarking of Vector Maps
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
Watermarking relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Watermarking Polygonal Lines Using Fourier Descriptors
IEEE Computer Graphics and Applications
A Shape-Based Vector Watermark for Digital Mapping
DICTA '09 Proceedings of the 2009 Digital Image Computing: Techniques and Applications
IWDW'02 Proceedings of the 1st international conference on Digital watermarking
A Watermarking Scheme Using Polyline and Polygon Characteristic of Shapefile
ICINIS '10 Proceedings of the 2010 Third International Conference on Intelligent Networks and Intelligent Systems
Vector watermarking scheme for GIS vector map management
Multimedia Tools and Applications
| Hi-index | 0.00 |
Past research on watermarking digital road maps has been focused on deterring common attacks such as adding noise to the whole map so as to destroy the embedded watermarks. 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 and uses the fragment as a new map. When the new map is much smaller than the original map, it is called massive cropping. Merge attack merges maps from various sources together to form a new map. Conventional watermarking techniques fail against these attacks either because they require global information from the whole map or they must add too many local watermarks and affect the usability of the maps. This paper proposes 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 sub-region of the map. The approach achieves almost 100% detection accuracy for moderate crop and merge attacks, and over 80% accuracy with more than 95% of the original map cropped and removed. Furthermore, the method introduces very little distortion to the original map: to effectively protect a 23.5MB Minneapolis-St.Paul map against crop and merge as well as other common attacks, only 423 bits or 53 bytes of watermark is required.