Wednesday, October 29, 2008 - 3:55pm - 4:45pm
Yi Ma (University of Illinois at Urbana-Champaign)
It is know that face images of different people lie on multiple low-dimensional subspaces. In this talk,
we will show that these subspaces are tightly bundled together as a bouquet. Precisely due to this
unique structure, it allows extremely robust reconstruction and recognition of faces despite severe
corruption or occlusion. We will show that if the image resolution and the size of the face database
grow in proportion to infinity, computer can correctly and efficiently recover or recognize a face image
Friday, March 9, 2007 - 1:30pm - 2:20pm
Robert Fossum (University of Illinois at Urbana-Champaign)
A subspace arrangement is a union of a finite number of subspaces of a
vector space. We will discuss the importance of subspace arrangements first
as mathematical objects and now as a popular class of models for

We will then introduce some of new theoretical results that were motivated
from practice. Using these results we will address the computational issue
about how to extract subspace arrangements from noisy or corrupted data.

Finally we will turn to the importance of subspace arrangements by briefly
Subscribe to RSS - Subspaces