A Sparse Recovery Algorithm Based on Arithmetic Optimization
At present, the sparse recovery problem is mainly solved by convx optimization algorithm and greedy tracking method. However, the former has defects in recovery efficiency and the latter in recovery ability, and neither of them can obtain effective recovery under large sparsity or small observation...
Main Authors: | Qingfeng Zhang, Dong Hu, Chao Tang, Jufang Xie |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-12-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/12/1/162 |
Similar Items
-
A Review of Sparse Recovery Algorithms
by: Elaine Crespo Marques, et al.
Published: (2019-01-01) -
A Survey of Sparse Representation: Algorithms and Applications
by: Zheng Zhang, et al.
Published: (2015-01-01) -
A Fast and Noise-Robust Algorithm for Joint Sparse Recovery Through Information Transfer
by: Nam Yul Yu
Published: (2019-01-01) -
Conjugate Gradient Hard Thresholding Pursuit Algorithm for Sparse Signal Recovery
by: Yanfeng Zhang, et al.
Published: (2019-02-01) -
GPS Signal Acquisition Based on Compressive Sensing and Modified Greedy Acquisition Algorithm
by: Guodong He, et al.
Published: (2019-01-01)