# Robust and Reversible Audio Watermarking by Modifying Statistical Features in Time Domain

Authors: Shijun Xiang; Le Yang; Yi Wang
Journal: Advances in Multimedia
 (2017)

---

## Abstract

Robust and reversible watermarking is a potential technique in many sensitive applications, such as lossless audio or medical image systems. This paper presents a novel robust reversible audio watermarking method by modifying the statistic features in time domain in the way that the histogram of these statistical values is shifted for data hiding. Firstly, the original audio is divided into nonoverlapped equal-sized frames. In each frame, the use of three samples as a group generates a prediction error and a statistical feature value is calculated as the sum of all the prediction errors in the frame. The watermark bits are embedded into the frames by shifting the histogram of the statistical features. The watermark is reversible and robust to common signal processing operations. Experimental results have shown that the proposed method not only is reversible but also achieves satisfactory robustness to MP3 compression of 64 kbps and additive Gaussian noise of 35 dB.


---

## Body

## 1. Introduction

With the rapid development of the Internet technology, publication and dissemination of digital multimedia become more and more convenient. However, the authenticity and security of the digital multimedia are a challenge for the media owner [1]. Digital watermarking technology is an efficient approach to protect the copyright of the digital media. Reversible watermarking is one of the watermarking technologies used for data hiding. Reversible watermarking enables embedding secret data into host media and allow extraction of the original media and the secret data [2–4]. It is very useful in sensitive applications such as medical image system, military image, and lossless audio [5]. Although there are so many reversible watermarking methods, most of them are designed in a lossless environment and cannot resist any type of attacks. As a result, the original media or the secret data cannot be recovered after the watermarked media go through some changes [6].In some cases, such as the copyright protection of the digital media, the embedded data is expected to be robust to some attacks such as lossy compression or additive noise. To this end, researchers pay more attention to robust reversible watermarking. Robust reversible watermarking is that the original media and the embedded data can be both recovered correctly when the watermarked media remain intact, and the embedded data can still be extracted without error even when the watermarked media go through some attacks [7]. Until now, a few robust reversible image watermarking methods have been proposed, which can be classified into two groups:(i)
Blind watermarking scheme: in [7, 8], Vleeschouwer et al. proposed a blind extraction scheme based on the patchwork theory and modulo-256 by using the gray-scale histogram rotation. This work is robust against JPEG compression, but the watermarked image has lower visible quality due to the reason that the watermark embedding procedure will cause salt-and-pepper noise in the watermarked image. Besides, the payload is low. To handle the salt-and-pepper noise problem, Zou et al. proposed a scheme by shifting the absolute mean values of the integer wavelet transform (IWT) coefficients in a chosen subband [9], and Ni et al. proposed a scheme by modifying the histogram of a robust statistical quantity in the spatial domain [10]. Since the embedding process may introduce the error bits, the error correction coding (ECC) has been used. Besides, these two methods suffered from the unstable robustness and incomplete reversibility according to [11]. In [12], Zeng et al. enhanced the scheme of Ni et al. by introducing two thresholds and a new embedding mechanism. This method is blind and reversible. For a satisfactory performance, the two threshold values have to be carefully searched for different cover images.(ii)
Nonblind watermarking scheme: in [13], a nonblind scheme based on wavelet-domain statistical quantity histogram shifting and clustering (WSQH-SC) is proposed. A pixel adjustment is presented at first to avoid the overflow and underflow, and a location map is used to record the changed pixels. This method achieved good robustness against JPEG, JPEG2000, and additive Gaussian noise, but it is not blind since the locations of the changed pixels need to be saved as a part of side information and transmitted to the receiver side in order to recover the original image. In [14], the Slantlet transform (SLT) was applied to image blocks, modifying the mean values of the HL and LH subband coefficients to embed the watermark bits, and a second stage of SLT transform is applied to the LL1 subband, embedding another watermark bit into the HL2 and LH2 subband. Because the coefficients and the mean values are fractional with more decimal places, the mean information was taken as side information to be sent to the receiver side for the recovery of the original cover image. In order to solve the nonblind extraction question in [14], the authors in [15] used IWT on images and randomly selected 10 coefficients from all the 16 coefficients in a block to compute the amplitude mean of the block, so that the mean information can be embedded into the image itself for blind extraction.In [16], Coltuc and Chassery proposed a general framework for robust reversible watermarking by multiple watermarking. First the watermark is embedded into the cover image with a robust watermarking method and then a reversible watermarking method is adopted to embed the information (which is used to restore the original cover image) into the robust watermarked image. Suppose I and I1 are the original image and the robust watermarked image after embedding a watermark w, respectively. The embedding distortion, d=I-I1, is compressed and embedded into the robust watermarked image with the reversible watermarking method. At the receiver side, if there are no attacks, the robust watermarked image I1 and the difference d can be extracted since the embedding process is reversible. Then the original image I can be recovered by I=d+I1. Furthermore, the watermark can be extracted. If the watermarked image goes through a JPEG compression operation, the robust watermark can still be extracted. This framework is very instructive and achieves higher payload and good robustness against JPEG compression.In [17], a robust reversible audio method based on spread spectrum and amplitude expansion is proposed. A robust payload is embedded at first using the direct-sequence spread-spectrum modulation, with the sequence determined from the amplitude expansion in time and frequency of integer modified discrete cosine transform (MDCT) coefficients. Then a reversible payload is embedded into the apertures in the amplitude histogram that result from amplitude expansion of the integer MDCT coefficients to recover the host audio. This method achieves robustness against some signal processing like MP3 compression and additive noise, and if the watermarked audio remains intact, the host audio can be recovered perfectly.In this paper, we propose a novel robust and reversible audio watermarking scheme based on statistic feature and histogram shifting in time domain. By shifting the histogram of the statistic features in time domain, the proposed algorithm achieves good robustness and reversibility at the same time.The rest of the paper is organized as follows. The foundation work is introduced in Section2. The proposed watermarking algorithm is described in Section 3. Experimental results are presented in Section 4. Section 5 concludes this paper.


