改进的块差值无损鲁棒图像水印算法  

Improved lossless robust image watermarking algorithm based on block's difference

作　　者：尚冠宇[1] 韩万兵[1] 郭凡新[1] 邓小鸿[2,3] 

机构地区：[1]郑州大学西亚斯国际学院,河南郑州451150 [2]中南大学信息科学与工程学院,湖南长沙410083 [3]江西理工大学应用科学学院,江西赣州341000

出　　处：《计算机工程与设计》2013年第3期809-813,共5页Computer Engineering and Design

基　　金：国家自然科学基金项目(61103202);江西省教育厅科技基金项目(GJJ12347)

摘　　要：为了解决目前基于块差值无损鲁棒水印算法的不足,提出了一种基于Huffman编码和K-means聚类的改进算法。对嵌入过程中产生的水印负载,利用Huffman编码进一步减少其大小,提高水印嵌入容量;对水印提取过程中,可能发生的1-bit区域和0-bit区域重合的问题,利用K-means聚类算法提高水印提取精确度。实验结果表明,与现有相关算法相比,文种算法在水印嵌入容量和鲁棒性上具有明显优势。To deal with the problems in lossless robust watermarking based on image block~ s difference, an adaptive algorithm is proposed. In the embedding procedure, the Huffman coding is employed to reduce the watermark＇ s overhead such as the marked information of image＇s block, and increases the actual embedding capacity. In the extract procedure, the K-means clustering is utilized to resolve the overlap problem between 1-bit zone and O-bit zone, and enhances the extracting accuracy. Experimental results show that, compared with previous works, the performance of the proposed method is significantly improved in terms of capacity and robustness.

关 键 词：可逆水印 鲁棒性 块差值 HUFFMAN编码 K-MEANS聚类 

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