图学学报
圖學學報
도학학보
Journal of Graphics
2015年
3期
345-351
,共7页
数字水印%自嵌入%全盲检测%QR分解%剪切波变换
數字水印%自嵌入%全盲檢測%QR分解%剪切波變換
수자수인%자감입%전맹검측%QR분해%전절파변환
digital watermarking%self-embedding%perfectly blind detection%QR decomposition%shearlet transform
针对彩色图像的版权保护问题,基于 QR 矩阵分解提出了一种自嵌入全盲水印算法。先将原始图像的G通道分量进行非下采样剪切波变换,再对得到的低频分量分块QR分解,通过判断各子块R矩阵中第一行元素向量的l1范数与所有子块R矩阵第一行元素l1范数均值之间的大小关系生成特征水印。然后对B通道分量DWT变换后的低频分量进行分块QR分解,并通过修改该子块QR分解后R矩阵中第一行最后一列元素来嵌入特征水印。特征水印的生成和嵌入在两个通道内独立完成,水印检测无需原始载体图像,算法无需借助外加水印信息即可完成对图像版权的鉴别。实验结果表明,该算法在经历添加噪声、JPEG压缩、缩放、剪切和行偏移等常见攻击时,具有很强的鲁棒性。
針對綵色圖像的版權保護問題,基于 QR 矩陣分解提齣瞭一種自嵌入全盲水印算法。先將原始圖像的G通道分量進行非下採樣剪切波變換,再對得到的低頻分量分塊QR分解,通過判斷各子塊R矩陣中第一行元素嚮量的l1範數與所有子塊R矩陣第一行元素l1範數均值之間的大小關繫生成特徵水印。然後對B通道分量DWT變換後的低頻分量進行分塊QR分解,併通過脩改該子塊QR分解後R矩陣中第一行最後一列元素來嵌入特徵水印。特徵水印的生成和嵌入在兩箇通道內獨立完成,水印檢測無需原始載體圖像,算法無需藉助外加水印信息即可完成對圖像版權的鑒彆。實驗結果錶明,該算法在經歷添加譟聲、JPEG壓縮、縮放、剪切和行偏移等常見攻擊時,具有很彊的魯棒性。
침대채색도상적판권보호문제,기우 QR 구진분해제출료일충자감입전맹수인산법。선장원시도상적G통도분량진행비하채양전절파변환,재대득도적저빈분량분괴QR분해,통과판단각자괴R구진중제일행원소향량적l1범수여소유자괴R구진제일행원소l1범수균치지간적대소관계생성특정수인。연후대B통도분량DWT변환후적저빈분량진행분괴QR분해,병통과수개해자괴QR분해후R구진중제일행최후일렬원소래감입특정수인。특정수인적생성화감입재량개통도내독립완성,수인검측무수원시재체도상,산법무수차조외가수인신식즉가완성대도상판권적감별。실험결과표명,해산법재경력첨가조성、JPEG압축、축방、전절화행편이등상견공격시,구유흔강적로봉성。
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.