Speaker: J. K. Shaw, Virginia Tech

Title: Compressive Sampling

Abstract: This is an expository lecture on the subject of compressive sampling (CS), also known as compressive sensing, sparse sensing or sparse sampling. CS is a priority research area for surveillance and homeland security purposes because of its potential to help cope with large streams of data. Indeed, the real promise of CS lies not in data reduction but sparse signal construction through adroit under-sampling. The field is an attractive combination of mathematical optimization and probability. Typical results involve convex minimization problems whose solutions are exact - with "high probability." The talk intends to survey the field and point out some prospective research problems. It will be accessible to a general mathematical audience.

Brief biographical sketch: Ken Shaw is an emeritus professor of mathematics at Virginia Tech and until March 1, 2008, was a program officer at the Office of Naval Research. He was a program officer in applied mathematics at the National Science Foundation between 2002 and 2005. During the academic years 2005-2007 he served as director of operations for the graduate program in mathematics and statistics at Georgetown University, and is currently an Affiliated Faculty member in mathematics at Georgetown.

Place: Science and Technology Building I, Room 242

Refreshments will be served before the talk at 3:00 p.m. in Room 222.

Department of Mathematical Sciences
George Mason University
4400 University Drive, MS 3F2
Fairfax, VA 22030-4444
http://math.gmu.edu/
Tel. 703-993-1460, Fax. 703-993-1491