A Zero-watermarking Algorithm of SVG Vector Map Based on Stroke-width Characteristic

DOI

10.2991/icicci-15.2015.8How to use a DOI?

Keywords

Keywords-SVG(Scalable Vector Graphics); Stroke-width Characteristic; Vector Map; Zero-watermarking

Abstract

Abstract—This paper proposes a zero-watermarking algorithm of SVG vector map based on stroke-width characteristic. The algorithm takes the stroke-width as an important characteristic. By statistics, calculating and simplifing the stroke-width probability in SVG vector map, building a K-d characteristic vector. With the Arnold transformation and specific operation, the stroke-width characteristic vector is embedded in the original watermark image, that is the zero-watermarking. Because the algorithm doesn’t modify any coordinates, common operation such as geometry editing, geometry transformation, data compression and coordinate precision reduction doesn’t affect the watermark extraction. Because of the simplification of stroke-width probability, the deletion of a small amount of entities has no influence on the extraction of the watermark yet.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Lin Zhou
AU  - Ying Huang
AU  - Zhanlong Chen
AU  - Xin Li
PY  - 2015/09
DA  - 2015/09
TI  - A Zero-watermarking Algorithm of SVG Vector Map Based on Stroke-width Characteristic
BT  - Proceedings of the 2nd International Conference on Intelligent Computing and Cognitive Informatics
PB  - Atlantis Press
SP  - 34
EP  - 37
SN  - 1951-6851
UR  - https://doi.org/10.2991/icicci-15.2015.8
DO  - 10.2991/icicci-15.2015.8
ID  - Zhou2015/09
ER  -