检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆大学数理学院,重庆400030
出 处:《计算机工程与应用》2008年第10期91-94,共4页Computer Engineering and Applications
基 金:重庆市科委自然科学基金计划资助项目(No.CSTC,2007BB2123)
摘 要:改进了一个分形水印算法,它把二值版权图标嵌入到分形压缩的图像文件中。具体说,把宿主图像分成大小相同的不重叠的子块,对这些子块进行分形编码(采用正交分形编码方法)。这些子块按拼贴误差的大小进行降序排列,并根据宿主图像内容分成三个子列。按照新的量化嵌入公式,经Arnold变换置乱后的水印被强度不同地嵌入三个子列的子块的量化均值中,通过分形解码得到含水印图像。实验表明,该算法隐蔽性强,并对剪切、涂抹、加噪、滤波以及JPEG压缩等具有较强的鲁棒性。A watermarking algorithm proposed by Pi et al is improved in order to embed a binary copyright symbol into a host image.In detail,the host image is first divided into non-overlapping range blocks of fixed size,which are encoded by fractal coding(using orthogonal fractal coding method ).The range blocks are then sorted by collage errors to become a descending range sequence.The range sequence is partitioned into three subsequences according to the content of the host image.Next,the watermark,which is first scrambled using Arnold transform,is embedded into the quantized means of distinct range blocks in the three range subsequences by a new quantization-based embedding formula with different quantized steps,followed by fractal decoding.The experimental resuhs show that this algorithm really achieves good perceptual invisibility and is also very robust against some image processing such as cropping,scribbling,adding noise,filtering,and JPEG compression.
分 类 号:TN919.81[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.229.54