FACE VERIFICATION USING IMPROVED ONE-DIMENSIONAL HIDDEN MARKOV MODEL

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

NADERI SH.; SHAHRAM MOIN M.; MOGHADAM CHARKARI N.A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING Year:2003 | Volume:1 | Issue:2 (b) Page(s): 15-25

Download Full-Text

Persian Verion

View:

846

Download:

Cites:

Information Journal Paper

Title

FACE VERIFICATION USING IMPROVED ONE-DIMENSIONAL HIDDEN MARKOV MODEL

Author(s)

NADERI SH. | SHAHRAM MOIN M. | MOGHADAM CHARKARI N.A. | Issue Writer Certificate

Keywords

FACE VERIFICATIONQ4

ID HIDDEN MARKOV MODELQ4

2D HIDDEN MARKOV MODELQ4

K-MEANSQ4

DISCRETE COSINE TRANSFORMQ4

ORL DATABASEQ4

Abstract

In this paper, we propose an improved version of ID-HMM for FACE VERIFICATION. DCT coefficients of face images are used as observation vectors in HMM states. Three types of modifications have been proposed to improve the overall performance of the classical model: (I) Replacing Baum-Welch algorithm with K-MEANS clustering algorithm, (2) Replacing K-MEANS with adaptive K-MEANS and (3) Adaptive selection of training images amongst the available images in data set. The results show identical computational complexity in verification phase and better verification performance compared with other ID-HMM methods. The proposed algorithm has been successfully tested on the ORL face image data set, exhibiting an accuracy of 96%. This is almost 10% higher than the identification rate of the classical lD-HMMs and is comparable with 2D-HMMs accuracy; which basically has much higher processing complexity than ID-HMM.

Cites

No record.

References

No record.

Cite

APA: Copy

NADERI, SH., SHAHRAM MOIN, M., & MOGHADAM CHARKARI, N.A.. (2003). FACE VERIFICATION USING IMPROVED ONE-DIMENSIONAL HIDDEN MARKOV MODEL. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, 1(2 (b)), 15-25. SID. https://sid.ir/paper/70706/en

Vancouver: Copy

NADERI SH., SHAHRAM MOIN M., MOGHADAM CHARKARI N.A.. FACE VERIFICATION USING IMPROVED ONE-DIMENSIONAL HIDDEN MARKOV MODEL. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING[Internet]. 2003;1(2 (b)):15-25. Available from: https://sid.ir/paper/70706/en

IEEE: Copy

SH. NADERI, M. SHAHRAM MOIN, and N.A. MOGHADAM CHARKARI, “FACE VERIFICATION USING IMPROVED ONE-DIMENSIONAL HIDDEN MARKOV MODEL,” THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, vol. 1, no. 2 (b), pp. 15–25, 2003, [Online]. Available: https://sid.ir/paper/70706/en

Related Journal Papers