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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
