检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京航空航天大学计算机科学与技术学院,南京210016
出 处:《计算机与数字工程》2014年第1期129-133,共5页Computer & Digital Engineering
摘 要:传统的正交分形水印算法,很多情况下只是针对灰度宿主图像,且嵌入的水印多为随机序列或二值图像,实用性不强。当这些算法在处理彩色宿主图像时,通常采用的是将R,G,B三个分量单独处理的SFC方法,没能考虑到分量之间的相关性,因此算法的鲁棒性较弱。文提出一种在彩色图像中利用正交分形编码嵌入灰度水印的算法,该算法在对彩色宿主图像进行正交分形编码的基础上,考虑彩色图像R,G,B三个分量的相关性以及拼贴误差特性,通过变换函数以及修改分形编码参数来嵌入灰度水印。实验及应用表明,该算法隐蔽性强,并对剪切、涂抹、加噪以及JPEG压缩等具有较强的鲁棒性。In most cases,the orthogonal fractal watermark algorithm is designed for gray host image.Besides,the watermark which is embedded into the host image is always random sequence or a binary image.But most of images are always color in a real world scenario.In order to deal with the colored host image,the method SFC considers the three R,G,B components of a true color image separately.However,those methods ignore the correlation between the three components.In this paper,a new algorithm which is able to embed a grayscale watermark into the color image is proposed.The new algorithm which is based on orthogonal fractal coding method,takes into account the correlation among the three comments and the collage error characteristic.The watermark is embedded into the host inage by using transformation function and fractal coding parameters modification.Experiments show that the proposal algorithm is able to achieve a good perceptual invisibility.Moreover,it has strong robustness to some image processing such as cropping,scribbling,adding noise,filtering,and JPEG compression.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.224.136.160