## 2. Algorithm’s Principle

This section will introduce the foundation works of the proposed robust reversible digital audio watermarking scheme. Firstly, a robust statistic feature of time domain is introduced; then how to modify the statistic feature to embed the watermark bit is briefly described.


### 2.1. Robust Statistic Feature

Consider a time-discrete digital audio signalX; the host signal is first divided into nonoverlapped equal-sized frames. We take N samples per frame; for example, N samples as a frame and three samples as a group are shown in Figure 1. For a sample group (xl,xm and xr), the prediction value of the middle sample x^m is calculated by using two immediate samples as(1)x^m=xl+xr2,where ⌈x⌉ means rounding the elements of x to the nearest integer towards infinity. The prediction error of x^m is(2)em=xm-x^m.Since the samples in a group are often highly correlated, the prediction error em is expected to be very close to zero. For a frame with N samples, N/3 prediction errors can be computed. The sum of all the prediction errors in a frame, denoted by E, is called the statistic feature in this paper. The statistical feature of a frame is calculated as(3)E=∑i=1N/3ei,where ei is the prediction error of the ith group in the frame. The basic idea of the proposed algorithm is based on this statistic property.Figure 1
The use ofN samples as a frame and three samples as a group.


### 2.2. Watermark Statistic Feature

For each frame, one watermark bit is embedded by shifting the value of the statistic feature. The shifting operation is done by modifying the samples in a frame. Takingtrack 1 (which is downloaded from the website [18]) as example clip, Figure 2 shows the distribution of E values by using 300 samples as a frame and three samples as a group. The rule to modify the statistic value is referred to histogram shifting method. At first, we scan all frames and find out the maximum of the absolute E values, denoted by Emax. Then, a threshold T is set to a positive integer bigger than Emax. As a result, all E values are within the range [-T,T]. For example, from Figure 2 we can get that Emax is 446, so threshold T can be an integer such as 500. The watermarking rule is to keep the statistic feature within [-T,T] if the watermark bit is “0” while the statistic feature is shifted away from zero by a shifting quantity T+G if the watermark bit is “1.” To achieve stronger robustness, parameter G is a threshold which is usually set bigger than T. To reduce the embedding distortion, if the embedded watermark bit is “1” and the original statistic feature belongs to [0,T), the statistic feature is shifted to the region [T+G,2T+G]; if the embedded watermark bit is “1” and the original statistic feature belongs to (-T,0), the statistic feature is shifted to the region [-2T-G,-T-G]. In such a way, the bit-0 region and the bit-1 region are separated by the robust regions (T,T+G) and (-T-G,-T). For example, Figure 3 shows the distribution of E values after embedding watermark by using cliptrack 1.Figure 2
The distribution of theE values for the cliptrack 1.Figure 3
The distribution of theE values oftrack 1 after embedding watermark.The modifying rules are as follows.If the embedded bit is “0,” keep the frame unchanged. If the embedded bit is “1,” the samples in the frame are modified by(4)yik=xik+β,if0≤Ek<T,mod⁡i,3=2xik-β,if-T<Ek<0,mod⁡i,3=2xik,otherwise,where xik is the ith sample in the kth frame. The index i is in [1,S] and S is the number of the samples in a frame. The integer value β is the shifted quantity of a sample,(5)β=T+GS/3.At the receiver side, if the watermarked audio remains intact, the watermark bits can be extracted by(6)wk=0,ifEk∈-T,T1,otherwise,where wk is the to be hidden kth bit. The original audio can be recovered as(7)xik=yik-β,ifEk∈T+G,2T+G,mod⁡i,3=2yik+β,ifEk∈-2T-G,-T-G,mod⁡i,3=2yik,otherwise.


