一种基于最小四叉树划分的矢量数据水印算法  

A Vector Data Watermarking Algorithm Based on Minimum Quadtree Division

作　　者：王云飞[1] 赵婧 崔伟宏[1] 吕水[3] 

机构地区：[1]中国科学院遥感应用研究所,北京100101 [2]北京四维图新科技股份有限公司,北京100028 [3]北京市测绘设计研究院第五测绘分院,北京100038

出　　处：《计算机工程》2012年第22期111-113,118,共4页Computer Engineering

摘　　要：数字水印在实际应用时可能受到数据裁剪、数据压缩、随机增点和地物加密等攻击。针对该问题,基于特征点图层和最小四叉树划分,提出一种适用于线数据和面数据的矢量图层水印算法。利用Douglas-Peucker压缩算法提取矢量数据的特征点图层,通过最小四叉树划分将水印信息分区域嵌入到地物的特征点中。实验结果表明,该算法具有很好的不可感知性,相比MQUAD算法能更好地抵抗地图裁剪攻击。Digital watermark may encounter various attacks, such as data compression, feature increasing, random point increasing and map cutting, when it is used in practice. This paper proposes a digital watermarking algorithm based on feature point layer and minimum quadtree division, which is suitable for polyline and polygon layer. Douglas-Peucker compression algorithm is used to extract vector data of feature point layer, and the watermark is embedded into the feature point layer by minimum quadtree division. Experiments show that the algorithm is fairly good in imperceptibility and more robust than MQUAD algorithm in against map cutting attack.

关 键 词：特征点图层 最小四叉树 数字水印算法 矢量数据 Douglas—Peucker压缩算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]