Results 11 to 20 of about 768,860 (284)
Matching Pursuit With Stochastic Selection [PDF]
Publication in the conference proceedings of EUSIPCO, Bucharest, Romania ...
Peel, Thomas +3 more
core +7 more sources
Expectation maximization based matching pursuit [PDF]
A novel expectation maximization based matching pursuit (EMMP) algorithm is presented. The method uses the measurements as the incomplete data and obtain the complete data which corresponds to the sparse solution using an iterative EM based framework. In standard greedy methods such as matching pursuit or orthogonal matching pursuit a selected atom can
Ali Cafer Gürbüz +2 more
core +8 more sources
A Posteriori Quantized Matching Pursuit. [PDF]
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit properties. The coefficients energy in Matching Pursuit indeed decreases with the iteration number, and the decay rate can be upper-bounded with an exponential curve driven by ...
Frossard, P., Vandergheynst, P.
core +5 more sources
Preconditioned generalized orthogonal matching pursuit
Recently, compressed sensing (CS) has aroused much attention for that sparse signals can be retrieved from a small set of linear samples. Algorithms for CS reconstruction can be roughly classified into two categories: (1) optimization-based algorithms ...
Zhishen Tong +4 more
doaj +1 more source
Multipath Matching Pursuit [PDF]
In this paper, we propose an algorithm referred to as multipath matching pursuit that investigates multiple promising candidates to recover sparse signals from compressed measurements. Our method is inspired by the fact that the problem to find the candidate that minimizes the residual is readily modeled as a combinatoric tree search problem and the ...
Suhyuk, Kwon, Wang, Jian, Shim, Byonghyo
openaire +2 more sources
A CONSTRAINED MATCHING PURSUIT APPROACH TO AUDIO DECLIPPING [PDF]
© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new ...
Emiya, Valentin +18 more
core +4 more sources
Recovery of Sparse Signals via Modified Hard Thresholding Pursuit Algorithms
In this paper, we propose a modified version of the hard thresholding pursuit algorithm, called modified hard thresholding pursuit (MHTP), using a convex combination of the current and previous points.
Li-Ping Geng +3 more
doaj +1 more source
An Improved Compression Sampling Matching Pursuit Algorithm
Least Square (LS) estimation method in Orthogonal Frequency Division Multiplexing (OFDM) system ignores the noise effect in the process of choosing the residual of atom update.
Fang LEI +4 more
doaj +1 more source
Sequential Sparse Matching Pursuit [PDF]
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 +3 more sources
Perturbed Orthogonal Matching Pursuit [PDF]
Compressive Sensing theory details how a sparsely represented signal in a known basis can be reconstructed with an underdetermined linear measurement model. However, in reality there is a mismatch between the assumed and the actual bases due to factors such as discretization of the parameter space defining basis components, sampling jitter in A/D ...
Oguzhan Teke +2 more
openaire +5 more sources

