Improved Generalized Sparsity Adaptive Matching Pursuit Algorithm Based on Compressive Sensing
The modified adaptive orthogonal matching pursuit algorithm has a lower convergence speed. To overcome this problem, an improved method with faster convergence speed is proposed. In respect of atomic selection, the proposed method computes the correlation between the measurement matrix and residual...
Main Authors: | Zhao Liquan, Ma Ke, Jia Yanfei |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Journal of Electrical and Computer Engineering |
Online Access: | http://dx.doi.org/10.1155/2020/2782149 |
Similar Items
-
A Sparsity Preestimated Adaptive Matching Pursuit Algorithm
by: Xinhe Zhang, et al.
Published: (2021-01-01) -
An Improved Sparsity Adaptive Matching Pursuit Algorithm and Its Application in Shock Wave Testing
by: Jiahui Zhang, et al.
Published: (2021-01-01) -
Robust Sparsity Updating Subspace Pursuit with Sparsity Estimation for Compressive Sensing Reconstruction
by: Chang, Li, et al.
Published: (2014) -
Fast sparsity adaptive matching pursuit algorithm for large-scale image reconstruction
by: Shihong Yao, et al.
Published: (2018-04-01) -
A Weak Selection Stochastic Gradient Matching Pursuit Algorithm
by: Liquan Zhao, et al.
Published: (2019-05-01)