In this paper, a robust and perceptually transparent single-level and multi-level blind audio watermarking scheme using wavelets is proposed. A randomly generated binary sequence is used as a watermark, and wavelet function coding is used to embed the watermark sequence in audio signals. Multi-level watermarking is used to enhance payload capacity and can be used for a different level of security. The robustness of the scheme is evaluated by applying different attacks such as filtering, sampling rate alteration, compression, noise addition, amplitude scaling, and cropping. The simulation results obtained show that the proposed watermarking scheme is resilient to various attacks except cropping. Perceptual transparency of watermark is measured by using Perceptual Evaluation of Audio Quality (PEAQ) basic model of ITU-R (PEAQ ITU-R BS.1387) on Speech Quality Assessing Material (SQAM) given by European Broadcasting Union (EBU). Average Objective Difference Grade (ODG) measured for this method is -0.067 and -0.080 for single-level and multi-level watermarked audio signals, respectively. In the proposed single-level digital audio watermarking scheme, the payload capacity is increased by 19.05% as compared to the single-level Chirp-Based Digital Audio Watermarking (CB-DAWM) scheme.
In this paper, a new lifting wavelet domain audio watermarking algorithm based on the statistical characteristics of sub-band coefficients is proposed. First of all, an original audio signal was segmented and each segment was divided into two sections. Then, the Barker code was used for synchronization, the LWT (lifting wavelet transform) was performed on each section, a synchronization code and a watermark were embedded into the first section and the second section, respectively, by modifying the statistical average value of the sub-band coefficients. The embed strength was determined adaptively according to the auditory masking property. Experiments show that the embedded watermark has better robustness against common signal processing attacks than present algorithms based on LWT and can resist random cropping in particular.