### 2.3. Prevention of Overflow/Underflow

For a16-bit digital audio, the permission range of the sample value is [-215,215]. Watermark embedding will modify the sample values with the value β, so the overflow or underflow does not occur if the original sample values belong to [-215+β,215-β]. In fact, as the value β is very small, the original sample values of most normal audio belong to [-215+β,215-β]. Therefore, in the proposed method, there is no overflow or underflow in most cases. If the audio cannot meet this condition, we can record the location and modify the sample value to the range [-215+β,215-β]; then the location can be saved as side information and embedded into the audio.


## 2.1. Robust Statistic Feature

Consider a time-discrete digital audio signalX; the host signal is first divided into nonoverlapped equal-sized frames. We take N samples per frame; for example, N samples as a frame and three samples as a group are shown in Figure 1. For a sample group (xl,xm and xr), the prediction value of the middle sample x^m is calculated by using two immediate samples as(1)x^m=xl+xr2,where ⌈x⌉ means rounding the elements of x to the nearest integer towards infinity. The prediction error of x^m is(2)em=xm-x^m.Since the samples in a group are often highly correlated, the prediction error em is expected to be very close to zero. For a frame with N samples, N/3 prediction errors can be computed. The sum of all the prediction errors in a frame, denoted by E, is called the statistic feature in this paper. The statistical feature of a frame is calculated as(3)E=∑i=1N/3ei,where ei is the prediction error of the ith group in the frame. The basic idea of the proposed algorithm is based on this statistic property.Figure 1
The use ofN samples as a frame and three samples as a group.


## 2.2. Watermark Statistic Feature

For each frame, one watermark bit is embedded by shifting the value of the statistic feature. The shifting operation is done by modifying the samples in a frame. Takingtrack 1 (which is downloaded from the website [18]) as example clip, Figure 2 shows the distribution of E values by using 300 samples as a frame and three samples as a group. The rule to modify the statistic value is referred to histogram shifting method. At first, we scan all frames and find out the maximum of the absolute E values, denoted by Emax. Then, a threshold T is set to a positive integer bigger than Emax. As a result, all E values are within the range [-T,T]. For example, from Figure 2 we can get that Emax is 446, so threshold T can be an integer such as 500. The watermarking rule is to keep the statistic feature within [-T,T] if the watermark bit is “0” while the statistic feature is shifted away from zero by a shifting quantity T+G if the watermark bit is “1.” To achieve stronger robustness, parameter G is a threshold which is usually set bigger than T. To reduce the embedding distortion, if the embedded watermark bit is “1” and the original statistic feature belongs to [0,T), the statistic feature is shifted to the region [T+G,2T+G]; if the embedded watermark bit is “1” and the original statistic feature belongs to (-T,0), the statistic feature is shifted to the region [-2T-G,-T-G]. In such a way, the bit-0 region and the bit-1 region are separated by the robust regions (T,T+G) and (-T-G,-T). For example, Figure 3 shows the distribution of E values after embedding watermark by using cliptrack 1.Figure 2
The distribution of theE values for the cliptrack 1.Figure 3
The distribution of theE values oftrack 1 after embedding watermark.The modifying rules are as follows.If the embedded bit is “0,” keep the frame unchanged. If the embedded bit is “1,” the samples in the frame are modified by(4)yik=xik+β,if0≤Ek<T,mod⁡i,3=2xik-β,if-T<Ek<0,mod⁡i,3=2xik,otherwise,where xik is the ith sample in the kth frame. The index i is in [1,S] and S is the number of the samples in a frame. The integer value β is the shifted quantity of a sample,(5)β=T+GS/3.At the receiver side, if the watermarked audio remains intact, the watermark bits can be extracted by(6)wk=0,ifEk∈-T,T1,otherwise,where wk is the to be hidden kth bit. The original audio can be recovered as(7)xik=yik-β,ifEk∈T+G,2T+G,mod⁡i,3=2yik+β,ifEk∈-2T-G,-T-G,mod⁡i,3=2yik,otherwise.


