Page 1 |
Save page Remove page | Previous | 1 of 143 | Next |
|
small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
|
THE IMPORTANCE OF NOT BEING MEAN: DFM – A NORM-REFERENCED DATA MODEL FOR FACE PATTERN RECOGNITION by Lawrence Marc Kite A Dissertation Presented to the FACULTY OF THE GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER SCIENCE) May 2009
Copyright 2009 Lawrence Marc Kite
Object Description
| Title | The importance of not being mean: DFM -- a norm-referenced data model for face pattern recognition |
| Author | Kite, Lawrence Marc |
| Author email | kite@usc.edu; larrykite@mac.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Computer Science |
| School | Viterbi School of Engineering |
| Date defended/completed | 2007-11-03 |
| Date submitted | 2009 |
| Restricted until | Unrestricted |
| Date published | 2009-05-13 |
| Advisor (committee chair) | von der Malsburg, Christoph |
| Advisor (committee member) |
Itti, Laurent Schaal, Stefan Mel, Bartlett W. |
| Abstract | A successful, mature system for face recognition, Elastic Bunch Graph Matching, represents a human face as a graph in which nodes are labeled with double precision floating-point vectors called "jets". Each jet in a model graph comprises the responses at one fiducial point, or face landmark, of a convolution of the image with a set of self-similar Gabor wavelets of various orientations and spatial scales. Gabor wavelets are scientifically reasonable models for the receptive field profiles of simple cells in early visual cortex. Heretofore, the recognition process simply searched for the stored model graph with the greatest total jet-similarity to a presented image graph. The most widely used measure of jet similarity is the sum over the graph of the dot-products of jets normalized to unit length. We improve significantly upon this system, with orders of magnitude improvements in time and space complexity and marked reductions in recognition error rates. We accomplish these improvements by recasting the concatenated vector of model-graph jets as a binary string, or b-string, comprising bits with one-to-one correspondence to the floating-point coefficients in the model graph. The b-string roughly models a pattern of correlated firing among a population of idealized neurons. The "on" bits of the b-string correspond to the identities of the coefficients that deviate the greatest amount from the corresponding mean coefficient values. We show that this simple recoding consistently reduces recognition error rates by margins exceeding thirty percent. Our investigations support the hypothesis that the b-string representation for faces is extremely efficient and, ultimately, information preserving. |
| Keyword | face recognition; face representation; face processing; face information |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m2239 |
| Contributing entity | University of Southern California |
| Rights | Kite, Lawrence Marc |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | cisadmin@lib.usc.edu |
| Filename | etd-Kite-2151 |
| Archival file | uscthesesreloadpub_Volume29/etd-Kite-2151.pdf |
Description
| Title | Page 1 |
| Contributing entity | University of Southern California |
| Repository email | cisadmin@lib.usc.edu |
| Full text | THE IMPORTANCE OF NOT BEING MEAN: DFM – A NORM-REFERENCED DATA MODEL FOR FACE PATTERN RECOGNITION by Lawrence Marc Kite A Dissertation Presented to the FACULTY OF THE GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER SCIENCE) May 2009 Copyright 2009 Lawrence Marc Kite |
