.png){kind=icon}
.png){kind=icon}
Return
An efficient indexing scheme for face database using modified geometric hashing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2011.12.056.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an efficient scheme to index the database of facial images. It has made use of the modified geometric hashing technique. It uses minimum amount of search space and memory to provide top best matches with high accuracy against a query image. Control points are extracted using Speeded-Up Robust Feature points (SURF) operator. A pre-processing technique consisting of mean centring, principal components, rotation and normalization has been proposed to make these control points invariant to translation, rotation and scaling. The modified geometric hashing is used to hash these control points to index of the hash table. The indexing scheme has been tested on FERET face database which has achieved 100% hit rate for top 4 best matches. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Indexing
Biometrics
Geometric hashing
Speeded-up robust feature points
Principal components
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W