计算机应用与软件
計算機應用與軟件
계산궤응용여연건
COMPUTER APPLICATIONS AND SOFTWARE
2014年
11期
307-311
,共5页
史宝明%贺元香%萧萍%李岚
史寶明%賀元香%蕭萍%李嵐
사보명%하원향%소평%리람
数字水印%SURF特征点%斜变换%奇异值分解%几何攻击
數字水印%SURF特徵點%斜變換%奇異值分解%幾何攻擊
수자수인%SURF특정점%사변환%기이치분해%궤하공격
Digital watermark%SURF feature point%Slant transformation%Singular value decomposition%Geometrical attack
为了提高水印算法的抗几何攻击能力,提出一种基于图像特征的彩色图像水印算法。首先利用加速鲁棒性特征SURF ( Speed-Up Robust Features)算法提取出图像中稳定的特征点,并为其构造SURF特征描述算子,使提取出的特征点具有尺度不变性;然后根据特征尺度的自适应性获得局部特征区域并对其进行归一化处理;之后对局部特征区域进行斜变换,并获得其中频系数;最后结合奇异值分解SVD( Singular Value Decomposition)算法完成水印的嵌入。实验结果表明,嵌入水印后的图像在经过噪声以及几何攻击后,其提取的水印与原水印仍具有较高的相似度,该算法具有较好的鲁棒性。
為瞭提高水印算法的抗幾何攻擊能力,提齣一種基于圖像特徵的綵色圖像水印算法。首先利用加速魯棒性特徵SURF ( Speed-Up Robust Features)算法提取齣圖像中穩定的特徵點,併為其構造SURF特徵描述算子,使提取齣的特徵點具有呎度不變性;然後根據特徵呎度的自適應性穫得跼部特徵區域併對其進行歸一化處理;之後對跼部特徵區域進行斜變換,併穫得其中頻繫數;最後結閤奇異值分解SVD( Singular Value Decomposition)算法完成水印的嵌入。實驗結果錶明,嵌入水印後的圖像在經過譟聲以及幾何攻擊後,其提取的水印與原水印仍具有較高的相似度,該算法具有較好的魯棒性。
위료제고수인산법적항궤하공격능력,제출일충기우도상특정적채색도상수인산법。수선이용가속로봉성특정SURF ( Speed-Up Robust Features)산법제취출도상중은정적특정점,병위기구조SURF특정묘술산자,사제취출적특정점구유척도불변성;연후근거특정척도적자괄응성획득국부특정구역병대기진행귀일화처리;지후대국부특정구역진행사변환,병획득기중빈계수;최후결합기이치분해SVD( Singular Value Decomposition)산법완성수인적감입。실험결과표명,감입수인후적도상재경과조성이급궤하공격후,기제취적수인여원수인잉구유교고적상사도,해산법구유교호적로봉성。
To improve the ability of watermarking algorithm in resisting geometrical attacks, we propose an image feature-based watermarking algorithm for colour images.First, it uses Speed Up Robust Features ( SURF) algorithm to extract steady feature points in the image, and constitutes SURF feature description operator for it, which makes the extracted feature points have scale invariance;Secondly, it obtains local feature region according to the adaptivity of the feature scale and normalises it;Then the algorithm applies slant transformation on local feature region, and gets the frequency coefficient in it; Finally, it completes the watermark embedding by combining singular value decomposition (SVD) algorithm.Experimental results show that the image with the watermark embedded still has higher similarity of its extracted watermark to the original one’ s after suffering the noise and geometrical attacks, this algorithm has quite good robustness.