Affiliation:
1. University of Warsaw, Poland
Abstract
This article introduces an effective approach to performing matching pursuit calculations with continuous (quasi-infinite) dictionaries. Simulating continuous parameter space is accomplished by combining optimal dictionary construction as introduced previously with local parameter optimization. At the same time, the calculations can be performed not only with Gabor atoms, but with any type of oscillating atoms, or even multiple types of atoms at once. The proposed method is confirmed by introducing a first stable version of a high-performance implementation
empi
, supporting calculations with continuous as well as discrete dictionaries, further accelerated by the use of multi-threading and GPU support.
Publisher
Association for Computing Machinery (ACM)
Reference21 articles.
1. Remark AS R15: Function Minimization Using a Simplex Procedure. Journal of the Royal Statistical Society;Benyon P. R.;Series C (Applied Statistics),1976
2. Remark AS R11: A Remark on Algorithm AS 47;Chambers John M.;Journal of the Royal Statistical Society. Series C (Applied Statistics),1974
3. G. Davis Stéphane G. Mallat and M. Avellaneda. 1997. Adaptive greedy approximations. Constructive Approximation 13 1 (01 Mar 1997) 57–98. https://doi.org/10.1007/BF02678430
4. Piotr J. Durka. 2007. Matching Pursuit and Unification in EEG analysis. Artech House, Norwood, MA. ISBN 978-1-58053-304-1.
5. Two-Stage Atomic Decomposition of Multichannel EEG and the Previously Undetectable Sleep Spindles;Durka Piotr J.;Sensors,2024