Abstract

An Introduction to Matching Pursuits: Lecture I

Joel Tropp
University of Michigan
Mathematics

Lecture 1: Sparse approximation and greedy algorithms
a) Dictionaries and sparse approximation
b) Computational complexity of sparse approximation
c) Greedy-type algorithms
d) Basic dictionary geometry

Audio (MP3 File, Podcast Ready)

Back to Short Course: Sparse Representations and High Dimensional Geometry : In conjunction with the AMS 2007 Von Neumann Symposium