2011 4th IEEE International Conference on Broadband Network and Multimedia Technology 2011
DOI: 10.1109/icbnmt.2011.6155939
|View full text |Cite
|
Sign up to set email alerts
|

Face verification using D-HMM and adaptive K-means clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…Thereafter, the trend is to reduce the size of the observation vectors by using dimensionality reduction methods instead of pixel intensities. In [9,10,11,12,13,14], Discrete Cosine Transform (DCT) was used to extract features from images. The Wavelet Transform (WT) is also used either in continuous or discrete form as in [15,16,17,18,19,20,21,22,23,24].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Thereafter, the trend is to reduce the size of the observation vectors by using dimensionality reduction methods instead of pixel intensities. In [9,10,11,12,13,14], Discrete Cosine Transform (DCT) was used to extract features from images. The Wavelet Transform (WT) is also used either in continuous or discrete form as in [15,16,17,18,19,20,21,22,23,24].…”
Section: Related Workmentioning
confidence: 99%
“…Most of the researchers used 5-state HMM [8,9,10,11,12,13,16,18,20,21,25,26,27,30] and others used 7-state HMM [22,23,28]. In [19], 64 states were used, while in [24], the authors used 9-state HMM for Yale database and 15state HMM for ORL database.…”
Section: Related Workmentioning
confidence: 99%
“…[18][19][20] HMM consists of two interrelated processes: (1) an underlying, unobservable Markov chain with a finite number of states and (2) a set of random probability density functions which determine the distribution of observation value in each state. [18][19][20] HMM consists of two interrelated processes: (1) an underlying, unobservable Markov chain with a finite number of states and (2) a set of random probability density functions which determine the distribution of observation value in each state.…”
Section: Hidden Markov Modelmentioning
confidence: 99%
“…It consists of a number of superstates, which represent the main 1D-HMM, and each superstate consists of a number of states of the 1D-HMM model. In [11,15,22], 2D-HMMs were employed with a variation in the number of states and also the number of superstates. Fig.…”
Section: D-hmm Face Recognitionmentioning
confidence: 99%
“…The disadvantage of using pixel intensities is the associated high level of computational complexity; therefore, the tendency is to employ low-complexity methods. The discrete wavelet transform (DWT) [10], local binary pattern (LBP) [11], singular value decomposition (SVD) [12,13,14] and discrete cosine transform (DCT) [15] are the most widely methods used for dimensionality reduction.…”
Section: Related Workmentioning
confidence: 99%