Greedy algorithms for compressed sensing

Michael Davies, Gabriel Rilling, Thomas Blumensath

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)

Abstract

Compressed sensing (CS) is often synonymous with£ 1-based optimization. However, when choosing an algorithm for a particular application, there is a range of different properties that have to be considered and weighed against each other. Important algorithm properties, such as speed and storage requirements, ease of implementation, flexibility, and recovery performance have to be compared. In this chapter we will therefore present a range of alternative algorithms that can be used to solve the CS recovery problem and which ...
Original languageEnglish
Title of host publicationCompressed Sensing
Subtitle of host publicationTheory and Applications
EditorsYonina Eldar, Gitta Kutyniok
PublisherCambridge University Press
Pages348-393
Number of pages45
ISBN (Print)978-1-107-00558-7
Publication statusPublished - 2012

Fingerprint

Dive into the research topics of 'Greedy algorithms for compressed sensing'. Together they form a unique fingerprint.

Cite this