Robust quantisation index modulation‐based approach for image watermarking

Zareian, Mohsen; Tohidypour, Hamid Reza

doi:10.1049/iet-ipr.2013.0048

Cited by 27 publications

(20 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That is, separating matrix, W=A-1 can be easily got. Y, estimated value of independent data S, can be computed by (8):…”

Section: Figure 2 Framework Of Watermark Extractionmentioning

confidence: 99%

“…Frequency domain concentrates the whole image into some spectral coefficients where watermarks can be embedded, just like DCT, DWT and RT (ridgelet transform) [4]. DWT based image watermarking methods are presented by Chuntao Wang et al [5], N. Bi et al [6], D. Kundur et al [7], Mohsen Zareian et al [8] and V. Sentthil et al [9]. It is widely accepted that the frequency domain methods can easily exploit the perceptual models based on characteristics of the human visual system (HVS) to match the best tradeoff between invisibility and robustness [10].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Robust Digital Watermarking Scheme Based on Bandelet and Image Fusion

Li¹,

Ma²

2016

IJMUE

View full text Add to dashboard Cite

show abstract

“…That is, separating matrix, W=A-1 can be easily got. Y, estimated value of independent data S, can be computed by (8):…”

Section: Figure 2 Framework Of Watermark Extractionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Robust Digital Watermarking Scheme Based on Bandelet and Image Fusion

Li¹,

Ma²

2016

IJMUE

View full text Add to dashboard Cite

show abstract

“…4 over more than 1,500 8-bit gray-scale photographic images ( [27] and [33] combined). With a modulation separation A varying from 0.5 to 5, the true distortion obtained empirically and the distortion predicted by (39) are shown in Fig. 4 for both arbitrary carrier and optimal carrier cases.…”

Section: M-pam Ss Embedding With Precodingmentioning

confidence: 99%

“…Data embedding can be performed either directly in the time/spatial domain [5,9,17,23,32] or in a transform domain (for example, for images, we may consider full-frame discrete Fourier transform (DFT) [3,4,7], block DFT or DCT [2,15,26,30,39], or discrete wavelet transforms (DWT) [24,25,37]). …”

Section: Introductionmentioning

confidence: 99%

Optimal M-PAM Spread-Spectrum Data Embedding with Precoding

Liu

Guo

et al. 2015

Circuits Syst Signal Process

View full text Add to dashboard Cite

We consider M-level pulse amplitude modulation (M-PAM) spreadspectrum (SS) data embedding in transform domain host data. The process of data embedding can be viewed as delivering information through the channel including additive interference from host that is known to the embedder. We first utilize the knowledge of second-order statistics of host to design optimal carrier that maximizes the signal-to-interference-plus-noise ratio at the decoder end. Then, inspired by Tomlinson-Harashima precoding used in communication systems, a symbol-bysymbol precoding scheme is developed for M-PAM SS embedding to alleviate the impact of the interference which is explicitly known to embedder. For any given embedding carrier and host data, we aim at designing precoding algorithm to minimize the receiver bit error rate (BER) with any given host distortion budget, and conversely minimize the distortion at any target BER. Experimental studies demonstrate that the proposed precoded SS embedding approach can significantly improve BER performance over conventional SS embedding schemes.

show abstract

“…Also, the algorithm attaches only binary watermark images and it became computationally inefficient, since it used vector quantization algorithm for the optimization of adaptive quantization parameters, while indexing the blocks. Many other algorithms (Bhosale et al, 2012;Chen et al, 2012;Coatrieux et al, 2012;Ishikawa et al, 2012;Kandpal et al, 2012;Vargas et al, 2013;Varghese et al, 2014;Walia et al, 2013;Wang et al, 2011;Wang et al, 2012;Wu et al, 2005;Yang et al, 2010;Zareian et al, 2013) also developed in the literature by meeting some requirements of watermarking, but these algorithms also failed in simultaneously meeting other vital requirements of watermarking (Mason et al, 2000) including perceptibility, robustness, orthogonality, protection against attacks etc.…”

Section: Introductionmentioning

confidence: 99%