Abstract
This paper proposes a blind image watermarking scheme using wavelet trees quantization. The largest two coefficients in a wavelet tree are called significant coefficients and the difference between them is called significant difference. We embed a watermark bit by comparing the significant difference with an average significant difference value, and the maximum coefficients are quantized. So there exists a large magnitude difference between the maximum coefficients and the second maximum coefficients after watermark embedding, which can be used for blind extracting watermark. As a result, the watermarked image looks lossless comparing with the original image. Moreover, by designing an adaptive threshold in the extracting process, our method can effectively resist common image processing attacks such as JPEG compression, media filtering, Gaussian noise, cropping, sharpening, histogram equalization and so on, and it has a good transparency.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have