Performance comparisons of greedy algorithms in compressed sensing

SummaryCompressed sensing has motivated the development of numerous sparse approximation algorithms designed to return a solution to an underdetermined system of linear equations where the solution has the fewest number of nonzeros possible, referred to as the sparsest solution. In the compressed se...

Full description

Bibliographic Details

Published in:	Numerical linear algebra with applications Vol. 22; no. 2; pp. 254 - 282
Main Authors:	Blanchard, Jeffrey D., Tanner, Jared
Format:	Journal Article
Language:	English
Published:	Oxford Blackwell Publishing Ltd 01.03.2015 Wiley Subscription Services, Inc
Subjects:	Balancing Compressed compressed sensing Computational efficiency Detection GPU computing greedy algorithm Greedy algorithms hard thresholding Mathematical analysis Mathematical models Recovery sparse approximation
ISSN:	1070-5325, 1099-1506
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!