z-logo
open-access-imgOpen Access
Heteroscedastic watermark detector in the contourlet domain
Author(s) -
Amirmazlaghani Maryam
Publication year - 2019
Publication title -
iet computer vision
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.38
H-Index - 37
eISSN - 1751-9640
pISSN - 1751-9632
DOI - 10.1049/iet-cvi.2018.5254
Subject(s) - heteroscedasticity , watermark , contourlet , robustness (evolution) , detector , autoregressive conditional heteroskedasticity , autoregressive model , digital watermarking , artificial intelligence , pattern recognition (psychology) , computer science , mathematics , generalized normal distribution , algorithm , statistics , image (mathematics) , econometrics , normal distribution , wavelet transform , volatility (finance) , wavelet , biochemistry , chemistry , telecommunications , gene
A new contourlet domain image watermark detector is proposed in the present study. As the performance of the detector completely depends on the accuracy of the statistical model, the contourlet coefficients and statistical properties are studied first. The heavy‐tailed distribution and heteroscedasticity of these coefficients are demonstrated in this study. These characteristics cannot be captured simultaneously by the models, which are proposed previously. A two‐dimensional generalised autoregressive conditional heteroscedasticity (2D GARCH) model is suggested to overcome this problem. Dependencies of the contourlet coefficients can be explained by the efficient structure provided by this model. A 2D GARCH model‐based contourlet domain watermark detector is designed and its performance analysed by computing the receiver operating characteristics. The high accuracy of the proposed detector, its robustness under several types of attacks, and its outperformance compared to alternative watermarking methods are verified by the obtained experimental results.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here