Recovery of Sparse Signals Using Multiple Orthogonal Least Squares

From MaRDI portal
Publication:4620727

DOI10.1109/TSP.2016.2639467zbMATH Open1414.94659arXiv1410.2505MaRDI QIDQ4620727FDOQ4620727


Authors: Jian Wang, Ping Li Edit this on Wikidata


Publication date: 8 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: We study the problem of recovering sparse signals from compressed linear measurements. This problem, often referred to as sparse recovery or sparse reconstruction, has generated a great deal of interest in recent years. To recover the sparse signals, we propose a new method called multiple orthogonal least squares (MOLS), which extends the well-known orthogonal least squares (OLS) algorithm by allowing multiple L indices to be chosen per iteration. Owing to inclusion of multiple support indices in each selection, the MOLS algorithm converges in much fewer iterations and improves the computational efficiency over the conventional OLS algorithm. Theoretical analysis shows that MOLS (L>1) performs exact recovery of all K-sparse signals within K iterations if the measurement matrix satisfies the restricted isometry property (RIP) with isometry constant deltaLK<fracsqrtLsqrtK+2sqrtL. The recovery performance of MOLS in the noisy scenario is also studied. It is shown that stable recovery of sparse signals can be achieved with the MOLS algorithm when the signal-to-noise ratio (SNR) scales linearly with the sparsity level of input signals.


Full work available at URL: https://arxiv.org/abs/1410.2505







Cited In (9)





This page was built for publication: Recovery of Sparse Signals Using Multiple Orthogonal Least Squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620727)