Abstract
An Introduction to Matching Pursuits: Lecture I
Joel Tropp
California Institute of Technology
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
a) Dictionaries and sparse approximation
b) Computational complexity of sparse approximation
c) Greedy-type algorithms
d) Basic dictionary geometry
No video available