Skip to content
naulon
Not checkedNot checked for notices yet.

Blind Image Watermark Decoder in UDTCWT Domain Using Weibull Mixtures-Based Vector HMT

Panpan Niu, Xin Shen, Tongtong Wei and 2 more

IEEE Access · 2020

doi:10.1109/access.2020.2978119 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

As one promising solution, digital watermarking has been proposed to resolve image copyright protection and content authentication, and has been applied successfully in many fields. Owing to their excellent description capability and invariance property, statistical models have become a popular tool for the image watermarking resulting in favorable trade-offs among imperceptibility, robustness and data payload. By modeling the robust undecimated dual tree complex Wavelet transform (UDTCWT) coefficient magnitudes with the Weibull mixtures based vector hidden Markov trees (HMT) and employing maximum likelihood (ML) test criterion, we propose a new image watermarking approach in UDTCWT domain in this paper. Our image watermarking approach consists of two parts, namely, embedding and extracting. In the embedding process, we compute the robust UDTCWT coefficient magnitudes with UDTCWT domain real/imaginary parts, and insert the digital watermark into the significant UDTCWT coefficient magnitude subband. In the extracting phase, robust UDTCWT coefficient magnitudes are firstly modeled by employing the Weibull mixture-based vector HMT, where the statistical properties of UDTCWT magnitudes are captured accurately. Then the expectation/conditional maximization (ECM) approach is introduced to estimate the statistical model parameters. Finally, an image watermark decoder for multiplicative watermarking is developed using the Weibull mixtures based vector HMT and ML test. The experiments show that the proposed method not only improves the imperceptibility, but also increases the robustness performance and outperforms state-of-the-art methods on a set of standard test images.

Abstract licence: CC BY-NC-ND

References30

    30 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.