Thesis (Ph.D.)--University of Delaware, 2006. / Principal faculty advisor: Chandra Kambhamettu, Dept. of Computer & Information Sciences. Includes bibliographical references.

Thesis (Ph. D.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains ix, 117 p.; also contains graphics. Vita. Includes bibliographical references (p. 109-116).

Thesis (Ph. D.)--Drexel University, 2006. / Includes abstract and vita. Includes bibliographical references (leaves 165-171).

The thesis illustrates the development of DSP-based¡§Real-Time Human Face Recognition System¡¨.The principal system consists of three major subsystems.There are Image Acquisition System¡AImage Preprocessing System and human face characteristic extraction . For experiment,we adopted colored face image with complex background and simulate on PC.We found the characteristic points and characteristic vectors from the face image which is searched from Gene algorithm.Then,we use the recognition system to recognize the face image.Finally we implant it to DSP. Shown by the experimental result,this system has good recognition and efficiency.

Thesis (M. Phil.)--University of Hong Kong, 2001. / Includes bibliographical references (leaves 77-82)f.

Thesis (Ph.D.)--Memorial University of Newfoundland, 2001. / Bibliography: leaves 210-216.

Great progress has been made in face sketch synthesis in recent years. State-of-the-art methods commonly apply a Markov Random Fields (MRF) model to select local sketch patches from a set of training data. Such methods, however, have two major drawbacks. Firstly, the MRF model used cannot synthesize new sketch patches. Secondly, the optimization problem in solving the MRF is NP-hard. In this thesis, a novel Markov Weight Fields (MWF) model is proposed. By applying linear combination of candidate patches, MWF is capable of synthesizing new sketch patches. The MWF model can be formulated into a convex quadratic programming (QP) problem to which the optimal solution is guaranteed. Based on the Markov property of MWF model, a cascade decomposition method (CDM) is further proposed for solving such a large scale QP problem efficiently. Experiments show that the proposed CDM is very efficient, and only takes about 2:4 seconds. To deal with illumination changes of input photos, five special shading patches are included as candidate patches in addition to the patches selected from the training data. These patches help keeping structure of the face under different illumination conditions as well as synthesize shadows similar to the input photos. Extensive experiments on the CUHK face sketch database, AR database and Chinese celebrity photos show that the proposed model outperforms the common MRF model used in other state-of-the-art methods and is robust to illumination changes. / published_or_final_version / Computer Science / Master / Master of Philosophy

published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy

In recent times, there has been an increase in national security awareness with a focus on improving current practices relating to the identification and verification of individuals and the reduction of identity fraud. One tool that has been found to assist in these areas is biometrics. This thesis examines some biometric technologies that may be potentially suitable for surveillance and access control applications, and shows why facial recognition technology has been the focus of this study. / Thesis (PhDElectronicSystemsEngineering)--University of South Australia, 2005.

Thesis (MScIng)--University of Stellenbosch, 2007. / Bibliography. Also available via the Internet.