Fast search real-time face recognition based on DCT coefficients distribution

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

The authors propose an adaptive face recognition algorithm based on the discrete cosine transform (DCT) coefficients approach. For the database's establishment, the face images are pre-processed with colour transform, hair cutting, and background removing to eliminate non-face information. The recognised kernel applied the weights of DCT coefficient distribution with the entire image transformation, to avoid position mismatch and reduce the light effect. The key coefficients of DCT are chosen from the training database by maximum variance. The fast search mode can reject 90% weak candidates with few coefficients to fasten the processing speed. The significant coefficients weighting methods are used to enhance face features. Only using 50 coefficients per picture, the recognition rate can achieve 95% for ORL face database testing. For real-time recognition, camera imaging is processed with algorithms using C-programming based on Windows system. The recognition rate can achieve 95% and the speed is about nine frames per second for real-time recognition in practice.

Cite

CITATION STYLE

APA

Hsia, S. C., Wang, S. H., & Chen, C. J. (2020). Fast search real-time face recognition based on DCT coefficients distribution. IET Image Processing, 14(3), 570–575. https://doi.org/10.1049/iet-ipr.2018.6175

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free