Sparsity has become a very important concept in recent years in applied mathematics, especially in mathematical signal and image processing, as in inverse problems. The key idea is that many classes of natural signals can be described by only a small number of significant degrees of freedom. This course offers a complete coverage of the recently emerged field of compressed sensing, which asserts that, if the true signal is sparse to begin with, accurate, robust, and even perfect signal recovery can be achieved from just a few randomized measurements. The focus is on describing the novel ideas that have emerged in sparse recovery with emphasis on theoretical foundations, practical numerical algorithms, and various related signal processing applications.
Week 9: Robust PCA. Matrix Completion and Approximation
Week 10: Applications to Medical Imaging
Week 11: Applications to Sampling other RF Applications
Week 12: Applications to Face Recognition & ATR
Week 13: Applications in Computer Vision & Video Processing
Week 14: In-class Final Project Presentations
Final Project
Students are expected to work on a related topic of choice.
The topic can be chosen from a list of suggestions provided
by the instructor.
A final project report and an oral demonstration/presentation are
required from each project.
Grading
Homework / Class Participation: 50%
Final Project: 50%
Important Dates
First lecture: Tues, 01/29/2013, 1:30PM, Barton 117.
Spring Break: 03/18/2013 -- 03/24/2013
Ethics Issues
Please read the information
provided by the
Ethics Board.
On homework and projects, you are permitted to discuss the problems
for clarification purposes, and to help each other with specific
points. However, the overall solution and write-up should be your own
work.