## 2.3. Prevention of Overflow/Underflow

For a16-bit digital audio, the permission range of the sample value is [-215,215]. Watermark embedding will modify the sample values with the value β, so the overflow or underflow does not occur if the original sample values belong to [-215+β,215-β]. In fact, as the value β is very small, the original sample values of most normal audio belong to [-215+β,215-β]. Therefore, in the proposed method, there is no overflow or underflow in most cases. If the audio cannot meet this condition, we can record the location and modify the sample value to the range [-215+β,215-β]; then the location can be saved as side information and embedded into the audio.


## 3. Proposed Algorithm

The embedding and extraction processes are presented in detail as follows.


### 3.1. Watermark Embedding

Figure4 shows the proposed watermark embedding process. The watermark is embedded with the following five steps.Figure 4
Watermark embedding process.Step 1.
Divide the original audioX into nonoverlapping frames sized S samples.Step 2.
Calculate the statistic features of the frames (E values) by referring to (1)–(3).Step 3.
Set the threshold valuesT and G (T>Emax and usually G>T).Step 4.
If the watermark bit is “0,” nothing is changed. If the bit is “1,” shift the statistic feature value with a shifting quantityT+G to embed the watermark bit by modifying the samples in the frame with value β referring to (4).Step 5.
Combine the frames to get the watermarked audio.


### 3.2. Watermark Extraction

If the watermarked audio goes through some attacks (such as MP3 compression, additive noise, resampling, or requantization), the watermark can still be detected. To improve the accuracy of the watermark extraction, three extraction methods and a majority voting system are adopted to identify the extracted watermark by computing the distorted statistical feature valuesE′.(i) Extraction 1. Redefine the bit-0 region as [-T-G/2,T+G/2] and the watermark extraction as(8)w1′i=0,ifE′∈-T-G/2,T+G/21,otherwise.(ii) Extraction 2. Redefine the bit-0 region as [-T-G/3,T+G/3] and the watermark extraction as(9)w2′i=0,ifE′∈-T-G/3,T+G/31,otherwise.(iii) Extraction 3. k-means clustering algorithm is introduced to extract bits. Figure 5 shows the distribution of the E values after MP3 compression, and the watermark can be extracted by(10)w3′i=0,ifE′∈class21,ifE′∈class  1  and  class3.Figure 5
The distribution of the statistic feature values of track 1 after MP3 compression at 64 kbps.The majority voting system works as(11)w′i=w1′i,ifw1′i=w2′i,w1′i=w3′iw1′i,ifw1′i=w2′i,w1′i≠w3′iw2′i,ifw1′i≠w2′i,w2′i=w3′iw3′i,ifw1′i≠w2′i,w1′i=w3′i.Eventually, three extraction methods and a majority voting system are adopted to extract watermark. Figure6 shows the proposed watermark extracting process. If the watermarked audio remains intact, the watermark can be extracted correctly and the original audio can be recovered as the following steps.Figure 6
Watermark extracting process.Step 1.
Divide the watermarked audioXw into nonoverlapping frames sized S samples.Step 2.
Calculate the statistic feature of the frames (E′ values) by referring to (1)–(3).Step 3.
Extract the watermark with three extraction methods and identify the watermark with the majority voting system by referring to (8)–(11).Step 4.
The original audio can be recovered by modifying the samples in the frame with valueβ referring to (7).Step 5.
Combine the frames to get the original audio.If the watermarked audio goes through some attacks, the original audio cannot be recovered exactly, so we focus on the watermark extraction, and the watermark is extracted as follows.Step 1.
Divide the watermarked audioXw into nonoverlapping frames sized S samples.Step 2.
Calculate the statistic feature values of the framesE′ by referring to (1)–(3).Step 3.
Extract the watermark with three extraction methods and identify the watermark with the majority voting system by referring to (8)–(11).


## 3.1. Watermark Embedding

Figure4 shows the proposed watermark embedding process. The watermark is embedded with the following five steps.Figure 4
Watermark embedding process.Step 1.
Divide the original audioX into nonoverlapping frames sized S samples.Step 2.
Calculate the statistic features of the frames (E values) by referring to (1)–(3).Step 3.
Set the threshold valuesT and G (T>Emax and usually G>T).Step 4.
If the watermark bit is “0,” nothing is changed. If the bit is “1,” shift the statistic feature value with a shifting quantityT+G to embed the watermark bit by modifying the samples in the frame with value β referring to (4).Step 5.
Combine the frames to get the watermarked audio.


## 3.2. Watermark Extraction

