Author:
Sharif M.,Ayub K.,Sattar D.,Raza M.,Mohsin S.
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.
Publisher
Universidad Nacional Autonoma de Mexico
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献