Scalable watermark extraction for real-time authentication of JPEG 2000 images

Abstract

This paper proposes a novel scalable authentication scheme that utilizes the progressive enhancement functionality in JPEG 2000 scalable image coding. The proposed method first models the wavelet-based quality scalable coding to identify the effect of the quantization and de-quantization on wavelet coefficient magnitudes and the data embedded within such coefficients as a watermark. A relationship is then established between the watermark extraction rule and the embedding rule, using the magnitudes of the reconstructed and original coefficients. It ranks the wavelet coefficients according to their ability to retain the embedded watermark data intact under various quantization levels corresponding to quality enhancements. Then watermark data is embedded into wavelet coefficients according to their rank followed by JPEG 2000 embedded coding. At the decoder as more and more quality and resolution layers are decoded the authentication metric is improved, thus resulting in gradually increasing complexity of the authentication process according to the number of quality and resolution enhancements. The low complexity authentication is available at low quality low resolution decoding, enabling real-time authentication for resource constrained applications without affecting the authentication metric. Compared to the existing methods, the proposed method results in highly robust scalable authentication of JPEG 2000 coded images.

On robustness against JPEG2000: a performance evaluation of wavelet-based watermarking techniques

“…This is mainly due to the efficiency in the coefficient selection method, enabling to choose a higher value for the watermark strength parameter, yet resulting in distortion performance in the specified range. Additionally a choice of coefficients in high frequency subbands can be robust to compression [34,43] while providing higher imperceptibility. However, at a higher compression ratio, BER values (Hamming distance) of high frequency based watermarking schemes (refer to Fig.…”

“…For example, while it is general convention that high-frequency sub-band based watermarking offer high imperceptibility and less robustness to compression. However literature [34] proposed that not all high frequency coefficients are vulnerable to compression while not all low frequency coefficients are robust to compression. In this case the performance evaluation with any other existing method is very difficult unless compared under a common platform.…”

A Maximum Entropy-Based Chaotic Time-Variant Fragile Watermarking Scheme for Image Tampering Detection

“…In order to address this issue, we have researched some of the published works on fragile watermarking [2][3] procedures based on schemes for image authentication [4]. A robust image watermarking scheme usually embeds a watermark into an original image.…”

Quality Scalability Aware Watermarking for Visual Content

“…Often the same watermarking algorithms have been naively extended to propose watermarking algorithms robust against scalable content adaptation attacks, e.g., JPEG2000. Example of such image watermarking algorithms e.g., [7], [11]- [15], [24]- [30]. As the discrete wavelet transform (DWT) is the underlying technology of the JPEG2000 compression standard, we consider the watermarking schemes that use wavelet-based techniques in addition to the algorithms mentioned above.…”

“…This work addresses the tow-fold problem of 1) obtaining the least distortion at a given watermark embedding rate and 2) achieving the best robustness in a scalable fashion by hierarchically encoding lower and higher embedded distortion-robustness atoms, respectively. In designing the algorithm, we have considered the propositions for embedding distortion, i.e., in order to minimize the distortion, the coefficient modification must be minimized; and the concept of bit plane discarding model [30] to emulate scalable content adaptation for improving the robustness against quality scalable content adaptation. The main contributions of this work are as follows:…”