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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.