2016
DOI: 10.1109/tst.2016.7399284
|View full text |Cite
|
Sign up to set email alerts
|

A reducing iteration orthogonal matching pursuit algorithm for compressive sensing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 30 publications
(14 citation statements)
references
References 0 publications
0
12
0
Order By: Relevance
“…This problem becomes a convex optimization problem. The typical reconstruction algorithm can be the greed tracking method [24], convex relaxation method [25], or combination method [26].…”
Section: Basic Theory Of Compressive Sensingmentioning
confidence: 99%
“…This problem becomes a convex optimization problem. The typical reconstruction algorithm can be the greed tracking method [24], convex relaxation method [25], or combination method [26].…”
Section: Basic Theory Of Compressive Sensingmentioning
confidence: 99%
“…In the CS framework, recovering the original signal from the compressed data represents a significant challenge. In the literature, many sparse signal reconstruction methods have already been presented [12,13]. They can be classified into three major categories: convex relaxation, non-convex relaxation, and greedy algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…It is based on the principle that a sparse signal can be reconstructed from far fewer samples than those required by the classical Shannon-Nyquist sampling theorem by finding the sparsest solution to the underdetermined linear systems. The two essential conditions under the signal reconstruction are sparsity and incoherence [7] . The compressibility and computational asymmetry of the CS theory have made data collection of resource-constrained WSNs very practicable.…”
Section: Introductionmentioning
confidence: 99%