If the watermarked audio goes through some attacks (such as MP3 compression, additive noise, resampling, or requantization), the watermark can still be detected. To improve the accuracy of the watermark extraction, three extraction methods and a majority voting system are adopted to identify the extracted watermark by computing the distorted statistical feature valuesE′.(i) Extraction 1. Redefine the bit-0 region as [-T-G/2,T+G/2] and the watermark extraction as(8)w1′i=0,ifE′∈-T-G/2,T+G/21,otherwise.(ii) Extraction 2. Redefine the bit-0 region as [-T-G/3,T+G/3] and the watermark extraction as(9)w2′i=0,ifE′∈-T-G/3,T+G/31,otherwise.(iii) Extraction 3. k-means clustering algorithm is introduced to extract bits. Figure 5 shows the distribution of the E values after MP3 compression, and the watermark can be extracted by(10)w3′i=0,ifE′∈class21,ifE′∈class  1  and  class3.Figure 5
The distribution of the statistic feature values of track 1 after MP3 compression at 64 kbps.The majority voting system works as(11)w′i=w1′i,ifw1′i=w2′i,w1′i=w3′iw1′i,ifw1′i=w2′i,w1′i≠w3′iw2′i,ifw1′i≠w2′i,w2′i=w3′iw3′i,ifw1′i≠w2′i,w1′i=w3′i.Eventually, three extraction methods and a majority voting system are adopted to extract watermark. Figure6 shows the proposed watermark extracting process. If the watermarked audio remains intact, the watermark can be extracted correctly and the original audio can be recovered as the following steps.Figure 6
Watermark extracting process.Step 1.
Divide the watermarked audioXw into nonoverlapping frames sized S samples.Step 2.
Calculate the statistic feature of the frames (E′ values) by referring to (1)–(3).Step 3.
Extract the watermark with three extraction methods and identify the watermark with the majority voting system by referring to (8)–(11).Step 4.
The original audio can be recovered by modifying the samples in the frame with valueβ referring to (7).Step 5.
Combine the frames to get the original audio.If the watermarked audio goes through some attacks, the original audio cannot be recovered exactly, so we focus on the watermark extraction, and the watermark is extracted as follows.Step 1.
Divide the watermarked audioXw into nonoverlapping frames sized S samples.Step 2.
Calculate the statistic feature values of the framesE′ by referring to (1)–(3).Step 3.
Extract the watermark with three extraction methods and identify the watermark with the majority voting system by referring to (8)–(11).


## 4. Experimental Results

In this section, 7 WAV audio file of the sample rate of 44.1 KHz and 16 bits per sample (tracks 1, 2, 3, 4, 5, 6, and 7 [18]) are used as example clips to evaluate the performance of the proposed algorithm. The payload of our method only depends on the length of a frame S; for a time-discrete digital audio signal X in length M, the pure payload can be calculated by(12)C=MS.In the experiment, the watermark is a pseudo-random sequence in length of 1000 bits. The imperceptibility is first analyzed by the SNR standard at different threshold values and different sample numbers per frame. Then, robustness testing against MP3 compression, additive noise (AWGN), resampling (44.1-16-44.1 kHz), and requantization (16-8-16 bits) are reported by using the software CoolEditPro v2.1.


### 4.1. Imperceptibility Test

The imperceptibility is measured by the embedding distortion. In the proposed scheme, the distortion is caused by the shifting quantity on the samples depending on thresholdsT, G and the length of a frame S. Since T is set at first, we only investigate the influence of G and S on SNR.Figure7 plots the relationship between SNR and the threshold G for different clips at the same threshold T and S. From this figure we can conclude that with the increase of G, the SNR value drops. The reason is that the larger G is, the larger shifting quantity is used, so the larger embedding distortion is caused. As a result, SNR value drops.Figure 7
Relationship between SNR and thresholdG.Figure8 plots the relationship between SNR and the length of a frame S for different clips at the same thresholds T and G. We can see from this figure that the larger S is, the higher SNR value is achieved. The reason is that with the increase of S, the shifting quantity for every single sample drops, so the SNR values rise due to the fact that the embedding distortion is reduced. Consequently, the frame length S will influence Maximum Embedding Capacity and SNR value directly, the Maximum Embedding Capacity is higher when S is smaller according to (12), and the SNR value is higher when S is larger according to Figure 8. To consider the balance between Maximum Embedding Capacity and SNR value, we have found that the value of S within the range of 300 to 600 can usually achieve a satisfactory result after a set of experiments.Figure 8
Relationship between SNR and the frame lengthS.


