An efficient and reduced memory indexing approach based on priority rank spectral hashing for multibiometric database

R. Balasundaram, G. Sudha
{"title":"An efficient and reduced memory indexing approach based on priority rank spectral hashing for multibiometric database","authors":"R. Balasundaram, G. Sudha","doi":"10.1504/IJBM.2017.10006483","DOIUrl":null,"url":null,"abstract":"Fast retrieval of data from a multibiometric database is a challenging task as the size of the databases has increased considerably. For the retrieval to be faster, the search space has to be narrowed to a smaller set comprising of nearest neighbours. To achieve this, an appropriate data structure is to be built. Hence a novel priority rank-based spectral hashing algorithm is implemented to enhance the efficiency of indexing in a multibiometric database of iris and palmprints. To improve the matching accuracy, GIST feature extraction is used with weighted feature level fusion. From the experimental results, it is concluded that the proposed indexing algorithm has reduced storage cost by 85%, along with reduced penetration rate, false acceptance rate and false rejection rate. In addition, hit rate has improved by 25% compared to the existing kd tree technique.","PeriodicalId":262486,"journal":{"name":"Int. J. Biom.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Biom.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJBM.2017.10006483","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Fast retrieval of data from a multibiometric database is a challenging task as the size of the databases has increased considerably. For the retrieval to be faster, the search space has to be narrowed to a smaller set comprising of nearest neighbours. To achieve this, an appropriate data structure is to be built. Hence a novel priority rank-based spectral hashing algorithm is implemented to enhance the efficiency of indexing in a multibiometric database of iris and palmprints. To improve the matching accuracy, GIST feature extraction is used with weighted feature level fusion. From the experimental results, it is concluded that the proposed indexing algorithm has reduced storage cost by 85%, along with reduced penetration rate, false acceptance rate and false rejection rate. In addition, hit rate has improved by 25% compared to the existing kd tree technique.
基于优先级频谱散列的高效、低内存索引方法,适用于多生物特征数据库
由于数据库的规模大大增加,从多重生物统计数据库中快速检索数据是一项具有挑战性的任务。为了加快检索速度,必须将搜索空间缩小到由近邻组成的较小集合。为此,需要建立适当的数据结构。因此,我们采用了一种新颖的基于优先级的光谱哈希算法,以提高虹膜和掌纹多重生物识别数据库的索引效率。为了提高匹配的准确性,使用了 GIST 特征提取和加权特征级融合。实验结果表明,所提出的索引算法降低了 85% 的存储成本,同时降低了穿透率、错误接受率和错误拒绝率。此外,与现有的 kd 树技术相比,命中率提高了 25%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信