A Blind Watermarking Algorithm Research Based on Fast DCT
- 10.2991/iccia.2012.395How to use a DOI?
- fast DCT, 2D-DCT, copyright protection, DCT modulus
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.
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Siyu Lai AU - Juan Wang PY - 2014/05 DA - 2014/05 TI - A Blind Watermarking Algorithm Research Based on Fast DCT BT - Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012) PB - Atlantis Press SP - 1589 EP - 1591 SN - 1951-6851 UR - https://doi.org/10.2991/iccia.2012.395 DO - 10.2991/iccia.2012.395 ID - Lai2014/05 ER -