### 4.2. Robustness Testing

To test the robustness of the proposed scheme, a set of experiments has been taken on tracks 1–7. Table1 shows the results, in which RP means resampling (44.1-16-44.1 kHz) operations while RQ means requantization (16-8-16 bits) operations. We can observe from this table that all the example clips can achieve the robustness against MP3 compression at 64 Kbps. Fortrack 1, the watermark bits can be correctly extracted under the MP3 compression of 48 Kbps. The robustness against additive noise is also satisfactory. Even with the noise intensity at 25 dB, the BER (bit error rate) values are less than 10% except fortrack 1. Besides, the watermark robustness against resampling and requantization operations is perfect, and the hidden bits can be recovered without errors.Table 1
Performance of the proposed method.
Audio
S
T
G
SNR
MP3 (Kbps)
AWGN (35 dB)
AWGN (30 dB)
AWGN (25 dB)
RP
RQ
Track 1
420
500
3000
54.74
48
2/1000
77/1000
251/1000
0/1000
0/1000
Track 2
600
6200
7000
47.98
64
0/1000
0/1000
0/1000
0/1000
0/1000
Track 3
510
600
3000
54.09
48
0/1000
0/1000
44/1000
0/1000
0/1000
Track 4
300
9900
10000
38.99
64
0/1000
0/1000
0/1000
0/1000
0/1000
Track 5
300
200
3000
56.18
48
0/1000
25/1000
77/1000
0/1000
0/1000
Track 6
600
200
3000
49.5
48
0/1000
0/1000
46/1000
0/1000
0/1000
Track 7
300
1600
4000
43.78
48
0/1000
0/1000
0/1000
0/1000
0/1000As shown in Figure3, the robustness of the proposed method is originated from the robust region. The robust region depends on threshold G. The larger G is, the larger the robust region is, and the stronger robustness is. Figure 9 supports the conclusion. Figure 9 shows the bit error rate (BER) at different threshold G for the same audio with same threshold T. The lower BER means that the stronger robustness is achieved. We can find that as threshold G increases, the BER drops, and the robustness rises.Figure 9
Relationship between MP3 bit rate and thresholdG.Taketrack 1 as example clip; Figure 10 shows the bit error rate of the extracted watermark with different thresholds G against additive noises with the same T and S (T=500,S=300). We can see that the larger G is, the smaller bit error rate is, and the better robustness is. As threshold G increases, the robustness becomes stronger. In the application, we can adjust the parameter G to achieve ideal robustness. On the other hand, with the increase of G, the SNR value drops. To consider the balance between SNR value and robustness, we have found that the value of G within 3000 to 5000 can usually achieve a satisfactory result after a set of experiments.Figure 10
The BER values at different AWGN with different thresholdG.To evaluate the effect of the frame lengthS on the robustness performance, a set of experiments has been taken ontrack 1, track 6,andtrack 7. Table 2 lists the results. We can observe that, for the same audio with the same T and G, such as T=500 and G=3000 fortrack 1, as S increases, the robustness against MP3 compression will strengthen, but fortrack 6 and track 7, as S increases, the robustness against MP3 compression drops, so the effect of the frame length S on the robustness against MP3 compression is unstable. The influence on AWGN is little.Table 2
Performance of the proposed method with different length of a frameS on track 1.
Track
S
T
G
MP3
AWGN
AWGN
AWGN
(Kbps)
(35 dB)
(30 dB)
(25 dB)
Track 1
300
500
3000
80
9/1000
90/1000
299/1000
Track 1
420
500
3000
56
12/1000
171/1000
320/1000
Track 1
510
550
3000
80
28/1000
171/1000
158/1000
Track 1
600
550
3000
48
28/1000
221/1000
390/1000
Track 6
300
200
3000
48
0/1000
0/1000
3/1000
Track 6
420
200
3000
56
28/1000
0/1000
23/1000
Track 7
300
200
4000
48
0/1000
0/1000
0/1000
Track 7
420
200
4000
56
0/1000
0/1000
0/1000For fair comparison with the method in [17], we use the same host signals (tracks 32, 35, 65, 66, and 69) downloaded from sound quality assessment material (SQAM) collection [19]. Table 3 shows the robustness testing results against MP3 compression and additive noise (AWGN) operations. We can observe that the method in [17] can carry 216 bits and resist the MP3 compression at 128 Kbps while the proposed method can resist the MP3 compression at 64 Kbps with 1000 bits embedded. In addition, in our method the BER under the AWGN of 35 dB is less than that of the method in [17]. In other words, the proposed method can provide larger embedding capacity and obtain stronger robustness against MP3 compression and AWGN attacks. The imperceptibility is evaluated by using the ODG standard. The closer the ODG value to 0, the better the imperceptibility. For the table it is noted that the imperceptibility of the proposed method is better except for the clipstrack 35 andtrack 66. The reason is that Emax values of track 35 and track 66 are bigger. As a result, thresholds T and G are also larger and more embedding distortion will be caused.Table 3
Comparison with method in [17].
Track
Method in [17]
Proposed method
Payload
ODG
MP3
AWGN
S
T
G
Payload
ODG
MP3
MP3
AWGN
(bits)
(128 Kbps)
(36 dB)
(bits)
(80 Kbps)
(64 Kbps)
(36 dB)
Track 32
216
−2.45
0
0
150
1500
3000
1000
−1.37
0
0.2%
0
Track 35
216
−1.31
0
12%
150
3500
5000
1000
−1.58
0
0.8%
0
Track 65
216
−1.21
0
6%
150
30
2000
1000
−0.23
0
0.1%
1.2%
Track 66
216
−0.24
0
6%
96
6000
6000
1000
−1.05
0.3%
1.2%
0
Track 69
216
−0.31
1%
4%
300
400
2000
1000
−0.23
0
0
0


