返回
An efficient indexing scheme for face database using modified geometric hashing
DOI:10.1016/j.neucom.2011.12.056.png)
摘要
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.
Keyword:
Indexing
Biometrics
Geometric hashing
Speeded-up robust feature points
Principal components
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Enhanced runout and erosion by overland flow at low pressure and sub-freezing conditions: Experiments and application to Mars
Icarus
IF0
The Deglycosylated Form of 1E12, a Monoclonal Anti-PF4 IgG, Strongly Inhibits Antibody-Triggered Cellular Activation in Vaccine-Induced Thrombotic Thrombocytopenia, and Is a Potential New Treatment for Vιττ
Blood
IF0

