- Research Article
- Open Access
High-Rate Data-Hiding Robust to Linear Filtering for Colored Hosts
EURASIP Journal on Information Security volume 2009, Article number: 914937 (2009)
The discrete Fourier transform-rational dither modulation (DFT-RDM) has been proposed as a way to provide robustness to linear-time-invariant (LTI) filtering for quantization-based watermarking systems. This scheme has been proven to provide high rates for white Gaussian hosts but those rates considerably decrease for nonwhite hosts. In this paper the theoretical analysis of DFT-RDM is generalized to colored Gaussian hosts supplied with an explanation of the performance degradation with respect to white Gaussian hosts. Moreover the characterization of the watermark-to-noise ratio in the frequency domain is shown as an useful tool to give a simple and intuitive measure of performance. Afterwards an extension of DFT-RDM is proposed to improve its performance for colored hosts without assuming any additional knowledge on the attack filter. Our analysis is validated by experiments and the results of several simulations for different attack filters confirm the performance improvement afforded by the whitening operation for both Gaussian colored hosts and audio tracks.
Quantization index modulation (QIM)  is a wide class of watermarking methods which are proven to yield optimum performance in additive white Gaussian channels without downgrading the host signal fidelity. The main drawback of quantization-based schemes is their sensitivity to valumetric distortions; these attacks vary the amplitude of the watermarked signal so that, even if they do not usually reduce the perceived quality of the media, the produced mismatch between encoder and decoder lattice volumes severely increases the bit-error rate (BER). Consequently, a great effort has been spent by researchers in developing quantization-based methods robust to valumetric distortions and the problem can be considered somewhat solved by different approaches, that is, [2–4].
Linear-time-invariant (LTI) filtering attack is in some sense related to valumetric distortions; in spite of the simplicity and wide use of filtering in signal processing, literature about this attack for quantization-based schemes is scarce. This is even more dramatic since basic quantization-based schemes are not able to cope with filtering attacks; in fact it has been proven that by cutting away with a lowpass filter only one percent of the signal spectrum, the resulting BER for binary time-domain Dither Modulation (DM) is already .
Apart from the work done by Wang et al. , where the decoder is assumed to have some information about the attack filter and the maximum-likelihood criterion is used to estimate the frequency gain, the LTI filtering attack has been addressed only in . In that work, it is proposed an extension of the rational dither modulation (RDM) scheme , which is robust to LTI filtering without assuming any prior knowledge about the attack filter. The main idea relies on the amplitude scaling invariance of RDM and on the convolution theorem , so that an RDM-like channel is constructed on a subset of the frequency channels in the discrete Fourier transform (DFT) domain. Analytical and experimental results in  demonstrate that a high-rate can be reached for white Gaussian hosts, but experiments carried out with audio signals have shown a severe loss of performance for nonstationary, non-Gaussian, and colored hosts. On the other hand, the analysis developed in  is focused uniquely on white Gaussian hosts, so that it cannot be straightforwardly used to justify the experimental results obtained for nonwhite hosts.
In this paper the behavior of DFT-RDM for Gaussian colored hosts is investigated. By modeling the colored host with an autoregressive (AR)  random process, the analysis of DFT-RDM is generalized, providing an explanation for the loss of performance with respect to white Gaussian hosts. This is essentially due to the combination of two facts: () the power of an RDM watermark signal is proportional to the host signal power, and () the influence of the nonflat power spectral density (psd) of the host on the self-noise that in turn is due to a block-DFT operation. Moreover, we introduce the per-channel watermark-to-noise ratio (WNR) as a simple measure to evaluate the reliability of each RDM-like channel.
We also propose an extension of DFT-RDM that improves performance in the case of colored hosts under the hypotheses of a blind watermarking scheme and total ignorance about the attack filter both at the embedder and the decoder. In such case, low error probabilities are obtained by performing DFT-RDM embedding and decoding after a whitening operation, without any penalty in terms of embedding distortion and payload.
The paper is organized as follows. In Section 2 some notations are introduced while DFT-RDM is revised in Section 3. The behavior of DFT-RDM with a Gaussian colored host is analyzed in Section 4 and in Section 5 the proposed extension of DFT-RDM is presented. Numerical simulations that validate the developed analysis and show the performance of the proposed approach are given in Section 6; finally in Section 7 some conclusions are drawn.
We assume 1D real-valued hosts arranged in vectors, which are denoted by boldface letters, so that is a vector and is its th element. As customary in data-hiding applications, if the vector is the host signal, after the watermark embedding the watermarked signal is denoted by and the watermark signal is by definition . The vector denotes the samples received by the decoder at the channel output.
Uppercase letters will be used for random variables, that is, is a random variable modeling the th sample of the host signal, and is the random process related to the whole sequence . Finally, to denote a variable in the DFT domain, the tilde will be used, so that the random variable is the th coefficient of the DFT computed on the th block of the host signal. Similarly, if is the impulse response of a real-valued LTI filter, denotes its Fourier transform so that we have .
Finally, for zero-mean hosts we define the document-to-watermark ratio (DWR) as the ratio between the host signal variance and the embedding distortion , which is the average power of the watermark signal, as customary.
3. Review of DFT-RDM
The discrete Fourier transform-rational dither modulation (DFT-RDM) method has been proposed in  to counteract linear-time-invariant (LTI) filtering. This scheme is based on RDM , which is a high-rate quantization-based data-hiding method invariant to amplitude scaling, and on the convolution theorem , which allows to represent the filter output as a multiplication in the Fourier domain of the input signal and the filter response.
In a real application DFT-RDM uses the discrete Fourier transform in a block-by-block basis instead of the full-sequence Fourier transform , which would be impractical due to its computational complexity and the memory required by RDM. In the adopted framework the exact multiplication in the DFT domain would only be achieved with a circular convolution, whereas the filtered signal is obtained through an ordinary convolution. As a consequence, the effect of filtering on each DFT channel cannot be modeled by a pure scaling, but a host-dependent error has to be considered too.
Assuming nonoverlapping DFT blocks of length , let be the th block of the host signal and the th coefficient of the DFT of such block:
The information bits are embedded into the absolute value of the DFT coefficients, taking care in preserving the symmetry of the DFT for real signals. Essentially, on each of the first discrete frequencies an RDM-like channel is constructed so that the absolute value of the watermarked signal is
where and . The phase of is set equal to the phase of so that the embedding distortion is minimized; in order to preserve symmetry, the remaining DFT coefficients are updated according to the rule for , where the superscript * denotes the complex conjugate. The watermarked signal is then mapped back into the original domain through a nonoverlapping block-by-block inverse DFT of the marked coefficients:
Due to the orthogonality of the DFT, the DWR in the DFT domain is identical to that in the time domain. Hence DFT-RDM inherits from the standard RDM the relations between quantization step-size, power of the watermark signal and DWR. It is worth noting that all the RDM-like channels use the same quantization step-size, which is computed from the knowledge of the target overall DWR.
At the decoder, with denoting the th block of the received signal, the relative DFT coefficients are computed and the standard RDM decoder is then applied to estimate the embedded information bits. Assuming , under the hypothesis of sufficiently large to approximate an ordinary convolution, we have , from which the RDM decoder is able to recover the correct information bits. The whole embedding/decoding block scheme is shown in Figure 1.
Due to the effects of the circular convolution, the random variable representing the th received DFT coefficient can be written as , where models the deviation from a pure multiplication (which would correspond to full-length DFTs) and so it will be referred to as per-channel multiplication error. Under the hypothesis of large DWR and using the filter-bank interpretation of the DFT , this term can be expressed as
where is given by
and, by definition, for and is zero otherwise, with denoting the Kronecker's delta. Here represents the impulse response of the th DFT basis function multiplied by a window whose purpose will be made clear shortly. Hence, from (4) and (5) it can be seen that the per-channel multiplication error is strictly dependent on both the filter coefficients and the host signal. Let be a zero-mean white process with variance , then the process can be assumed stationary as discussed in , and so will approximately have zero mean and variance:
where is the Fourier transform of the window .
To reduce the error probability, in  two improvements have been proposed: windowing and spreading. The former entails multiplying the block by a properly designed window before computing the DFT coefficients at the price of an increased peak-to-average distortion. The latter amounts to adding length- blocks and then applying the DFT-RDM embedding on samples. By spreading, the robustness against filtering is increased while the payload is reduced by a factor of .
Full details on DFT-RDM and its performance can be found in , where guidelines are provided for the case of white Gaussian hosts to assist the designer in the parameter selection that leads to acceptable BER values. Unfortunately, the results of some experiments with audio signals (which are nonstationary, non-Gaussian and colored hosts) reported in  show a considerable increase of the BER with respect to white Gaussian hosts using the same system parameters.
4. Performance Analysis for Colored Gaussian Hosts
In this section the analysis of DFT-RDM is extended to colored hosts using a frequency-domain approach and introducing some new tools. As shown in Section 6, and similarly to the experimental results for audio signals reported in , if a watermark is embedded in a colored host using DFT-RDM and then filtered with a conventional audio equalizer, the measured BER is noticeably greater than the BER for a white host using the same system parameters. The rationale for this behavior can be found in the inner working of DFT-RDM, which is essentially an RDM-like scheme for every DFT channel, and in the influence of a nonflat psd on the per-channel multiplication error. In  this error was characterized in the time domain; in contrast, we pursue here a frequency-domain approach, which is needed to separate each RDM-like channel and will lead to a somewhat simpler expression. However, the main novelty of our analysis lies in the usage of the per-channel watermark-to-noise ratio (WNR), which is a very convenient and intuitive measure that is directly related to the BER.
To better understand the behavior of DFT-RDM for audio signals, we have focused on colored Gaussian hosts modeled by an Autoregressive (AR) random process . Hence, given a zero-mean white Gaussian host with psd , the colored host can be regarded to as the output of an all-pole filter excited by . The host power spectral density can then be written as
The idea is to work with a colored host whose psd resembles that of a generic audio signal, which typically has most of its power concentrated at lower frequencies. Hereinafter for colored hosts we will assume an AR signal which models the spectral contents of this generic audio signal.
We are interested in evaluating the performance (as measured by the BER) on each DFT channel; to this end, we will rely on the watermark-to-noise ratio (WNR). It is very important to remark that while the WNR is usually defined as the ratio between the powers of the watermark signal and the attack noise, since in our framework the only impairment is the filtering, we will define the per-channel WNR as the ratio between the power of the watermark signal and that of the multiplication-error for each frequency channel:
where denotes the statistical expectation.
As a first step towards obtaining the per-channel WNR, the per-channel host power in the DFT domain has to be derived. To this aim, the filter-bank interpretation of the DFT  can be adopted, according to which it is possible to get
The variance of the zero-mean process is given by and can be computed by applying Parseval's relation, so that we have
According to the corresponding relation in  and for in the function, after the RDM embedding, the per-channel watermark signal power is
where the quantization step-size is set to have a watermarked signal with the desired DWR. Since the per-channel watermark signal power is proportional to the per-channel host power because of the properties of RDM, a larger watermark signal originates from those host DFT channels having stronger spectral contents. Hence, in the lower frequencies of an audio-like colored host, the per-channel watermark signal will be much larger than the corresponding to higher-frequencies. This shaping of the per-channel watermark power alters the behavior of DFT-RDM with respect to that of a white Gaussian host, where the per-channel watermark power is uniform, as analyzed in .
On the other hand, the spectral shaping of the host influences also the per-channel multiplication error, which for high DWRs can be approximated by , as it has been explained in Section 3.
Recalling (6) and assuming reasonably the stationarity of , its variance can be written as
The watermark-to-noise ratio can be useful to infer whether the RDM channel is able to correctly convey the information bits, because the probability of the error approaches when the power of the watermark signal is approximately equal to that of the additive noise. Thus, the per-channel WNR is computed as the ratio between (11) and (12):
To easily understand the influence of the spectral shaping of the host on the WNR, it is useful to approximate the per-channel host power as
By this approximation, which is valid only in the case of a rectangular window, the effects of computing the DFT on finite-length blocks are neglected. Consequently, the WNR can be approximated as follows:
If the host signal is white, then the ratio is equal to for every and consequently depends only on the attack filter; if the host is colored, this ratio is a function which has great variations for the different channels thus affecting heavily . As shown in Figure 2, because of the high-pass behavior of , for corresponding to the high-frequency channels, the function takes values much larger than those corresponding to low frequencies. Therefore, the spectral shaping of the host yields less robustness in high-frequency channels compared to low-frequency channels; however, strictly speaking, the per-channel WNR also depends on the attack filter, as is evident from (15).
In  the per-channel bit-error probability has been derived analytically relying on the results in , where the bit-error probability of an RDM channel is derived for i.i.d. host samples and additive noise independent of the host signal. If denotes the bit-error probability of classical RDM, with the effective signal-to-noise ratio, the bit-error probability of the th channel of DFT-RDM is
where is the magnitude of the per-channel multiplication error projected onto ; see .
An upper bound for the bit-error probability was also provided in . Since the bound is always verified for every , the upper bound can be computed by substituting in (16) by the standard deviation of the per-channel multiplication error . Refer to  for more details on the analysis.
The upper bound formula allows to link directly the per-channel and the per-channel bit-error probability. In fact, according to (11), we can substitute into (16) and using the bound we have
If this analytical model is applied to colored hosts, the predicted error probabilities will be only an approximation of the actual BERs. The inaccuracy of the analytical model is expected to be noticeable for those DFT channels whose is more correlated with the neighboring channels; in this case, the per-channel multiplication error will increase due to the leakage from those host samples at adjacent channels. To evaluate the correlation between the th channel and the th channel, the correlation coefficient can be employed. Using the approximate expression of the per-channel host power we can write
The analysis carried out here for DFT-RDM and colored hosts gives a first explanation of the experimental results that were given in  for DFT-RDM applied to audio signals.
5. Whitening and DFT-RDM
From the analysis of DFT-RDM for colored hosts developed in Section 4, any colored host will have unavoidably different watermark signal powers for different DFT channels; consequently, there will be some DFT channels more exposed than others to the per-channel multiplication error, as it has been explained above. Assuming that neither the embedder nor the decoder has any prior knowledge about the attack filter, it is reasonable to embed in every DFT channel with the same watermark power. Clearly, this choice does not assure the best BER for every attack filter but it is a trade-off to have a good BER even if the attack filter is unknown. The optimum would be to shape the per-channel watermark power so that it is larger in those DFT channels which are less modified by the attack filter, but this assumes prior knowledge; so we have decided not to follow this path.
On the other hand, according to , if the host signal is white, the per-channel multiplication error is approximately independent on both the host and the watermark signal, so the correlation between neighboring channels, which usually leads to higher per-channel error probabilities, becomes small.
These considerations lead to whiten the host signal and use the same embedding power on every DFT channel. The idea is then to perform the DFT-RDM embedding in the host signal obtained as the output of a whitening filter excited by the colored host . Hereinafter the superscript is used to denote signals which are obtained by whitening. After the embedding, the watermarked signal is filtered by the inverse of the whitening filter to reshape the signal, as shown in Figure 3, where the whole block scheme is depicted. At the decoder side the received host signal feeds the whitening filter and from the obtained signal the DFT-RDM decoder recovers the estimated hidden message.
In this section we will assume that the host is an AR random signal which is generated as described in Section 4 by the all-pole filter . If the whitening filter is equal to , then we have , which is a white Gaussian host with power spectral density by construction of the colored signal. After DFT-RDM embedding, the watermarked signal can be expressed as . Since DFT-RDM embedding is performed on the white signal , the resulting watermark signal can be also assumed to be white and uncorrelated with the host signal from the properties of DFT-RDM. Consequently, the reconstruction filter shapes both the host and watermark signal in the same way, so that their power spectral densities have approximately the same trend, as it is shown in Figure 4.
Moreover, given the whiteness of the watermark signal and the superposition principle, the overall DWR is not changed by the reconstruction filter:
and it is approximately equal to the DWR measured on each DFT-RDM channel, as expected according to (11). Thus, even if DFT-RDM is applied to the host signal after whitening, the relation between the overall DWR and is the same as in DFT-RDM, as described in . From this it can be inferred that DFT-RDM with whitening does not incur in any penalty in terms of embedding distortion with respect to DFT-RDM, which is a desirable property of the proposed extension.
At the decoder side, after the whitening filter , we have ; hence the white watermarked signal goes through an equivalent channel where there is only the attack filter. Consequently, even if the host is colored, using the above proposed scheme we expect the same performance as for DFT-RDM applied to a white host for the same attack filter and the same system parameters.
We have tested the above presented scheme with audio signals. Since audio signals are nonstationary and the whitening filter is the inverse of an AR filter which resembles the spectral contents of a generic audio signal, we can no longer expect to be really a white signal. However, will usually have a per-channel host power more evenly distributed than the original host.
6. Experimental Results
Some experiments are here presented to validate the analysis carried out in Section 4 and to verify the effectiveness of DFT-RDM applied to colored hosts after a whitening filtering. In all the experiments the DWR was set to 25 dB, in the function the memory was set to and was set to . An AR model with order is assumed in all the experiments. Unless otherwise specified, we assume that the DFT length is and that neither spreading nor windowing is used.
The colored host signal is the output of an all-pole filter whose coefficients have been obtained by AR modeling of several audio tracks in order to resemble the power spectral density of a generic (average) audio signal; Figure 5 represents the magnitude of the frequency response of the filter that has been used in the subsequent simulations.
Figure 6 illustrates the per-channel watermark signal power; while the matching between the experimental results and the analytical values obtained substituting (10) in (11) is excellent, a mismatch in the high-frequency channels is apparent when using in (11) the approximate formula (14) for the per-channel host power.
In order to verify the existing correlation between channels for colored hosts, the magnitude of the correlation coefficient has been evaluated on the watermarked signal according to (18).
First, we plot in Figure 7 the magnitude of the correlation coefficient for several DFT channels when the watermarked signal is white Gaussian. As it can be verified, the correlation between neighboring channels is very small for all , with . Obviously, for we have , since the correlation coefficient corresponds to the normalized autocorrelation.
In contrast, for a colored host the correlation coefficient is strictly dependent on the selected channels, as it is evident in Figure 8. As expected from (18) for a high-pass filter , the correlation between two low-frequency neighboring channels is quite small, while it noticeably increases when neighboring higher-frequency pairs are considered. Since the analytical results are less accurate when DFT channels become more correlated, we should expect worse predictions for high-frequency channels.
Then we have tested the watermarking system with a lowpass filter with cut-off frequency rad. Figure 9 compares the experimentally evaluated WNR with the analytical WNR computed according to (13) and the analytical approximation of the WNR obtained from (15). It is worth noting that the WNR is much larger for the low-frequency channels where the host power is also larger and the filter response is flat. In Figure 10 the experimental BER is compared with the analytically derived BER and its upper bound, according to the formulas in  (here and in the following, the analytical BER is computed using the exact formula of the per-channel signal power); here we show only the range of channels having an experimental BER larger than . From the comparison of Figures 9 and 10 it can be verified that the error probability is approximately for those DFT channels whose WNR is lower than 0 dB, as we have already discussed.
To understand how different AR models influence the WNR, the analytical WNR for the lowpass filter has been computed using (13) for different orders of the AR model. In Figure 11 the WNR for AR() is compared with the analytical WNR computed for AR(), AR(), AR() and AR(). For the WNR is slightly lower than that of , while for approximately the same WNR of is obtained. As the order of AR model increases, the WNR has more ripples but it has always the same average trend of that for AR(), as it is shown in Figures 11(c) and 11(d). We conclude that the order of the AR model has little impact on the final results.
Then we have tested the watermarking system with a lowpass filter having passband rad and stopband rad, with a smooth transition in the middle. Figure 12 compares the experimental WNR and the analytical one; there is a noticeable difference in the frequency range where the interchannel correlation is larger. In Figure 13 the experimental BER is compared with the analytically derived BER and its upper bound (again only the range of channels having an experimental BER larger than is shown). Moreover, it can be seen that the analytical error probability matches the experimental one since all the channels with are not in the range of high correlation. It is worth noting that the error probability is approximately in the majority of channels belonging to the transition band, which is approximately between channels and .
Finally, a ten-band graphic audio equalizer has been used as attack filter. In the following experiments we have set the equalizer subband filters so that they produce the overall frequency response depicted in Figure 14, which is the same that was used in the experiments presented in . Figures 15 and 16 illustrate the analytical WNRs and the comparison of the experimental BERs with the analytical ones, respectively. From the per-channel WNR shown in Figure 15 it can be inferred that the expected error probability will be very high, especially for the high-frequency channels, and this behavior is confirmed by the experimental BERs shown in Figure 16. One can also notice that the analytical error probabilities provide a good prediction only for the low-frequency channels. We conjecture that the observed inaccuracies are due to the correlation among neighboring channels of the colored host, which could be increased even further by the equalizer. Above all, this experiment reveals that DFT-RDM applied to a colored host does not guarantee at all the robustness of the watermark against an equalizer attack, especially as neither windowing nor spreading is here used, since the overall BER is approximately . It is worth noting that by embedding the watermark with the same system parameters into a white Gaussian host, the overall BER is approximately . On the other hand, the analysis and the experiments carried out for DFT-RDM with a colored host and an equalizer attack provide a qualitative explanation of the experimental results reported in  for DFT-RDM applied to audio signals.
Some experiments were conducted to verify the effectiveness of the extension of DFT-RDM proposed in Section 5, hereinafter denoted by the subscript W-DFT-RDM; in the following, the host will be assumed to be colored by , whereas perfect whitening is assumed, that is, .
First of all, we have compared the performance of W-DFT-RDM with that of DFT-RDM applied to both white and colored hosts. The experimental BERs measured for different attack filters are presented in Figures 17, 18 and 19, where it is verified that the BER of DFT-RDM applied to a white host matches always that of W-DFT-RDM applied to a colored host, as it was expected.
In Figure 17 are shown the experimental BERs measured for the lowpass attack filter with cut-off frequency rad. It can be noticed that for the given attack filter, the overall error probability of DFT-RDM applied directly to the colored host is , which is less than the overall error probability of DFT-RDM for a white host (). This behavior can be easily explained by the fact that the per-channel watermark signal power is larger at low-frequency channels which are not modified at all by the attack filter. This result confirms the conclusion that whitening does not always assure the best BER for every attack filter.
Then we have tested the watermarking methods with the lowpass filter having passband rad and stopband rad, with a smooth transition in the middle. The experimental BERs are shown in Figure 18. In this case, the error probability of W-DFT-RDM is approximately only in the stopband, while for DFT-RDM applied to a colored host it is in the transition band too. This yields the overall error probability of DFT-RDM (), which is larger than that of W-DFT-RDM ().
In Figure 19 are shown the BERs for the ten-band graphic audio equalizer. With this attack filter, since the filtering effect is spread over all frequencies, W-DFT-RDM outperforms DFT-RDM for colored hosts (the overall error probabilities are respectively and ).
We have also compared the behavior of W-DFT-RDM and of DFT-RDM using real audio tracks sampled at 44.1 kHz with 16 bits as host signal. These experiments have been conducted using for all the audio tracks a fixed whitening filter, which is again . We remark here that perfect whitening does not occur with audio tracks since the whitening filter is the inverse of an AR filter which resembles the spectral contents of a generic audio signal. The measured DWRs have been obtained fixing the target DWR at 25 dB; we remark here that with nonstationary, non-Gaussian and nonwhite hosts the analytical derivation of the DWR for DFT-RDM is only an approximation.
In Tables 1, 2, and 3 the overall error probabilities evaluated for a spreading factor (i.e., no spreading) and a rectangular window are given. Notice that in all the experiments, for the same audio track, the DWRs produced by the two embedding techniques are approximately equal.
Table 1 shows the experimental results for the lowpass filter with cut-off frequency rad. As it was to be expected from the results presented before for a colored host, for audio signals DFT-RDM has also lower bit error probabilities than W-DFT-RDM. Similar results have been obtained attacking the watermarked host with the lowpass filter having passband rad and stopband rad. As it is shown in Table 2, the overall error probabilities for DFT-RDM are mostly lower than the respective ones for W-DFT-RDM; however, the behavior depends on the particular audio track, as it can be noticed from the results obtained for the tracks "Spff" and "Spfg." In contrast, for the ten-band equalizer attack, W-DFT-RDM yields an improved overall BER for all the audio tracks.
We must remark that the BERs given above for both DFT-RDM-based schemes would be unacceptable in a watermarking application, thus the experiments have been repeated using a spreading factor and the optimal window, which has been computed according to . We remind that spreading grants a robustness improvement at the expense of a reduction of the data rate, which becomes 1/16 bits/sample for . From the inspection of the DWRs listed in Tables 4, 5, and 6 it can be noticed that in all the experiments, for the same audio track, the DWRs produced by the two embedding techniques are approximately equal.
Table 4 shows the results for the lowpass filter with cut-off frequency rad. Here, for every audio track, both DFT-RDM-based schemes reach the minimum error probability, which corresponds to the correct detection of all those watermark bits embedded in DFT channels within the passband and is approximately .
From the comparison of the results for the lowpass attacking filter with passband rad and stopband rad, that are listed in Table 5, we can notice that whitening yields a minimum error probability, that is again approximately , in almost all the experiments. Moreover, DFT-RDM has always an overall error probability higher than W-DFT-RDM and away from the minimum error probability.
The overall error probabilities presented in Table 6 confirm the better behavior of W-DFT-RDM for the equalizer attack. In fact, for every audio track the BER of W-DFT-RDM is always lower, with an improvement with respect to DFT-RDM that goes from a factor of to in terms of error probability, depending on the audio track.
Even though linear filtering does not encompass MPEG Layer-3 (MP3) compression, this can be very roughly seen as a lowpass filtering with cut-off frequency equal to the sampling frequency of the audio track after MP3 compression. Hence, we have conducted several experiments to verify the robustness of DFT-RDM-based techniques to MP3 compression. The real audio tracks, whose sampling frequency is 44.1 kHz, have been marked, compressed using LAME 3.97  to perform MP3 encoding, and, finally, the watermark has been retrieved. In Table 7 are listed the BERs measured for both DFT-RDM-based techniques using a spreading factor and the optimal window. These results have been obtained for constant bit-rate MP3 encoding of the watermarked audio tracks, but approximately the same error probabilities have been measured for average bit-rate MP3 encoding. It is worth noting that in these experiments the minimum error probability is approximately , that corresponds to the correct detection of all the watermark samples embedded up to 32 kHz, which is the sampling frequency of the audio tracks compressed by LAME for the considered bit-rates. From the inspection of the results in Table 7, it can be noticed that the error probabilities of W-DFT-RDM are always lower than those of DFT-RDM for the same bit-rate. Even if the measured error probabilities are considerably dependent on the particular audio track, W-DFT-RDM approaches the minimum error probability for almost all audio tracks and an encoding bit-rate equal to 320 kbps. On the other hand, the BERs measured for DFT-RDM can be far away from the minimum error probability even if the audio tracks are encoded at the maximum allowed bit-rate.
A thorough analysis of the behavior of DFT-RDM for colored Gaussian hosts has been performed. An explanation to the performance loss with respect to white Gaussian hosts has been given. We have also provided an extension of DFT-RDM for colored hosts without any additional knowledge on the attack filter; this extension consists in using a fixed whitening filter that captures the average properties of audio signals. The analysis has been validated by experimental results which confirm the performance improvement afforded by the proposed solution. Moreover W-DFT-RDM has been tested with audio signals providing a BER decrease which encourages us to continue on this research line. W-DFT-RDM for audio tracks is not able to fill the performance gap with respect to DFT-RDM for white hosts since a fixed (and nonperfectly matched) average whitening filter is used at both the embedder and the decoder. A further improvement could be obtained by using a host-adaptive whitening filter at the embedder which, assuming a blind framework, should be retrieved at the decoder side, at least with some approximation. Finally, even though encouraging BER results have been obtained for MP3 compression, an accurate analysis of DFT-RDM-based techniques against compression is needed in order to assess the real bounds.
Chen B, Wornell GW: Quantization index modulation: a class of provably good methods for digital watermarking and information embedding. IEEE Transactions on Information Theory 2001, 47(4):1423-1443. 10.1109/18.923725
Shterev ID, Lagendijk RL: Amplitude scale estimation for quantization-based watermarking. IEEE Transactions on Signal Processing 2006, 54(11):4146-4155. 10.1109/TSP.2006.881216
Miller ML, Doërr GJ, Cox IJ: Applying informed coding and embedding to design a robust high-capacity watermark. IEEE Transactions on Image Processing 2004, 13(6):792-807. 10.1109/TIP.2003.821551
Pérez-González F, Mosquera C, Barni M, Abrardo A: Rational dither modulation: a high-rate data-hiding method invariant to gain attacks. IEEE Transactions on Signal Processing 2005, 53(10):3960-3975. 10.1109/TSP.2005.855407
Pérez-González F, Mosquera C: Quantization-based data hiding robust to linear-time-invariant filtering. IEEE Transactions on Information Forensics and Security 2008, 3(2):137-152. 10.1109/TIFS.2008.922057
Wang J, Shterev ID, Lagendijk RL: Scale estimation in two-band filter attacks on QIM watermarks. In Security, Steganography, and Watermarking of Multimedia Contents VIII, January 2006, San Jose, Calif, USA, Proceedings of SPIE Edited by: Delp EJ III, Wong PW. 6072: 118-127.
Proakis JG, Manolakis DK: Digital Signal Processing. 4th edition. Prentice Hall, Upper Saddle River, NJ, USA; 2006.
The Lame Project http://lame.sourceforge.net/
About this article
Cite this article
Scagliola, M., Pérez-González, F. & Guccione, P. High-Rate Data-Hiding Robust to Linear Filtering for Colored Hosts. EURASIP J. on Info. Security 2009, 914937 (2009). https://doi.org/10.1155/2009/914937
- Error Probability
- Discrete Fourier Transform
- Audio Signal
- Host Signal
- Watermark Signal