矢量地图无损数字水印技术和算法研究

发布时间：2018-08-13 18:54

【摘要】：随着矢量地图在实际应用中的不断深化,矢量地图的版权保护及数据认证等安全问题日益凸显。数字水印技术作为矢量地图版权保护的重要手段之一得到了广大专家学者、科研机构广泛的关注,本文以矢量地图无损数字水印技术为主题,研究了矢量地图无损水印框架模型、针对如何提高矢量地图无损水印算法的鲁棒性、水印容量等研究了一系列矢量地图无损数字水印算法,本文主要研究成果总结如下： (1)矢量地图无损数字水印技术分析。对矢量地图数据的内容特征、数据组织结构特征进行了深入剖析,在此基础上给出了矢量地图无损水印的通用模型,分析了矢量地图无损数字水印技术的嵌入位置,并根据矢量地图的数据特点,研究了矢量地图数字水印算法评价指标。 (2)研究了矢量地图的零水印技术。根据矢量地图的数据特点,给出了矢量地图零水印的框架模型,分析了生成有意义零水印的理论基础。针对传统水印算法抵抗攻击鲁棒性较差的问题,分别从矢量地图的空间特征和属性特征入手,设计了两种零水印方案：一种基于矢量地图特征点和分块的零水印算法,通过提取矢量数据的特征点、对地图进行改进的四叉树(MQUAD)分块处理,设计了一种有效对抗地图几何变换(平移、旋转、缩放等)、数据压缩、顶点删除、增加以及数据裁剪等操作的鲁棒的零水印算法；一种基于矢量地图要素编码的零水印方案,分析了属性作为构造特征信息的可行性,利用要素编码的稳定性构造零水印,从而有效提高了算法在抵抗几何变换(平移、旋转、缩放)、地图简化尤其是地物编辑等方面的鲁棒性。 (3)提出了一种改进的矢量地图差值扩张可逆水印算法。差值扩张算法具有算法简单,水印容量较大等优点。在传统差值扩张算法的基础上,对顶点坐标计算公式加以改进,不需要计算顶点对之间的均值,只需将第一个顶点的坐标与水印负载一起嵌入,除第一个顶点坐标不改变外,其他顶点坐标只改变一次。在提高水印的嵌入容量和算法效率,降低数据误差,增强水印信息的安全性方面提供了解决方案。 (4)提出了一种矢量地图直方图平移可逆水印算法。针对矢量地图顶点坐标之间的相关性较弱、数据存储无序的特点,设计了一种基于排序和直方图平移的矢量地图可逆水印算法,对矢量地图顶点进行排序以增强相邻顶点坐标之间的相关性,提高水印容量；利用直方图平移代替差值扩张来减小水印嵌入引入的数据误差,算法同时将原始矢量地图的HASH值随秘密信息一起嵌入,可进一步提高版权认证的能力,算法具有较高的嵌入容量和较小的数据误差,同时对坐标平移、数据排序攻击具有较强的鲁棒性。 (5)提出了一种大容量矢量地图可逆水印算法。介绍了水印容量评价指标,并对差值扩张算法和直方图平移算法水印容量进行分析,差值扩张算法水印容量依赖于矢量地图顶点的可扩展差值,对于小数据量地图水印嵌入容量不高,而直方图平移算法在需要多层嵌入时产生的附加信息较多,水印潜入率不高。针对这两类算法的缺陷,设计了一种基于差值平移和奇偶检校的大容量矢量地图可逆水印算法,算法水印容量不受顶点坐标相关性的影响,有效提高了水印的嵌入容量,同时与差值扩张算法和直方图平移算法相比,算法引入的误差较小。图78幅,表11个,参考文献118篇
[Abstract]:With the deepening of vector map in practical application, the copyright protection and data authentication of vector map become more and more important. Digital watermarking technology as one of the important means of vector map copyright protection has been widely concerned by experts and scholars, scientific research institutions, this paper mainly focuses on vector map lossless digital watermarking technology. In this paper, a lossless watermarking framework model for vector maps is studied, and a series of lossless watermarking algorithms for vector maps are studied to improve the robustness and watermark capacity of the lossless watermarking algorithm.
(1) Vector map lossless digital watermarking technology analysis. The content characteristics of vector map data, data organizational structure characteristics are analyzed in depth. On this basis, a general model of vector map lossless digital watermarking is given. The embedding position of vector map lossless digital watermarking technology is analyzed. According to the data characteristics of vector map, the embedding position of vector map lossless digital watermarking technology is studied. The evaluation index of digital watermarking algorithm for vector map.
(2) The zero-watermarking technology of vector map is studied. According to the data characteristics of vector map, the frame model of vector map zero-watermarking is given, and the theoretical basis of generating meaningful zero-watermarking is analyzed. Aiming at the problem of poor robustness of traditional watermarking algorithm against attack, the spatial and attribute features of vector map are designed. Two zero-watermarking schemes are proposed. A zero-watermarking algorithm based on feature points and block of vector map is proposed. By extracting feature points of vector data, the map is partitioned into Improved Quadtree (MQUAD). An effective anti-MAP geometric transformation (translation, rotation, scaling, etc.), data compression, vertex deletion, addition and data clipping are designed. A robust zero-watermarking algorithm based on vector map element coding is proposed, and the feasibility of attribute as feature information is analyzed. The stability of element coding is used to construct zero-watermarking, which effectively improves the algorithm's resistance to geometric transformation (translation, rotation, scaling), map simplification, especially object editing. Robustness.
(3) An improved reversible watermarking algorithm based on difference expansion for vector maps is proposed. The algorithm has the advantages of simple algorithm and large watermark capacity. Load embedding, except the first vertex coordinates do not change, the other vertex coordinates only change once. In order to improve the watermark embedding capacity and algorithm efficiency, reduce data errors, enhance the security of watermark information to provide a solution.
(4) A reversible watermarking algorithm for vector map based on histogram translation is proposed. A reversible watermarking algorithm for vector map based on sorting and histogram translation is designed to enhance the relationship between adjacent vertex coordinates. By using histogram translation instead of difference expansion to reduce the data error caused by watermark embedding, the algorithm also embed the HASH value of the original vector map with secret information, which can further improve the ability of copyright authentication. The algorithm has higher embedding capacity and smaller data error, and at the same time, the coordinate level. Data sorting attack has strong robustness.
(5) A reversible watermarking algorithm for large-capacity vector maps is proposed. The evaluation index of watermarking capacity is introduced, and the watermark capacity of difference expansion algorithm and histogram translation algorithm is analyzed. The watermark capacity of difference expansion algorithm depends on the scalable difference of the vertices of vector maps. For small-volume maps, the watermark embedding capacity is not high, but the watermark capacity of histogram translation algorithm is analyzed. A reversible watermarking algorithm for large-scale vector maps based on difference translation and parity check is proposed to overcome the drawbacks of these two algorithms. The watermarking capacity of the algorithm is not affected by the correlation of vertex coordinates and the watermark embedding capacity is improved effectively. Compared with the difference expansion algorithm and the histogram translation algorithm, the error introduced by the algorithm is smaller. Figure 78, table 11, 118 references
【学位授予单位】：中南大学
【学位级别】：博士
【学位授予年份】：2013
【分类号】：TP309.7;P283

【相似文献】