矢量地图的一种非盲数字水印算法  

A Non-blind Digital Watermarking Algorithm for Vector Map Data

作　　者：曾端阳[1] 闫浩文[1] 牛莉婷[1] 程亚辉[1] 魏春蕾[1] 

机构地区：[1]兰州交通大学测绘与地理信息学院,甘肃兰州730070

出　　处：《兰州交通大学学报》2013年第4期176-180,共5页Journal of Lanzhou Jiaotong University

基　　金：国家科技支撑计划项目(2013BAB05B01)

摘　　要：运用聚类思想,采用K-means算法,对矢量地图线图层进行聚类运算,在此基础上提出了矢量地图的一种非盲数字水印算法.对分类后的数据,提取其坐标值中的小数部分,采用量化嵌入方法,把水印图像二值化得到的0,1二值序列,嵌入分类后的载体数据中,完成水印信息的嵌入.实验证明,此算法对图形数据的平移、增点、删点、裁剪、压缩等攻击具有较好的鲁棒性.A non-blind digital watermarking algorithm is presented for vector map data by using K-means al- gorithm to cluster the vector polyline layers based on the idea of clustering. After classification of the data, the decimal part of its coordinates is extracted. Then, the watermark image is binary into 0,1. Finally, by u- sing the quantitative method to embed the binary sequence into different categories of data, so as to com- plete the watermark embedding. The experiments show that the algorithm is robustness to some attacks such as translating data, increasing points, deleting points, cropping graphic and compressing data.

关 键 词：矢量地图 数字水印 聚类 K-MEANS 

分 类 号：P208[天文地球—地图制图学与地理信息工程]