Abstract

This paper proposes a blind robust watermarking algorithm based on the quantization of significant DWT coefficients. Low frequent wavelet coefficients of the host image are randomly permutated into sub-groups firstly. To guarantee watermark robustness while preserving good fidelity, watermarking modifications are distributed on the maximum positive and minimum negative coefficients of each group which preserve the most significant local amplitudes. The difference between two largest positive (or smallest negative) coefficients is quantized to an even or odd multiple of a quantization step parameter Q according to the watermark bit to be embedded. The blind watermark extraction could be straightforwardly achieved by checking the parity of the quotient between significant differences and Q. Comparison experiments with existing methods demonstrate the superiority of our scheme on robustness against content-preserving operations and incidental distortions such as JPEG compression, Gaussian noise.

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 call

Disclaimer: 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.