2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013) 2013
DOI: 10.1109/icspcc.2013.6663917
|View full text |Cite
|
Sign up to set email alerts
|

Variable step size stagewise adaptive matching pursuit algorithm for image compressed sensing

Abstract: compressed sensing is a widely used framework for signal reconstruction. In order to handle some practical cases in which the sparsity level is unknown, we present an improved sparsity adaptive matching pursuit (SAMP) algorithm, named variable step size stagewise adaptive matching pursuit (VSStAMP) algorithm. The proposed algorithm alternatively estimates the sparsity level and the support set of signal stage by stage. The attractive characteristic is that VSStAMP can adaptively choose the best matched estimat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 20 publications
(22 reference statements)
0
7
0
Order By: Relevance
“…e IKSVD method is proposed in the paper to solve the above problems. IKSVD uses self-adaptive matching pursuit (SAMP) [28] for sparse coding instead of OMP in KSVD. Sparsity of the sparse coefficients could be described adaptively by changing step length, and the reason is that sparsity of the sparse coefficients does not need to be known.…”
Section: Iksvdmentioning
confidence: 99%
See 1 more Smart Citation
“…e IKSVD method is proposed in the paper to solve the above problems. IKSVD uses self-adaptive matching pursuit (SAMP) [28] for sparse coding instead of OMP in KSVD. Sparsity of the sparse coefficients could be described adaptively by changing step length, and the reason is that sparsity of the sparse coefficients does not need to be known.…”
Section: Iksvdmentioning
confidence: 99%
“…e sparse representation self-learning dictionary method such as KSVD could capture the characteristic components hidden in the vibration signal without prior knowledge of the analyzed signal such as wavelet transform. Besides, it has virtue of strong noise robustness and has been applied in fault diagnosis of rotating machinery widely [26][27][28]. Consequently, a rotating machinery fault diagnosis method by combing sparse representation self-learning dictionary with FSC is proposed in the paper.…”
Section: Introductionmentioning
confidence: 99%
“…It reconstructs channel information through stage by stage estimation of the sparsity level and the true support set of the target signals [18]. However, one of the shortcomings of SAMP is the fixed step size, which easily results in the contradiction between the convergence speed and the recovery accuracy of the algorithm [19,20].…”
Section: Background Knowledgementioning
confidence: 99%
“…The channel of other receive antennas is also estimated according to the above methods. Unlike conventional greedy iteration CS reconstruction schemes such as OMP and CoSaMP, where the number of iterations is the value of channel sparsity level [20], the proposed scheme stops iteration only when the residual is close to 0 (‖r t ‖ 2 < ε). Therefore, the reconstruction accuracy can be guaranteed.…”
Section: Inputmentioning
confidence: 99%
“…Thus, there is a trade‐off between step size and overall performance of the algorithm. This is addressed by making the step‐size variable or adaptive as proposed in the previous studies . This paper mainly contributes to the following: Design of STBC‐SM‐based hybrid MIMO‐ACO‐OFDM for indoor VLC and its channel estimation using CS algorithms. Proposing a new bandwidth‐efficient CS algorithm for channel estimation with faster convergence and adaptive step size to determine sparsity using deterministic threshold. …”
Section: Introductionmentioning
confidence: 99%