Journal
IEEE TRANSACTIONS ON MULTIMEDIA
Volume 16, Issue 4, Pages 1090-1103Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TMM.2014.2305633
Keywords
Discrete Cosine Transform (DCT) hashing; face indexing; image retrieval; Local Binary Patterns (LBP); Locality-Sensitive Hashing (LSH)
Categories
Funding
- National Science Foundation [0905671, 0915270]
- Direct For Computer & Info Scie & Enginr [0915270, 0905671] Funding Source: National Science Foundation
- Div Of Information & Intelligent Systems [0905671, 0915270] Funding Source: National Science Foundation
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available