Illustration Watermarks for Vector Graphics
PG '03 Proceedings of the 11th Pacific Conference on Computer Graphics and Applications
A blind, fast and robust method for geographical data watermarking
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
A Novel Framework for Watermarking: The Data-Abstracted Approach
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
SB-RAWVec - a semi-blind watermarking method for vector maps
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Lossless data embedding in electronic inks
IEEE Transactions on Information Forensics and Security
Reversible fragile watermarking for 2-D vector map authentication with localization
Computer-Aided Design
IWDW'04 Proceedings of the Third international conference on Digital Watermarking
Vector watermarking scheme for GIS vector map management
Multimedia Tools and Applications
Watermarking road maps against crop and merge attacks
Proceedings of the first ACM workshop on Information hiding and multimedia security
Reversible fragile watermarking for locating tampered blocks in 2D vector maps
Multimedia Tools and Applications
| Hi-index | 0.00 |
This paper proposes a digital watermarking algorithm for2D vector digital maps. The watermark is a robust,informed-detection watermark to be used to prevent suchabuses as an intellectual property rights violation. Thealgorithm proposed in this paper embeds watermarks inthe frequency-domain representation of a 2D vectordigital map. Our method treats vertices in the map as apoint set, and imposes connectivity among the points byusing Delaunay triangulation. The method then computesthe mesh-spectral coefficients [Karni00] from the meshcreated. Modifications of the coefficients according to themessage bits, and inverse transforming the coefficientsback into the coordinate domain produces thewatermarked map. Our evaluation experiments showedthat the watermark produced by the method is resistantagainst additive random noise, similarity transformation,vertex insertion and removal. It is also resistant, to someextent, against cropping. Compared to our previousalgorithm [Ohbuchi02], the algorithm described in thispaper showed significantly improved attack resiliency.