Face Recognition

From PDLWiki

This website introduces a new mathematical framework for classification and recognition problems in computer vision, especially face recognition. The basic idea is to cast recognition as a sparse representation problem, utilizing new mathematical tools from compressed sensing and L1 minimization. This leads to highly robust, scalable algorithms for face recognition based on linear or convex programming. These algorithms produce extremely striking results, accurately recognizing subjects across large databases despite severe corruption and occlusion (as in the example below). Please browse the links to the left for more information. The introduction section gives a brief description of main ideas of our method. More technical details can be found in the references section through our publications or related literature. The applications section showcases results on some specific recognition problems. A prototype face recognition system will be made available in the demo section.