2020
DOI: 10.1016/j.patcog.2020.107415
|View full text |Cite
|
Sign up to set email alerts
|

A robust matching pursuit algorithm using information theoretic learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 39 publications
(58 reference statements)
0
1
0
Order By: Relevance
“…The typical algorithms using convex relaxation are Basis Pursuit (BP) [15] algorithm, Gradient Projection for Sparse Reconstruction (GPSR) [16] algorithm and Interior Point Method (IPM) [17] algorithm. Greedy algorithms [18,19] update the estimated signal support set iteratively to approximate the target signal, which includes two basic steps: atomic selection and signal updating estimation. Typical greedy algorithms mainly include Matching Pursuit (MP) [20] algorithm, Orthogonal Matching Pursuit (OMP) [21] algorithm and Compressive Sampling Matching Pursuit (CoSaMP) [19] algorithm.…”
Section: The Classical Framework Of Compressed Sensingmentioning
confidence: 99%
“…The typical algorithms using convex relaxation are Basis Pursuit (BP) [15] algorithm, Gradient Projection for Sparse Reconstruction (GPSR) [16] algorithm and Interior Point Method (IPM) [17] algorithm. Greedy algorithms [18,19] update the estimated signal support set iteratively to approximate the target signal, which includes two basic steps: atomic selection and signal updating estimation. Typical greedy algorithms mainly include Matching Pursuit (MP) [20] algorithm, Orthogonal Matching Pursuit (OMP) [21] algorithm and Compressive Sampling Matching Pursuit (CoSaMP) [19] algorithm.…”
Section: The Classical Framework Of Compressed Sensingmentioning
confidence: 99%