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...

Celý popis

Podrobná bibliografia

Vydané v:	Numerical linear algebra with applications Ročník 22; číslo 2; s. 254 - 282
Hlavní autori:	Blanchard, Jeffrey D., Tanner, Jared
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Blackwell Publishing Ltd 01.03.2015 Wiley Subscription Services, Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!