.png){kind=icon}
返回
Reversible data-hiding scheme for 2-d vector maps based on difference expansion
.png){kind=icon}
PRE
AI
DOI：10.1109/TIFS.2007.902677.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Reversible watermarking is suitable for hiding data in 2-D vector maps because the distortions induced by data embedding can be removed after extracting the hidden bits. In this paper, two reversible data-hiding schemes are explored based on the idea of difference expansion. The first scheme takes the coordinates of vertices as the cover data and hides data by modifying the differences between the adjacent coordinates. The scheme achieves high capacity in the maps with highly correlated coordinates. Instead of the raw coordinates, the second scheme adopts the manhattan distances between neighbor vertices as the cover data. A set of invertible integer mappings is defined to extract manhattan distances from coordinates and the hidden data are embedded by modifying the differences between the adjacent distances. For those maps where distances exhibit high correlation, this scheme shows better performance than the former one, both in capacity and invisibility. Three different maps with distinct features are used for the experiments. The results indicate that two proposed schemes suit different types of maps, respectively, according to the correlation of the selected cover data. Both schemes are strictly reversible. In addition, they can be slightly robust for low amplitude distortions by selecting higher digits for data hiding. The potential applications of proposed schemes may include map data authentication, secret communication, etc.
Keyword:
difference expansion
invisibility
payload
reversible data hiding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
5.3K
被引数:
2.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容