## 4.1. Imperceptibility Test

The imperceptibility is measured by the embedding distortion. In the proposed scheme, the distortion is caused by the shifting quantity on the samples depending on thresholdsT, G and the length of a frame S. Since T is set at first, we only investigate the influence of G and S on SNR.Figure7 plots the relationship between SNR and the threshold G for different clips at the same threshold T and S. From this figure we can conclude that with the increase of G, the SNR value drops. The reason is that the larger G is, the larger shifting quantity is used, so the larger embedding distortion is caused. As a result, SNR value drops.Figure 7
Relationship between SNR and thresholdG.Figure8 plots the relationship between SNR and the length of a frame S for different clips at the same thresholds T and G. We can see from this figure that the larger S is, the higher SNR value is achieved. The reason is that with the increase of S, the shifting quantity for every single sample drops, so the SNR values rise due to the fact that the embedding distortion is reduced. Consequently, the frame length S will influence Maximum Embedding Capacity and SNR value directly, the Maximum Embedding Capacity is higher when S is smaller according to (12), and the SNR value is higher when S is larger according to Figure 8. To consider the balance between Maximum Embedding Capacity and SNR value, we have found that the value of S within the range of 300 to 600 can usually achieve a satisfactory result after a set of experiments.Figure 8
Relationship between SNR and the frame lengthS.


## 4.2. Robustness Testing

