IHashNet:基于高效多索引哈希的虹膜哈希网络

Avantika Singh, Chirag Vashist, Pratyush Gaurav, A. Nigam, Rameshwar Pratap
{"title":"IHashNet:基于高效多索引哈希的虹膜哈希网络","authors":"Avantika Singh, Chirag Vashist, Pratyush Gaurav, A. Nigam, Rameshwar Pratap","doi":"10.1109/IJCB48548.2020.9304925","DOIUrl":null,"url":null,"abstract":"Massive biometric deployments are pervasive in today's world. But despite the high accuracy of biometric systems, their computational efficiency degrades drastically with an increase in the database size. Thus, it is essential to index them. Here, in this paper, we propose an iris indexing scheme using real-valued deep iris features binarized to iris bar codes (IBC) compatible with the indexing structure. Firstly, for extracting robust iris features, we have designed a network utilizing the domain knowledge of ordinal filtering and learning their nonlinear combinations. Later these real-valued features are binarized. Finally, for indexing the iris dataset, we have proposed a Mcom loss that can transform the binary feature into an improved feature compatible with the Multi-Index Hashing scheme. This Mcom loss function ensures the equal distribution of Hamming distance among all the contiguous disjoint sub-strings. To the best of our knowledge, this is the first work in the iris indexing domain that presents an end-to-end iris indexing structure. Experimental results on four datasets are presented to depict the efficacy of the proposed approach.","PeriodicalId":417270,"journal":{"name":"2020 IEEE International Joint Conference on Biometrics (IJCB)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"IHashNet: Iris Hashing Network based on efficient multi-index hashing\",\"authors\":\"Avantika Singh, Chirag Vashist, Pratyush Gaurav, A. Nigam, Rameshwar Pratap\",\"doi\":\"10.1109/IJCB48548.2020.9304925\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Massive biometric deployments are pervasive in today's world. But despite the high accuracy of biometric systems, their computational efficiency degrades drastically with an increase in the database size. Thus, it is essential to index them. Here, in this paper, we propose an iris indexing scheme using real-valued deep iris features binarized to iris bar codes (IBC) compatible with the indexing structure. Firstly, for extracting robust iris features, we have designed a network utilizing the domain knowledge of ordinal filtering and learning their nonlinear combinations. Later these real-valued features are binarized. Finally, for indexing the iris dataset, we have proposed a Mcom loss that can transform the binary feature into an improved feature compatible with the Multi-Index Hashing scheme. This Mcom loss function ensures the equal distribution of Hamming distance among all the contiguous disjoint sub-strings. To the best of our knowledge, this is the first work in the iris indexing domain that presents an end-to-end iris indexing structure. Experimental results on four datasets are presented to depict the efficacy of the proposed approach.\",\"PeriodicalId\":417270,\"journal\":{\"name\":\"2020 IEEE International Joint Conference on Biometrics (IJCB)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Joint Conference on Biometrics (IJCB)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IJCB48548.2020.9304925\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Joint Conference on Biometrics (IJCB)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCB48548.2020.9304925","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在当今世界,大规模的生物识别部署无处不在。但是,尽管生物识别系统具有很高的准确性,但随着数据库规模的增加,它们的计算效率会急剧下降。因此,对它们进行索引是必要的。在本文中,我们提出了一种虹膜索引方案,利用与索引结构兼容的实值深度虹膜特征二值化到虹膜条形码(IBC)。首先,为了提取稳健的虹膜特征,我们利用有序滤波的领域知识设计了一个网络,并学习了它们的非线性组合。然后对这些实值特征进行二值化。最后,对于虹膜数据集的索引,我们提出了一种Mcom损失,可以将二进制特征转换为与多索引哈希方案兼容的改进特征。该Mcom损失函数保证了汉明距离在所有连续不相交子串之间的均匀分布。据我们所知,这是虹膜索引领域首次提出端到端的虹膜索引结构。在四个数据集上的实验结果表明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
IHashNet: Iris Hashing Network based on efficient multi-index hashing
Massive biometric deployments are pervasive in today's world. But despite the high accuracy of biometric systems, their computational efficiency degrades drastically with an increase in the database size. Thus, it is essential to index them. Here, in this paper, we propose an iris indexing scheme using real-valued deep iris features binarized to iris bar codes (IBC) compatible with the indexing structure. Firstly, for extracting robust iris features, we have designed a network utilizing the domain knowledge of ordinal filtering and learning their nonlinear combinations. Later these real-valued features are binarized. Finally, for indexing the iris dataset, we have proposed a Mcom loss that can transform the binary feature into an improved feature compatible with the Multi-Index Hashing scheme. This Mcom loss function ensures the equal distribution of Hamming distance among all the contiguous disjoint sub-strings. To the best of our knowledge, this is the first work in the iris indexing domain that presents an end-to-end iris indexing structure. Experimental results on four datasets are presented to depict the efficacy of the proposed approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信