会议专题

A Blind Watermarking Algorithm Research Based on Fast DCT

This article exploit a fast algorithm to conduct watermarking implant and extract,which transform N×N (N=2n) two Dimension DCT into N numbers of N-points one Dimension DCT.And the adopted algorithm implant watermarking using matrix decomposition and masterly adjusting interrelation of DCT coefficients,thus to make the visual distortion to be less after a solid watermarking being implanted in the image and this method is a blind watermarking protection approach.The result indicates that this algorithm enjoy a high image reducing property and robustness to several common attacks when ensuring invisibility of watermarking.Therefore,it is also superior to R-C,index-mapping like matrix cut algorithm and can also improve caculate speed which make it possible to apply for image protection.

fast DCT 2D-DCT copyright protection DCT modulus

Wang Juan Lai Siyu

Department of Computer Science China West Normal University NanChong,China Department of Medical Image North Sichuan Medical College NanChong,China

国际会议

2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

太原

英文

126-129

2011-02-26(万方平台首次上网日期,不代表论文的发表时间)