Results 31 to 40 of about 768,860 (284)
Oblique Matching Pursuit [PDF]
IEEE Signal Processing Letters, 2007 Last version- as it will appear in IEEE SPL. IEEE Signal Processing Letters (in press)
openaire +2 more sources
, 2008 Sparse signal approximations have become a fundamental tool in signal processing with wide ranging applications from source separation to signal acquisition.
Blumensath, T. +2 more
core +1 more source
CoRR, 2019 Matching pursuit algorithms are an important class of algorithms in signal processing and machine learning. We present a blended matching pursuit algorithm, combining coordinate descent-like steps with stronger gradient descent steps, for minimizing a smooth convex function over a linear space spanned by a set of atoms.
Cyrille W. Combettes, Sebastian Pokutta
openaire +3 more sources
Iterative thresholding for sparse approximations [PDF]
, 2008 Sparse signal expansions represent or approximate a signal using a small number of elements from a large collection of elementary waveforms. Finding the optimal sparse expansion is known to be NP hard in general and non-optimal strategies such as ...
Blumensath, T. +3 more
core +1 more source
GRADIENT POLYTOPE FACES PURSUIT FOR LARGE SCALE SPARSE RECOVERY PROBLEMS [PDF]
, 2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), Dallas, TX, 14-19 March ...
Gretsistas, A +2 more
core +5 more sources
Matching pursuits video coding: dictionaries and fast implementation [PDF]
, 2000 Matching pursuits over a basis of separable Gabor functions has been demonstrated to outperform DCT methods for displaced frame difference coding for video compression.
Czerepinski, PJ +3 more
core +1 more source
Journal of Low Frequency Noise, Vibration and Active Control, 2021 This paper proposes a direction of arrival estimation based on sparse signal reconstruction in the presence of alpha noise by the off-grid orthogonal matching pursuit algorithm.
LongKai Liang +3 more
doaj +1 more source
Online Orthogonal Matching Pursuit
CoRR, 2020 Greedy algorithms for feature selection are widely used for recovering sparse high-dimensional vectors in linear models. In classical procedures, the main emphasis was put on the sample complexity, with little or no consideration of the computation resources required.
Saad, El Mehdi +2 more
openaire +3 more sources
Audio Matching Pursuit Algorithm Based on Atomic Preselection [PDF]
Jisuanji gongcheng, 2016 The Matching Pursuit(MP) is a sparse expression greedy algorithm which is applied to signal processing.Its computation complexity is high due to traversalmatching in atom selection,and the matching process has to know the complete signal needed to be ...
HU Xia,YANG Yuhong,JIANG Lin
doaj +1 more source
Consistency in quantized matching pursuit [PDF]
1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings, 2002 This paper explores the effects of coefficient quantization in applying the matching pursuit algorithm to source coding of vectors in R/sup N/. By considering the issue of consistency, we find that even though matching pursuit is designed to produce a linear combination to estimate a given source vector, optimal reconstruction in the presence of ...
Goyal, Vivek K., Vetterli, Martin
openaire +2 more sources