To test the robustness of the proposed scheme, a set of experiments has been taken on tracks 1–7. Table1 shows the results, in which RP means resampling (44.1-16-44.1 kHz) operations while RQ means requantization (16-8-16 bits) operations. We can observe from this table that all the example clips can achieve the robustness against MP3 compression at 64 Kbps. Fortrack 1, the watermark bits can be correctly extracted under the MP3 compression of 48 Kbps. The robustness against additive noise is also satisfactory. Even with the noise intensity at 25 dB, the BER (bit error rate) values are less than 10% except fortrack 1. Besides, the watermark robustness against resampling and requantization operations is perfect, and the hidden bits can be recovered without errors.Table 1
Performance of the proposed method.
Audio
S
T
G
SNR
MP3 (Kbps)
AWGN (35 dB)
AWGN (30 dB)
AWGN (25 dB)
RP
RQ
Track 1
420
500
3000
54.74
48
2/1000
77/1000
251/1000
0/1000
0/1000
Track 2
600
6200
7000
47.98
64
0/1000
0/1000
0/1000
0/1000
0/1000
Track 3
510
600
3000
54.09
48
0/1000
0/1000
44/1000
0/1000
0/1000
Track 4
300
9900
10000
38.99
64
0/1000
0/1000
0/1000
0/1000
0/1000
Track 5
300
200
3000
56.18
48
0/1000
25/1000
77/1000
0/1000
0/1000
Track 6
600
200
3000
49.5
48
0/1000
0/1000
46/1000
0/1000
0/1000
Track 7
300
1600
4000
43.78
48
0/1000
0/1000
0/1000
0/1000
0/1000As shown in Figure3, the robustness of the proposed method is originated from the robust region. The robust region depends on threshold G. The larger G is, the larger the robust region is, and the stronger robustness is. Figure 9 supports the conclusion. Figure 9 shows the bit error rate (BER) at different threshold G for the same audio with same threshold T. The lower BER means that the stronger robustness is achieved. We can find that as threshold G increases, the BER drops, and the robustness rises.Figure 9
Relationship between MP3 bit rate and thresholdG.Taketrack 1 as example clip; Figure 10 shows the bit error rate of the extracted watermark with different thresholds G against additive noises with the same T and S (T=500,S=300). We can see that the larger G is, the smaller bit error rate is, and the better robustness is. As threshold G increases, the robustness becomes stronger. In the application, we can adjust the parameter G to achieve ideal robustness. On the other hand, with the increase of G, the SNR value drops. To consider the balance between SNR value and robustness, we have found that the value of G within 3000 to 5000 can usually achieve a satisfactory result after a set of experiments.Figure 10
The BER values at different AWGN with different thresholdG.To evaluate the effect of the frame lengthS on the robustness performance, a set of experiments has been taken ontrack 1, track 6,andtrack 7. Table 2 lists the results. We can observe that, for the same audio with the same T and G, such as T=500 and G=3000 fortrack 1, as S increases, the robustness against MP3 compression will strengthen, but fortrack 6 and track 7, as S increases, the robustness against MP3 compression drops, so the effect of the frame length S on the robustness against MP3 compression is unstable. The influence on AWGN is little.Table 2
Performance of the proposed method with different length of a frameS on track 1.
Track
S
T
G
MP3
AWGN
AWGN
AWGN
(Kbps)
(35 dB)
(30 dB)
(25 dB)
Track 1
300
500
3000
80
9/1000
90/1000
299/1000
Track 1
420
500
3000
56
12/1000
171/1000
320/1000
Track 1
510
550
3000
80
28/1000
171/1000
158/1000
Track 1
600
550
3000
48
28/1000
221/1000
390/1000
Track 6
300
200
3000
48
0/1000
0/1000
3/1000
Track 6
420
200
3000
56
28/1000
0/1000
23/1000
Track 7
300
200
4000
48
0/1000
0/1000
0/1000
Track 7
420
200
4000
56
0/1000
0/1000
0/1000For fair comparison with the method in [17], we use the same host signals (tracks 32, 35, 65, 66, and 69) downloaded from sound quality assessment material (SQAM) collection [19]. Table 3 shows the robustness testing results against MP3 compression and additive noise (AWGN) operations. We can observe that the method in [17] can carry 216 bits and resist the MP3 compression at 128 Kbps while the proposed method can resist the MP3 compression at 64 Kbps with 1000 bits embedded. In addition, in our method the BER under the AWGN of 35 dB is less than that of the method in [17]. In other words, the proposed method can provide larger embedding capacity and obtain stronger robustness against MP3 compression and AWGN attacks. The imperceptibility is evaluated by using the ODG standard. The closer the ODG value to 0, the better the imperceptibility. For the table it is noted that the imperceptibility of the proposed method is better except for the clipstrack 35 andtrack 66. The reason is that Emax values of track 35 and track 66 are bigger. As a result, thresholds T and G are also larger and more embedding distortion will be caused.Table 3
Comparison with method in [17].
Track
Method in [17]
Proposed method
Payload
ODG
MP3
AWGN
S
T
G
Payload
ODG
MP3
MP3
AWGN
(bits)
(128 Kbps)
(36 dB)
(bits)
(80 Kbps)
(64 Kbps)
(36 dB)
Track 32
216
−2.45
0
0
150
1500
3000
1000
−1.37
0
0.2%
0
Track 35
216
−1.31
0
12%
150
3500
5000
1000
−1.58
0
0.8%
0
Track 65
216
−1.21
0
6%
150
30
2000
1000
−0.23
0
0.1%
1.2%
Track 66
216
−0.24
0
6%
96
6000
6000
1000
−1.05
0.3%
1.2%
0
Track 69
216
−0.31
1%
4%
300
400
2000
1000
−0.23
0
0
0


## 5. Conclusions

In this paper, we proposed a robust and reversible audio watermarking method by shifting the histogram of the statistical feature values in time domain. The statistical feature is calculated as the sum of the prediction errors in a frame. Since the audio clip has a larger number of samples and each frame can hold enough elements, the statistical feature is robust to those common signal processing operations. Considering that the distribution of the statistical feature values may be distorted to some extent, three extraction methods and the majority voting system are designed for the watermark detection. Experimental results have shown that thousands of bits can be reversibly embedded and the watermark bits can resist MP3 compression of 64 kbps and additive noise of 35 dB. Comparing with the existing excellent method, the proposed method can embed more watermark bits and achieve stronger robustness.



---

*Source: 8492672-2017-04-27.xml*