Paper
16 February 2006 Face recognition based on HMM in compressed domain
Author Affiliations +
Abstract
In this paper we present an approach for face recognition based on Hidden Markov Model (HMM) in compressed domain. Each individual is regarded as an HMM which consists of several face images. A set of DCT coefficients as observation vectors obtained from original images by a window are clustered by K-means method using to be the feature of face images. These classified features are applied to train HMMs, so as to get the parameters of systems. Based on the proposed method, both Yale face database and ORL face database are tested. Compared to the other methods relevant to HMM methods reported so far on the two face databases, experimental results by proposed method have shown a better recognition rate and lower computational complexity cost.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Huiqin Wang and Guocan Feng "Face recognition based on HMM in compressed domain", Proc. SPIE 6064, Image Processing: Algorithms and Systems, Neural Networks, and Machine Learning, 60641P (16 February 2006); https://doi.org/10.1117/12.642788
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Facial recognition systems

Databases

Feature extraction

Detection and tracking algorithms

Eye models

Stochastic processes

Neural networks

Back to Top