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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Journal of Electrical and Computer Engineering |
| Online Access: | http://dx.doi.org/10.1155/2020/2782149 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832568661713354752 |
|---|---|
| author | Zhao Liquan Ma Ke Jia Yanfei |
| author_facet | Zhao Liquan Ma Ke Jia Yanfei |
| author_sort | Zhao Liquan |
| collection | DOAJ |
| description | 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 and then selects the atoms most related to residual to construct the candidate atomic set. The number of selected atoms is the integral multiple of initial step size. In respect of sparsity estimation, the proposed method introduces the exponential function to sparsity estimation. It uses a larger step size to estimate sparsity at the beginning of iteration to accelerate the algorithm convergence speed and a smaller step size to improve the reconstruction accuracy. Simulations show that the proposed method has better performance in terms of convergence speed and reconstruction accuracy for one-dimension signal and two-dimension signal. |
| format | Article |
| id | doaj-art-b5029bc57aca4b17ab3e58de121aea30 |
| institution | Kabale University |
| issn | 2090-0147 2090-0155 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Electrical and Computer Engineering |
| spelling | doaj-art-b5029bc57aca4b17ab3e58de121aea302025-02-03T00:58:41ZengWileyJournal of Electrical and Computer Engineering2090-01472090-01552020-01-01202010.1155/2020/27821492782149Improved Generalized Sparsity Adaptive Matching Pursuit Algorithm Based on Compressive SensingZhao Liquan0Ma Ke1Jia Yanfei2Key Laboratory of Modern Power System Simulation and Control & Renewable Energy Technology, Ministry of Education (Northeast Electric Power University), Jilin, ChinaKey Laboratory of Modern Power System Simulation and Control & Renewable Energy Technology, Ministry of Education (Northeast Electric Power University), Jilin, ChinaCollege of Electrical and Information Engineering, Beihua University, Jilin 132013, ChinaThe 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 and then selects the atoms most related to residual to construct the candidate atomic set. The number of selected atoms is the integral multiple of initial step size. In respect of sparsity estimation, the proposed method introduces the exponential function to sparsity estimation. It uses a larger step size to estimate sparsity at the beginning of iteration to accelerate the algorithm convergence speed and a smaller step size to improve the reconstruction accuracy. Simulations show that the proposed method has better performance in terms of convergence speed and reconstruction accuracy for one-dimension signal and two-dimension signal.http://dx.doi.org/10.1155/2020/2782149 |
| spellingShingle | Zhao Liquan Ma Ke Jia Yanfei Improved Generalized Sparsity Adaptive Matching Pursuit Algorithm Based on Compressive Sensing Journal of Electrical and Computer Engineering |
| title | Improved Generalized Sparsity Adaptive Matching Pursuit Algorithm Based on Compressive Sensing |
| title_full | Improved Generalized Sparsity Adaptive Matching Pursuit Algorithm Based on Compressive Sensing |
| title_fullStr | Improved Generalized Sparsity Adaptive Matching Pursuit Algorithm Based on Compressive Sensing |
| title_full_unstemmed | Improved Generalized Sparsity Adaptive Matching Pursuit Algorithm Based on Compressive Sensing |
| title_short | Improved Generalized Sparsity Adaptive Matching Pursuit Algorithm Based on Compressive Sensing |
| title_sort | improved generalized sparsity adaptive matching pursuit algorithm based on compressive sensing |
| url | http://dx.doi.org/10.1155/2020/2782149 |
| work_keys_str_mv | AT zhaoliquan improvedgeneralizedsparsityadaptivematchingpursuitalgorithmbasedoncompressivesensing AT make improvedgeneralizedsparsityadaptivematchingpursuitalgorithmbasedoncompressivesensing AT jiayanfei improvedgeneralizedsparsityadaptivematchingpursuitalgorithmbasedoncompressivesensing |