Preconditioning for Underdetermined Linear Systems with Sparse Solutions

• Published in: IEEE signal processing letters 2015-09, Vol.22 (9), p.1239-1243
• Main Authors: Tsiligianni, Evaggelia, Kondi, Lisimachos P., Katsaggelos, Aggelos K.
• Format: Article
• Language: English
• Subjects: Compressed sensing; Dictionaries; incoherent unit norm tight frames; Linear systems; Minimization; preconditioning; Signal processing algorithms; Sparse matrices; sparse representations; Vectors
• ISSN: 1070-9908; 1558-2361
• DOI: 10.1109/LSP.2015.2392000

Performance guarantees for the algorithms deployed to solve underdetermined linear systems with sparse solutions are based on the assumption that the involved system matrix has the form of an incoherent unit norm tight frame. Learned dictionaries, which are popular in sparse representations, often do not meet the necessary conditions for signal recovery. In compressed sensing (CS), recovery rates have been improved substantially with optimized projections; however, these techniques do not produce binary matrices, which are more suitable for hardware implementation. In this paper, we consider an underdetermined linear system with sparse solutions and propose a preconditioning technique that yields a system matrix having the properties of an incoherent unit norm tight frame. While existing work in preconditioning concerns greedy algorithms, the proposed technique is based on recent theoretical results for standard numerical solvers such as BP and OMP. Our simulations show that the proposed preconditioning improves the recovery rates both in sparse representations and CS; the results for CS are comparable to optimized projections.