An Overview of Compressed Sensing and Sparse Signal Recovery via L1 Minimization

author:Emmanuel Candes, Department of Applied and Computational Mathematics, California Institute of Technology
published: July 30, 2009,   recorded: June 2009,   views: 1444
You might be experiencing some problems with Your Video player.

Related content

Visitors who watched this lecture also watched...
47:29
Sparse Representations from Inverse Problems to Pattern Recognition

470 views - Stéphane Mallat, 2009
01:07:14
Matrix Completion via Convex Optimization: Theory and Algorithms

464 views - Emmanuel Candes, 2009
40:16
Sparse Sampling: Variations on a Theme by Shannon

470 views - Martin Vetterli, 2008
51:29
Learning Dictionaries for Image Analysis and Sensing

306 views - Guillermo Sapiro, 2009
59:49
Fast methods for sparse recovery: alternatives to L1

247 views - Mike Davies, 2009
58:05
Compressive Sensing for Computer Vision: Hype vs Hope

507 views - Rama Chellappa, 2009
03:01:08
Geometric Methods and Manifold Learning

596 views - Partha Niyogi, Mikhail Belkin, 2009
25:01
Compressed Sensing and Bayesian Experimental Design

521 views - Matthias W. Seeger, Hannes Nickisch, 2008
35:27
Sparse Geometric Super-Resolution

1236 views - Stéphane Mallat, 2008
07:15
Welcome Speech at the MLSS 2009

253 views - Steve Smale, Mikhail Belkin, 2009

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.

 Watch videos:   (click on thumbnail to launch)

Watch Part 1
Part 1 0:58:36 Flash video Windows Media video
!NOW PLAYING
Watch Part 2
Part 2 1:19:57 Flash video Windows Media video
Watch Part 3
Part 3 0:40:58 Flash video Windows Media video

Description

In many applications, one often has fewer equations than unknowns. While this seems hopeless, the premise that the object we wish to recover is sparse or nearly sparse radically changes the problem, making the search for solutions feasible. This lecture will introduce sparsity as a key modeling tool together with a series of little miracles touching on many areas of data processing. These examples show that finding *that* solution to an underdetermined system of linear equations with minimum L1 norm, often returns the ''right'' answer. Further, there is by now a well-established body of work going by the name of compressed sensing, which asserts that one can exploit sparsity or compressibility when acquiring signals of general interest, and that one can design nonadaptive sampling techniques that condense the information in a compressible signal into a small amount of data - in fewer data points than were thought necessary. We will survey some of these theories and trace back some of their origins to early work done in the 50's. Because these theories are broadly applicable in nature, the tutorial will move through several applications areas that may be impacted such as signal processing, bio-medical imaging, machine learning and so on. Finally, we will discuss how these theories and methods have far reaching implications for sensor design and other types of designs.

Link this page  

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 behrooz, October 23, 2009 at 11:08 a.m.:

Would you put the link to the presentation slides


Comment2 hnliu, October 29, 2009 at 7:27 a.m.:

Yes, I want that too.


Comment3 Luo Wei, December 17, 2009 at 4:38 a.m.:

The great overview about CS


Comment4 iman, December 24, 2009 at 2:39 a.m.:

we really need the slides,
thanks for the nice talk.

Write your own review or comment:

make sure you have javascript enabled or clear this field: