2016
DOI: 10.1016/j.jare.2016.08.005
|View full text |Cite
|
Sign up to set email alerts
|

RMP: Reduced-set matching pursuit approach for efficient compressed sensing signal reconstruction

Abstract: Graphical abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
16
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(16 citation statements)
references
References 23 publications
0
16
0
Order By: Relevance
“…The support (non-zero) indices of the sparse signals are expected to have relatively large magnitudes of correlation. A number of highest magnitude components of correlated values are chosen in every iteration, and their indices are added to a set of identified supports [19,32,37]. Generally, greedy algorithm exhibit good performance when the prior information on the sparsity of signal (number of the non-zero components) is known.…”
Section: Sparse Recoverymentioning
confidence: 99%
See 2 more Smart Citations
“…The support (non-zero) indices of the sparse signals are expected to have relatively large magnitudes of correlation. A number of highest magnitude components of correlated values are chosen in every iteration, and their indices are added to a set of identified supports [19,32,37]. Generally, greedy algorithm exhibit good performance when the prior information on the sparsity of signal (number of the non-zero components) is known.…”
Section: Sparse Recoverymentioning
confidence: 99%
“…However, the samples obtained at or above the Nyquist rate are not fully needed to represent a signal in light of the fact that, from this tremendous acquired samples, a significant portion is immediately discarded and relatively a few important ones are stored at the compression stage. In order to eliminate the collection of unnecessary samples, the compressive sensing (CS) method is proposed that combines compression with signal acquisition step [17,18,19]. CS technique provides the capability to recover the signal from fewer samples or measurements than the conventional approach of reconstructing a signal from acquired data which is governed by the Shannon-Nyquist sampling theorem [16,19,20,21].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The core purpose of CS framework is to efficiently recover the raw signal with high accuracy from the compressed data, thus, a variety of methodologies have been proposed in recent years. Roughly, the existing construction algorithms can be divided into four classes: greedy pursuit algorithms such as matching pursuit (MP) [ 11 ], orthogonal matching pursuit (OMP) [ 12 , 13 ], etc. ; convex regularization methods such as the family of L1-norm [ 14 ]; non-convex regularization methods such as the family of nonconvex Lp-norm (0 < p < 1) [ 15 , 16 ]; and sparse low rank matrix (SLRM) approaches such as non-separable SLRM regularization [ 17 , 18 , 19 ], etc.…”
Section: Introductionmentioning
confidence: 99%
“…greedy pursuit algorithms such as matching pursuit (MP) [ 11 ], orthogonal matching pursuit (OMP) [ 12 , 13 ], etc. ;…”
Section: Introductionmentioning
confidence: 99%