Audio watermarking via EMD
Tatouage audio par EMD
Article dans une revue avec comité de lecture
Date
2013Journal
IEEE Transactions on Audio, Speech and Language ProcessingRésumé
In this paper a new adaptive audio watermarking algorithm based on Empirical Mode Decomposition (EMD) is introduced. The audio signal is divided into frames and each one is decomposed adaptively, by EMD, into intrinsic oscillatory components called Intrinsic Mode Functions (IMFs). The watermark and the synchronization codes are embedded into the extrema of the last IMF, a low frequency mode stable under different attacks and preserving audio perceptual quality of the host signal. The data embedding rate of the proposed algorithm is 46.9–50.3 b/s. Relying on exhaustive simulations, we show the robustness of the hidden watermark for additive noise, MP3 compression, re-quantization, filtering, cropping and resampling. The comparison analysis shows that our method has better performance than watermarking schemes reported recently.
Fichier(s) constituant cette publication
Cette publication figure dans le(s) laboratoire(s) suivant(s)
Documents liés
Visualiser des documents liés par titre, auteur, créateur et sujet.
-
Article dans une revue avec comité de lectureIn this paper a speech denoising strategy based on time adaptive thresholding of intrinsic modes functions (IMFs) of the signal, extracted by empirical mode decomposition (EMD), is introduced. The denoised signal is ...
-
Article dans une revue avec comité de lectureIn this paper a new method for voiced speech enhancement combining the Empirical Mode Decomposition (EMD) and the Adaptive Center Weighted Average (ACWA) filter is introduced. Noisy signal is decomposed adaptively into ...
-
Article dans une revue avec comité de lectureIn this letter a new signals coding framework based on the Empirical Mode Decomposition (EMD) is introduced. The EMD breaks down any signal into a reduced number of oscillating components called Intrinsic Modes Decomposition ...
-
Communication avec acteIn this paper, we present a spectral similarity measure between two graphs based on a correlation measure between the spectra of their representation matrices Tα := αD+(1−2α)A, parametrized by 0 ≤ α ≤ 1, where A and D are ...
-
Article dans une revue avec comité de lectureIn spite of the simple linear relationship between the adjacency A and the Laplacian L matrices, L=D-A where D is the degrees matrix, these matrices seem to reveal informations about the graph in different ways, where it ...