z-logo
Premium
Theory and applications of compressed sensing
Author(s) -
Kutyniok Gitta
Publication year - 2013
Publication title -
gamm‐mitteilungen
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.239
H-Index - 18
eISSN - 1522-2608
pISSN - 0936-7195
DOI - 10.1002/gamm.201310005
Subject(s) - compressed sensing , key (lock) , computer science , frame (networking) , representation (politics) , basis (linear algebra) , sparse approximation , algorithm , theoretical computer science , data mining , mathematics , telecommunications , geometry , computer security , politics , political science , law
Compressed sensing is a novel research area, which was introduced in 2006, and since then has already become a key concept in various areas of applied mathematics, computer science, and electrical engineering. It surprisingly predicts that high‐dimensional signals, which allow a sparse representation by a suitable basis or, more generally, a frame, can be recovered from what was previously considered highly incomplete linear measurements by using efficient algorithms. This article shall serve as an introduction to and a survey about compressed sensing. (© 2013 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom