欢迎访问《图学学报》 分享到:

图学学报

• 图形学与可视化 • 上一篇    下一篇

基于QR 分解的彩色图像自嵌入全盲水印算法

  

  • 出版日期:2015-06-24 发布日期:2015-06-29

Self-Embedding Perfectly Blind Watermarking Algorithm Based on QR Decomposition for Color Images

  • Online:2015-06-24 Published:2015-06-29

摘要: 针对彩色图像的版权保护问题,基于QR 矩阵分解提出了一种自嵌入全盲水印算
法。先将原始图像的G 通道分量进行非下采样剪切波变换,再对得到的低频分量分块QR 分解,
通过判断各子块R 矩阵中第一行元素向量的l1 范数与所有子块R 矩阵第一行元素l1 范数均值之
间的大小关系生成特征水印。然后对B 通道分量DWT 变换后的低频分量进行分块QR 分解,
并通过修改该子块QR 分解后R 矩阵中第一行最后一列元素来嵌入特征水印。特征水印的生成
和嵌入在两个通道内独立完成,水印检测无需原始载体图像,算法无需借助外加水印信息即可
完成对图像版权的鉴别。实验结果表明,该算法在经历添加噪声、JPEG 压缩、缩放、剪切和行
偏移等常见攻击时,具有很强的鲁棒性。

关键词: 数字水印, 自嵌入, 全盲检测, QR 分解, 剪切波变换

Abstract:

A novel self-embedding perfectly blind watermarking algorithm is proposed based on QR
matrix decomposition for copyright protection of digital color images. At first, G channel component of
the original image is performed with non-subsampled shearlet transform, then the low-frequency
component is performed with block-QR decomposition, the feature watermark is derived by judging the
number relationship between vector l1 norm from the first row elements of each sub-blocks R-matrix
and the mean of vector l1 norms from the first row elements of all sub-blocks R-matrix. Secondly, the
low-frequency component is obtained after DWT from B channel of original image, then it is performed
with block-QR decomposition. The feature watermark is embed by modifying the first row and the least
column element of the R-matrix from every blocks. The generation and embedding of feature
watermark are done in two channels independently, the watermark can be detected without the original
image, and the algorithm can identify an image without the additional watermark information.
Experimental results show that the proposed algorithm has strong robustness to resist various common
attacks such as adding noise, JPEG compression, scaling, cropping and row shifting.

Key words: digital watermarking, self-embedding, perfectly blind detection, QR decomposition;
shearlet transform