.png){kind=icon}
返回
A Lossless Watermarking Algorithm Based on Line Pairs for Vector Data
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3017700.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With the increasing demand for copyright protection of high-precision and sensitive vector data in Geographical Information System (GIS), research on lossless watermarking has attracted more and more attention. In this paper, a new lossless watermarking method based on line pairs is proposed. Firstly, the points and polygons are unified into the polylines, and then every two adjacent polylines are combined into a line pair. Besides, the storage direction and the interior angle of the line pairs are analyzed. Secondly, the watermark bit is determined by the interior angle of each line pair. Then, the watermark information is embedded by judging whether the storage direction of each line pair and the watermark bit is the same. Finally, experimental results verify that the proposed method works effectively for the data of the points, polylines and polygons, and has good invisibility without damaging the vector data. In addition, compared with the existing algorithm, the proposed method achieves higher robustness against geometric attacks, such as translating, rotating, and scaling the vector data.
Keyword:
Watermarking
Feature extraction
Data mining
Intellectual property
Robustness
Licenses
Lossless watermarking
vector data
line pair
storage direction
interior angle
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容