2021
DOI: 10.1049/ell2.12365
|View full text |Cite
|
Sign up to set email alerts
|

Sparse signal recovery from noisy measurements via searching forward OMP

Abstract: Recovering sparse signals from compressed measurements has received much attention in recent years. Considering that measurement errors always exist, an improved orthogonal matching pursuit (OMP) method which is called Searching Forward OMP (SFOMP), is proposed in this letter. The proposed SFOMP method is designed for compressive sensing and sparse signal recovery in the noisy environment. To improve the recovery performance, the SFOMP method incorporates a searching forward strategy to find the column leading… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 14 publications
(15 reference statements)
0
2
0
Order By: Relevance
“…Orthogonal matching pursuit (OMP) [2,3], the most classical greedy pursuit algorithm, encompasses two fundamental aspects of greedy pursuit algorithms: matching pursuit and least squares. Over the years, numerous novel greedy pursuit algorithms have been proposed to refine support set selection strategies based on OMP, such as generalized OMP (gOMP) [4], stagewise OMP (StOMP) [5], searching forward OMP (SFOMP) [6], regularized OMP (ROMP) [7], compressive sampling MP (CoSaMP) [8], subspace pursuit (SP) [9], and sparsity adaptive MP (SAMP) [10]. All of the above algorithms select multiple column vectors at each iteration, and the latter three algorithms employ techniques like backtracking or pruning to replace incorrect column vectors from the support set.…”
mentioning
confidence: 99%
“…Orthogonal matching pursuit (OMP) [2,3], the most classical greedy pursuit algorithm, encompasses two fundamental aspects of greedy pursuit algorithms: matching pursuit and least squares. Over the years, numerous novel greedy pursuit algorithms have been proposed to refine support set selection strategies based on OMP, such as generalized OMP (gOMP) [4], stagewise OMP (StOMP) [5], searching forward OMP (SFOMP) [6], regularized OMP (ROMP) [7], compressive sampling MP (CoSaMP) [8], subspace pursuit (SP) [9], and sparsity adaptive MP (SAMP) [10]. All of the above algorithms select multiple column vectors at each iteration, and the latter three algorithms employ techniques like backtracking or pruning to replace incorrect column vectors from the support set.…”
mentioning
confidence: 99%
“…Introduction: Sparse synthetic aperture radar (SAR) imaging is an emerging imaging scheme with the development of compressed sensing [1], which exploits sparse signal processing to replace matched filtering (MF) for image focusing. It can reconstruct SAR images and improve the image quality in down and full-sampling conditions [2,3].…”
mentioning
confidence: 99%