检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张天骐[1] 闻斌 吴超 熊天 ZHANG Tianqi;WEN Bin;WU Chao;XIONG Tian(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
机构地区:[1]重庆邮电大学通信与信息工程学院,重庆400065
出 处:《吉林大学学报(理学版)》2023年第3期592-600,共9页Journal of Jilin University:Science Edition
基 金:国家自然科学基金(批准号:61671095,61702065,61701067,61771085);信号与信息处理重庆市市级重点实验室建设项目(批准号:CSTC2009CA2003);重庆市自然科学基金(批准号:cstc2021jcyj-msxmX0836);重庆市教育委员会科研项目(批准号:KJ1600427,KJ1600429).
摘 要:针对彩色图像水印算法在滤波攻击下鲁棒性较差的问题,提出一种基于张量分解和联合熵的双彩色鲁棒水印算法.首先,将彩色载体图像整体进行张量分解得到其张量特征图并分块;然后,利用联合熵提取遮蔽性较好的特征图子块;最后,将水印信息嵌入到选定块经过奇异值分解(singular value decomposition,SVD)后的U矩阵中.实验结果表明,Lena图像峰值信噪比达39 dB以上,该算法不仅能有效抵抗图像的滤波攻击,NC值最高达1.0000,而且对其他常规图像攻击以及几何攻击也有较强的鲁棒性.Aiming at the problem of poor robustness of color image watermarking algorithms under filtering attacks,we proposed a dual-color robust watermarking algorithm based on tensor decomposition and joint entropy.Firstly,the color carrier image was tensor-decomposed as a whole to obtain its tensor feature map and divided into blocks.Secondly,joint entropy was used to extract the feature map sub-blocks with better shadowing.Finally,the watermark information was embedded into the[WTHX]U[WT]matrix of the selected block after singular value decomposition(SVD).The experimental results show that the peak signal-to-noise ratio of Lena images is more than 39 dB.The algorithm can not only effectively resist image filtering attacks,with a maximum NC value of 1.0000,but also has strong robustness against other conventional image attacks and geometric attacks.
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.141.25.1