Robust patchwork-based watermarking method for stereo audio signals

Abstract

Abstract-This paper presents a patchwork-based watermarking method for stereo audio signals, which exploits the similarity of the two sound channels of stereo signals. Given a segment of stereo signal, we first compute the discrete Fourier transforms (DFTs) of the two sound channels, which yields two sets of DFT coefficients. The DFT coefficients corresponding to certain frequency range are divided into multiple subsegment pairs and a criterion is proposed to select those suitable for watermark embedding. Then a watermark is embedded into the selected subsegment pairs by modifying their DFT coefficients. The exact way of modification is determined by a secret key, the watermark to be embedded, and the DFT coefficients themselves. In the decoding process, the subsegment pairs containing watermarks are identified by another criterion. Then the secret key is used to extract the watermark from the watermarked subsegments. Compared to the existing patchwork methods for audio watermarking, the proposed method does not require knowledge of which segments of the watermarked audio signal contain watermarks and is more robust to conventional attacks.

A Novel Robust Audio Watermarking Algorithm by Modifying the Average Amplitude in Transform Domain

“…Natgunanathan [6] designed another patchwork-based audio watermarking method which embedded and extracted watermark bits in a multilayer framework by modifying the mean values of selected fragments in the DCT domain. The payload capacity was higher than that in paper [20]. Hu [23] presented a large capacity audio watermarking algorithm by developing perceptual masking in the DCT domain.…”

“…Compared with the time-domain algorithms, transform-domain algorithms are more robust because they take advantage of the audio signal characteristics and human auditory properties [19]. There are many transform domain algorithms, such as discrete Fourier transform (DFT) [20][21][22], DCT [6,23], DWT [8,19,[24][25][26][27][28] and singular value decomposition (SVD) [29]. Asmara [30] compared the characteristics of DFT, DCT and DWT when they were applied to watermarking algorithm.…”

“…Asmara [30] compared the characteristics of DFT, DCT and DWT when they were applied to watermarking algorithm. Natgunanathan [20] presented a patchwork-based watermarking algorithm for stereo audio signals by exploiting the similarity of the two audio channels of stereo signals in the DFT domain. This algorithm had good robustness against several conventional attacks, but the payload capacity was not high.…”

Development of Algorithm for Audio Watermarking Embedding and Decoding using Patchwork Method under Attacks

“…Audio Quality perceptual assessment (PEAQ) and BER are used as quality parameters in the range of 0 -1.2% to demonstrate the validity of the algorithm. In response to the similarity observes in the stereo signal, I. Natgunanathan et al [21] proposed a new and most advanced stage of a digital audio watermarking algorithm for a stereophonic audio signal in the field of frequency. But does not provide a robust response to advanced attacks, such as de-synchronization, pitch, or time changes.…”

Adaptive and Blind Audio Watermarking Algorithm Based on Chaotic Encryption in Hybrid Domain

“…In general, the time domain watermarking algorithm is easy to implement, but less robust in combating various digital signal processing attacks [2,4], such as the algorithms in literature [10,11]. Compared with the time-domain algorithms, the algorithms in the transform-domain, such as the discrete Fourier transform (DFT) [12][13][14], discrete cosine transform (DCT) [15,16], discrete wavelet transform (DWT) [17][18][19][20][21] and singular value decomposition (SVD) [22,23] and so on, are more robust because they explore human auditory properties and the features of audio signal. Natgunanathan [13] presented a blind watermarking algorithm by DFT for stereo signals.…”