Maximal-minimal correlation atoms algorithm for sparse recovery

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

A new iterative algorithm is proposed to reconstruct an unknown sparse signal from a set ol projected measurements. Unl ike existing greedy pursuit methods which only consider the atoms having the highest correlation with the residual signal, the prop osed algorithm not only considers the higher correlation atoms but also reserves the lower correlation atoms with the residual signal. In the lower correlation atoms, only a tew are correct which usually impact the reconstructive performance and decide the rec onstruction dynamic range of greedy pursuit methods. The others are redundant. In order to avoid redundant atoms impacting the reconstructive accuracy, the Bayesian pursuit algorithm is used to eliminate them. Simulation results show that the proposed alg orithm can improve the reconstructive dynamic range and the reconstructive accuracy. Furthermore, better noise immunity comp ared with the existing greedy pursuit methods can be obtained.

Cite

CITATION STYLE

APA

Gan, W., Xu, L., & Zhang, H. (2013). Maximal-minimal correlation atoms algorithm for sparse recovery. Journal of Systems Engineering and Electronics, 24(4), 579–585. https://doi.org/10.1109/JSEE.2013.00067

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free