检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李晨[1] 喻枭 田丽华[1] Li Chen;Yu Xiao;Tian Lihua(School of Software Engineering,Xi’an Jiaotong University,Xi’an 710049,China)
机构地区:[1]西安交通大学软件学院
出 处:《计算机应用研究》2019年第8期2424-2428,2435,共6页Application Research of Computers
基 金:国家自然科学基金资助项目(61403302);中央高校基本科研业务费专项资金资助项目(XJJ2016029)
摘 要:为了解决JPEG图像水印算法在嵌入容量、不可感知性、实时性和窜改定位方面的问题,提出了一种基于熵编码的JPEG压缩域脆弱图像水印算法。首先选择JPEG熵编码阶段进行水印嵌入,这样就可避免正向和逆向的DCT和量化运算,保证算法在嵌入阶段对图像的改变量较小且具有较好的实时性;接着根据熵编码过程中某些比特不会参与哈夫曼编码这一原则,在其中选择符合条件的系数嵌入水印,将水印信息嵌入到这些系数的最低有效位中,以规避修改哈夫曼编码系数后带来的编码误差,进一步加强了算法的透明性。实验表明,该算法不仅具有较大的嵌入容量和很好的不可感知性,而且脆弱性较高,能够对恶意窜改进行准确定位。In order to solve the problem of embedding capacity, imperceptibility, real-time and tampering localization in JPEG image watermarking algorithm, this paper proposed a JPEG watermarking algorithm based on entropy coding. Firstly, the algorithm located the process of JPEG entropy coding to embed the watermarking, which could avoid the forward and reverse quantization operations and ensured that during embedding image changes was small and had good real-time performance. Se- condly, according to the principle that some bits in the entropy coding process do not participate in the Huffman coding, the algorithm chose appropriate coefficient to embed watermark. This algorithm embedded watermarking information into the least significant bits of these coefficients to avoid the coding error caused by the modification of the Huffman coding coefficient, which should further enhance the imperceptibility of the algorithm. Experimental results show that the algorithm not only has a large embedded capacity and good imperceptibility, but also has high fragility and can accurately locate malicious tampering.
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.79