Results 21 to 30 of about 19,772 (299)

Constrained Backtracking Matching Pursuit Algorithm for Image Reconstruction in Compressed Sensing

open access: yesApplied Sciences, 2021
Image reconstruction based on sparse constraints is an important research topic in compressed sensing. Sparsity adaptive matching pursuit (SAMP) is a greedy pursuit reconstruction algorithm, which reconstructs signals without prior information of the ...
Xue Bi   +5 more
doaj   +1 more source

Underdetermined noisy blind separation using dual matching pursuits [PDF]

open access: yes, 2004
Underdetermined blind source separation is a key application in audio where it is desirable to extract multiple sources from a stereo recording. A new variant on the stereo matching pursuit, the dual matching pursuit, is presented whereby independent ...
Sugden, P, Canagarajah, CN, Sugden, Paul
core   +1 more source

Oblique Matching Pursuit [PDF]

open access: yesIEEE Signal Processing Letters, 2007
Last version- as it will appear in IEEE SPL. IEEE Signal Processing Letters (in press)
openaire   +2 more sources

Online Orthogonal Matching Pursuit

open access: yesCoRR, 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.
El Mehdi Saad   +2 more
openaire   +2 more sources

Sequential Sparse Matching Pursuit [PDF]

open access: yes2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2009
We propose a new algorithm, called Sequential Sparse Matching Pursuit (SSMP), for solving sparse recovery problems. The algorithm provably recovers a k-sparse approximation to an arbitrary n-dimensional signal vector x from only O(k log(n/k)) linear measurements of x. The recovery process takes time that is only near-linear in n.
Berinde, Radu, Indyk, Piotr
openaire   +2 more sources

Dynamic Orthogonal Matching Pursuit for Sparse Data Reconstruction

open access: yesIEEE Open Journal of Signal Processing, 2023
The orthogonal matching pursuit (OMP) is one of the mainstream algorithms for sparse data reconstruction or approximation. It acts as a driving force for the development of several other greedy methods for sparse data reconstruction, and it also plays a ...
Yun-Bin Zhao, Zhi-Quan Luo
doaj   +1 more source

Generalized Orthogonal Matching Pursuit [PDF]

open access: yesIEEE Transactions on Signal Processing, 2012
As a greedy algorithm to recover sparse signals from compressed measurements, orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we introduce an extension of the OMP for pursuing efficiency in reconstructing sparse signals.
Jian Wang 0016   +2 more
openaire   +2 more sources

Quantum matching pursuit algorithms [PDF]

open access: yes, 2022
LAUREA MAGISTRALEIl machine learning quantistico è una disciplina emergente che combina i benefici del calcolo quantistico con tecniche di machine learning.
VANERIO, STEFANO
core  

Blended Matching Pursuit

open access: yesCoRR, 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

Matching pursuits video coding: dictionaries and fast implementation [PDF]

open access: yes, 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

Home - About - Disclaimer - Privacy