Preconditioning for Underdetermined Linear Systems with Sparse Solutions. Tsiligianni, E., Kondi, L. P., & Katsaggelos, A. K. IEEE Signal Processing Letters, 22(9):1239–1243, sep, 2015. ![Preconditioning for Underdetermined Linear Systems with Sparse Solutions [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex 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.
@article{Evaggelia2015,
abstract = {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.},
author = {Tsiligianni, Evaggelia and Kondi, Lisimachos P. and Katsaggelos, Aggelos K.},
doi = {10.1109/LSP.2015.2392000},
issn = {1070-9908},
journal = {IEEE Signal Processing Letters},
keywords = {Compressed sensing,incoherent unit norm tight frames,preconditioning,sparse representations},
month = {sep},
number = {9},
pages = {1239--1243},
title = {{Preconditioning for Underdetermined Linear Systems with Sparse Solutions}},
url = {http://ieeexplore.ieee.org/document/7008458/},
volume = {22},
year = {2015}
}
Downloads: 0
{"_id":"DjGwjjRhdvYrWJXKq","bibbaseid":"tsiligianni-kondi-katsaggelos-preconditioningforunderdeterminedlinearsystemswithsparsesolutions-2015","author_short":["Tsiligianni, E.","Kondi, L. P.","Katsaggelos, A. K."],"bibdata":{"bibtype":"article","type":"article","abstract":"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.","author":[{"propositions":[],"lastnames":["Tsiligianni"],"firstnames":["Evaggelia"],"suffixes":[]},{"propositions":[],"lastnames":["Kondi"],"firstnames":["Lisimachos","P."],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["Aggelos","K."],"suffixes":[]}],"doi":"10.1109/LSP.2015.2392000","issn":"1070-9908","journal":"IEEE Signal Processing Letters","keywords":"Compressed sensing,incoherent unit norm tight frames,preconditioning,sparse representations","month":"sep","number":"9","pages":"1239–1243","title":"Preconditioning for Underdetermined Linear Systems with Sparse Solutions","url":"http://ieeexplore.ieee.org/document/7008458/","volume":"22","year":"2015","bibtex":"@article{Evaggelia2015,\nabstract = {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.},\nauthor = {Tsiligianni, Evaggelia and Kondi, Lisimachos P. and Katsaggelos, Aggelos K.},\ndoi = {10.1109/LSP.2015.2392000},\nissn = {1070-9908},\njournal = {IEEE Signal Processing Letters},\nkeywords = {Compressed sensing,incoherent unit norm tight frames,preconditioning,sparse representations},\nmonth = {sep},\nnumber = {9},\npages = {1239--1243},\ntitle = {{Preconditioning for Underdetermined Linear Systems with Sparse Solutions}},\nurl = {http://ieeexplore.ieee.org/document/7008458/},\nvolume = {22},\nyear = {2015}\n}\n","author_short":["Tsiligianni, E.","Kondi, L. P.","Katsaggelos, A. K."],"key":"Evaggelia2015","id":"Evaggelia2015","bibbaseid":"tsiligianni-kondi-katsaggelos-preconditioningforunderdeterminedlinearsystemswithsparsesolutions-2015","role":"author","urls":{"Paper":"http://ieeexplore.ieee.org/document/7008458/"},"keyword":["Compressed sensing","incoherent unit norm tight frames","preconditioning","sparse representations"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://sites.northwestern.edu/ivpl/files/2023/06/IVPL_Updated_publications-1.bib","dataSources":["KTWAakbPXLGfYseXn","ePKPjG8C6yvpk4mEK","ya2CyA73rpZseyrZ8","D8k2SxfC5dKNRFgro","7Dwzbxq93HWrJEhT6","qhF8zxmGcJfvtdeAg","fvDEHD49E2ZRwE3fb","H7crv8NWhZup4d4by","DHqokWsryttGh7pJE","vRJd4wNg9HpoZSMHD","sYxQ6pxFgA59JRhxi","w2WahSbYrbcCKBDsC","XasdXLL99y5rygCmq","3gkSihZQRfAD2KBo3","t5XMbyZbtPBo4wBGS","bEpHM2CtrwW2qE8FP","teJzFLHexaz5AQW5z"],"keywords":["compressed sensing","incoherent unit norm tight frames","preconditioning","sparse representations"],"search_terms":["preconditioning","underdetermined","linear","systems","sparse","solutions","tsiligianni","kondi","katsaggelos"],"title":"Preconditioning for Underdetermined Linear Systems with Sparse Solutions","year":2015}