p.3717
p.3723
p.3728
p.3735
p.3740
p.3744
p.3749
p.3754
p.3760
A Blind Watermarking Algorithm Research Based on Fast DCT
Abstract:
This article exploits a fast algorithm to watermark implant and extract, which first transform N×N(N=2n) 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.
Info:
Periodical:
Pages:
3740-3743
Citation:
Online since:
September 2013
Keywords:
Price:
Сopyright:
© 2013 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: