Optimal Estimation of Wavelet Decomposition Level for a Matching Pursuit Algorithm

In this paper, we consider the application of the matching pursuit algorithm (MPA) for spectral analysis of non-stationary signals. First, we estimate the approximation error and the performance time for various MPA modifications and parameters using central processor unit and graphics processing unit (GPU) to identify possible ways to improve the algorithm. Next, we propose the modifications of discrete wavelet transform (DWT) and package wavelet decomposition (PWD) for further use in MPA. We explicitly show that the optimal decomposition level, defined as a level with minimum entropy, in DWT and PWD provides the minimum approximation error and the smallest execution time when applied in MPA as a rough estimate in the case of using wavelets as basis functions (atoms). We provide an example of entropy-based estimation for optimal decomposition level in spectral analysis of seismic signals. The proposed modification of the algorithm significantly reduces its computational costs. Results of spectral analysis obtained with MPA can be used for various signal processing applications, including denoising, clustering, classification, and parameter estimation.

[1]  L. Rabiner,et al.  Multirate digital signal processing: Prentice-Hall, Inc. Englewood Cliffs, New Jersey 07362, 1983, 411 pp., ISBN 0-13-605162-6 , 1983 .

[2]  Stéphane Mallat,et al.  A Wavelet Tour of Signal Processing, 2nd Edition , 1999 .

[3]  Michael M. Goodwin,et al.  Matching pursuit with damped sinusoids , 1997, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  N. Huang,et al.  The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis , 1998, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[5]  Bogdan Dumitrescu,et al.  On the number of iterations for the matching pursuit algorithm , 2017, 2017 25th European Signal Processing Conference (EUSIPCO).

[6]  Michalis Vazirgiannis,et al.  Orthogonal Matching Pursuit for Text Classification , 2018, NUT@EMNLP.

[7]  M. Goodwin,et al.  Atomic decompositions of audio signals , 1997, Proceedings of 1997 Workshop on Applications of Signal Processing to Audio and Acoustics.

[8]  Cancan Yi,et al.  Enhanced Orthogonal Matching Pursuit Algorithm and Its Application in Mechanical Equipment Fault Diagnosis , 2017 .

[9]  Pankaj Sharma,et al.  Selection of Optimal Decomposition Level Based on Entropy for Speech Denoising Using Wavelet Packet , 2012 .

[10]  I. Johnstone,et al.  Ideal denoising in an orthonormal basis chosen from a library of bases , 1994 .

[11]  Emmanuel Ifeachor,et al.  Digital Signal Processing: A Practical Approach , 1993 .

[12]  Ronald R. Coifman,et al.  Entropy-based algorithms for best basis selection , 1992, IEEE Trans. Inf. Theory.

[13]  A. A. Kim,et al.  Modernization of adaptive matching pursuit method to analyze geophysical signals of pulse nature , 2018 .

[14]  Pierre Vandergheynst,et al.  A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[15]  Edward A. Lee,et al.  Adaptive Signal Models: Theory, Algorithms, and Audio Applications , 1998 .

[16]  S. Biyiksiz,et al.  Multirate digital signal processing , 1985, Proceedings of the IEEE.

[17]  Martin Jaggi,et al.  A Unified Optimization View on Generalized Matching Pursuit and Frank-Wolfe , 2017, AISTATS.

[18]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[19]  Martin Vetterli,et al.  Atomic signal models based on recursive filter banks , 1997, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136).