会议专题

A Blind Watermarking Algorithm Research Based on Fast DCT

  This article exploits a fast algorithm to watermark implant and extract,which first transform N×N(N=2(*)) two dimension DCT into one dimension DCT with N numbers of points.And then the adopted algorithm implants watermark using matrix decomposition and masterly adjusting interrelation of DCT coefficients,thus to make the visual distortion to be minima after a watermark being implanted in the image,in addition,this method is a blind approach.The results indicate that the algorithm enjoy high image reducing property and robustness to several common attacks when ensuring invisibility of watermark.Finally,it is also superior to R-C,index-mapping like matrix cut algorithms and can also improve calculating speed,which make it possible to apply for image protection.

fast DCT 2D-DCT copyright protection DCT modulus

Siyu Lai Juan Wang

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

国际会议

2012 2nd International Conference on Computer and Information Applications(ICCIA2012)(2012第二届计算机和信息应用国际会议)

太原

英文

1589-1591

2012-12-08(万方平台首次上网日期,不代表论文的发表时间)