Name
Abstract | ||
|---|---|---|
Descriptors such as local binary patterns perform well for face recognition. Searching large databases using such descriptors has been problematic due to the cost of the linear search, and the inadequate performance of existing indexing methods. We present Discrete Cosine Transform (DCT) hashing for creating index structures for face descriptors. Hashes play the role of keywords: an index is created, and queried to find the images most similar to the query image. Common hash suppression is used to improve retrieval efficiency and accuracy. Results are shown on a combination of six publicly available face databases (LFW, FERET, FEI, BioID, Multi-PIE, and RaFD). It is shown that DCT hashing has significantly better retrieval accuracy and it is more efficient compared to other popular state-of-the-art hash algorithms. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TMM.2014.2305633 | Multimedia, IEEE Transactions |
Keywords | Field | DocType |
cryptography,discrete cosine transforms,face recognition,image coding,image retrieval,BioID,DCT hashing,FEI,FERET,LFW,RaFD,discrete cosine transform hashing,face databases,face descriptors,face recognition,face retrieval,hash suppression,image querying,index structures,linear search,local binary patterns,locality-sensitive hashes,multiPIE,retrieval efficiency,Discrete Cosine Transform (DCT) hashing,Local Binary Patterns (LBP),Locality-Sensitive Hashing (LSH),face indexing,image retrieval | Locality-sensitive hashing,Kernel (linear algebra),Facial recognition system,Computer vision,Pattern recognition,Computer science,Local binary patterns,Discrete cosine transform,Search engine indexing,Artificial intelligence,Hash function,Linear search | Journal |
Volume | Issue | ISSN |
16 | 4 | 1520-9210 |
Citations | PageRank | References |
14 | 0.52 | 27 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mehran Kafai | 1 | 93 | 5.20 |
| Kave Eshghi | 2 | 744 | 63.11 |
| Bir Bhanu | 3 | 3356 | 380.19 |