Sparse Signal Processing: A Geometric Approach

Add to your list(s) Download to your calendar using vCal

• Dr Wei Dai, University of Illinois
• Monday 02 August 2010, 10:30-11:15
• Gabor Seminar Room (Room 611).

If you have a question about this talk, please contact Professor Peter Cheung.

Sparse signal processing is a technique for acquiring and analyzing sparse signals efficiently. Many signals, including biomedical signals, sensor network measurements, and Netflix user preference data are sparse in the sense that they can be well-approximated by a small number of significant components. Signal sparsity allows for large saving in data collection or succinct interpretation of enormous amount of data.

In this talk we cover three aspects in sparse signal processing: compressive sensing, low-rank matrix completion and low-rank tensor completion. The sparse signals under consideration are represented as vectors, matrices and tensors (i.e., high-dimensional arrays), respectively. We show how different methods are required to treat different types of sparse signals, and how these techniques are linked by geometry. It turns out that linear subspaces not only provide insights into sparse signal processing theory but also help in developing practical algorithms.

This talk is part of the Featured talks series.

This talk is included in these lists:

• Andrea Picciau's list
• COMMSP & CP list
• COMMSP Seminar
• Featured talks
• Gabor Seminar Room (Room 611)
• SAP Talks

Note that ex-directory lists are not shown.