Enhanced and fast face recognition by hashing algorithm

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

Abstract

This paper presents a face hashing technique for fast face recognition. The proposed technique employs the two existing algorithms, i.e., 2-D discrete cosine transformation and K-means clustering. The image has to go through different pre-processing phases and the two above-mentioned algorithms must be used in order to obtain the hash value of the face image. The searching process is increased by introducing a modified form of binary search. A new database architecture called Facebases has also been introduced to further speedup the searching process.

Cite

CITATION STYLE

APA

Sharif, M., Ayub, K., Sattar, D., Raza, M., & Mohsin, S. (2012). Enhanced and fast face recognition by hashing algorithm. Journal of Applied Research and Technology, 10(4), 607–617. https://doi.org/10.22201/icat.16656423.2012.10.4.384

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