This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/47084
Description
Title
Face Recognition via Sparse Representation
Author(s)
You, Jason
Contributor(s)
Ma, Yi
Issue Date
2008-05
Keyword(s)
automatic face recognition
sparse representation
L1 minimization
Abstract
We study the problem of automatically face recognition under varying illumination and poses. We show how techniques for representing sparse signals can be used to effectively handle the difficulties due to lighting and disguise. The idea is to cast the problem as a sparse representation problem, and solve the problem by using the L1-minimization method. The desired representation is sparse, since the test face image should only be represented in terms of training face images of the same object. Our new algorithm uses the L1 minimization method to express the test image as a sparse linear combination of the all training images plus a sparse error due to corruption or occlusion. We conduct experiments on publicly available databases to verify the efficacy of the proposed method. Besides the algorithm, we also design and build our own hardware equipment and user interface to acquire training images.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
