Watermarking road maps against crop and merge attacks

Abstract

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 MinneapolisSt.Paul map against crop and merge as well as other common attacks, only 423 bits or 53 bytes of watermark is required.

RST Invariant Fragile Watermarking for 2D Vector Map Authentication

“…Currently, research on watermarking for 2D vector maps is mainly focused on robust watermarking [1][2][3][4][5][6][7][8][9] for copyright protection or reversible (also referred to as invertible, lossless, or distortion-free) watermarking [10][11][12][13][14] for content recovery. Few works have been done on 2D vector map fragile watermarking [15][16][17][18][19].…”