High capacity FFT-based audio watermarking

  • Authors:
  • Mehdi Fallahpour;David Megías

  • Affiliations:
  • Estudis d'Informàtica, Multimèdia i Telecomunicació Internet Interdisciplinary Institute, Universitat Oberta de Catalunya, Barcelona, Spain;Estudis d'Informàtica, Multimèdia i Telecomunicació Internet Interdisciplinary Institute, Universitat Oberta de Catalunya, Barcelona, Spain

  • Venue:
  • CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a novel high capacity audio watermarking algorithm to embed data and extract it in a bit-exact manner based on changing the magnitudes of the FFT spectrum. The key idea is to divide the FFT spectrum into short frames and change the magnitude value of the FFT samples based on the average of the samples of each frame. Using the average of FFT magnitudes makes it possible to improve the robustness, since the average is more stable against changes compared with single samples. In addition to good capacity, transparency and robustness, this scheme has three parameters which facilitate the regulation of these properties. Considering the embedding domain, audio watermarking techniques can be classified into time domain and frequency domain methods. In frequency domain watermarking [1-7], after taking one of the usual transforms such as the Discrete/Fast Fourier Transform (DFT/FFT) [4-6], the Modified Discrete Cosine Transform (MDCT) or the Wavelet Transform (WT) from the signal [7], the hidden bits are embedded into the resulting transform coefficients. In [4-6], which were proposed by the authors of this paper, the FFT domain is selected to embed watermarks for making use of the translation-invariant property of the FFT coefficients to resist small distortions in the time domain. In fact, using methods based on transforms provides better perceptual quality and robustness against common attacks at the price of increasing the computational complexity.