Sparse Representations from Inverse Problems to Pattern Recognition

author: Stéphane Mallat, Applied Mathematics - CMAP, École Polytechnique
published: July 30, 2009,   recorded: June 2009,   views: 14211

Related Open Educational Resources

Related content

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.


Sparse representations are at the core of many low-level signal processing procedures and are used by most pattern recognition algorithms to reduce the dimension of the search space. Structuring sparse representations fro pattern recognition applications requires taking into account invariants relatively to physical deformations such as rotation scaling or illumination. Sparsity, invariants and stability are conflicting requirements which is a source of open problems. Structured sparse representations with locally linear vector spaces are introduced for super-resolution inverse problems and pattern recognition.

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 Shan, August 10, 2009 at 3:02 a.m.:

Can someone please upload the slides for this presentation?

Write your own review or comment:

make sure you have javascript enabled or clear this field: