An improved algorithm based on LAOMP

It is extremely important to choose the optimal support set atoms in the reconstruction algorithm based on compressed sensing. The Look Ahead Orthogonal Matching Pursuit (LAOMP) is a commonly used reconstruction algorithm. However, in most cases, with the sparsity of signal unknown, we search every...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2018-07, Vol.1053 (1), p.12012
Main Authors: Wang, Bin, Wu, Deyang, Wang, Li, Xin, Fengming, Song, Xin
Format: Article
Language:English
Subjects:
Algorithms
Matched pursuit
Matching
Physics
Reconstruction
Sparsity
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is extremely important to choose the optimal support set atoms in the reconstruction algorithm based on compressed sensing. The Look Ahead Orthogonal Matching Pursuit (LAOMP) is a commonly used reconstruction algorithm. However, in most cases, with the sparsity of signal unknown, we search every time for the fixed L iteration times not to guarantee that the selected atoms be optimal. To solve this problem, the Sparsity Adapitive Look Ahead Orthogonal Matching Pursuit (SALAOMP) is proposed. Simulation results show that its Average Support Cardinality Error (ASCE) performance and Exact Reconstruction Probability (ERP) performance are superior to the LAOMP algorithm.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1053/1/012012