Robust Watermarking against Lossy Compression in Hadamard Domain
Xuenan Cui, Jongweon Kim, De Li, Jong-Uk Choi · Journal of Internet Computing and services · 2007
In this proper, we proposes a robust watermarking against the lossy compression in the Hadamard domain. The Hadamard matrix consists of only 1 or -1 and can be computed veru fast. The Hadamrd transform has the inverse transform therefore it is able to be applied into the watermarking technology. In embedding process, we select 10 coefficients from intermediate frequency domain and create two watermark patterns. In extraction process, we use the watermark patterns and compare them to detect the watermark information. When we use the standard image () and binary watermark image (), the results of these examines are PSNR for and BER for . The JPEG QF between 30 and100, naked human eyes can detect to watermark image easily. The experimental results show that performance of Hadamard domain is better than those of DCT, FFT, and DWT.