Alignment-free indexing-first-one hashing with bloom filter integration

Yenlung Lai, B. Goi, Tong-Yuen Chai
{"title":"Alignment-free indexing-first-one hashing with bloom filter integration","authors":"Yenlung Lai, B. Goi, Tong-Yuen Chai","doi":"10.1109/ISI.2017.8004878","DOIUrl":null,"url":null,"abstract":"This paper explores the recently published works on iris template protection namely Indexing-First-One hashing. Despite the Indexing-First-One hashing offers high recognition performance with resistant against several major privacy and security attacks, it does not resolve the rotation inconsistent issues existed in conventional iris template due to head tilt/ rotation during user's eyes images acquisition. Hence, a pre-alignment step is required for the conventional IFO hashed code matching. Consequently, this increased the computational cost heavily. Hereby, we address the rotation inconsistent issue by proposing an alignment-free IFO hashing through a pre-transformation based on Bloom filter generation. The proposed pre-alignment IFO hashing shows promising recognition performance, and the pre-alignment procedure is eliminated to lower computational cost.","PeriodicalId":423696,"journal":{"name":"2017 IEEE International Conference on Intelligence and Security Informatics (ISI)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Intelligence and Security Informatics (ISI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISI.2017.8004878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

This paper explores the recently published works on iris template protection namely Indexing-First-One hashing. Despite the Indexing-First-One hashing offers high recognition performance with resistant against several major privacy and security attacks, it does not resolve the rotation inconsistent issues existed in conventional iris template due to head tilt/ rotation during user's eyes images acquisition. Hence, a pre-alignment step is required for the conventional IFO hashed code matching. Consequently, this increased the computational cost heavily. Hereby, we address the rotation inconsistent issue by proposing an alignment-free IFO hashing through a pre-transformation based on Bloom filter generation. The proposed pre-alignment IFO hashing shows promising recognition performance, and the pre-alignment procedure is eliminated to lower computational cost.
无对齐索引第一哈希与布隆过滤器集成
本文对最近发表的关于虹膜模板保护的研究成果——索引先一哈希进行了探讨。尽管index - first - one散列法提供了较高的识别性能,并能抵抗几种主要的隐私和安全攻击,但它不能解决传统虹膜模板在用户眼睛图像获取过程中由于头部倾斜/旋转而存在的旋转不一致问题。因此,传统的IFO散列代码匹配需要一个预对齐步骤。因此,这大大增加了计算成本。因此,我们通过基于Bloom过滤器生成的预变换提出无对齐IFO哈希来解决旋转不一致问题。所提出的预对齐IFO哈希算法具有良好的识别性能,并且消除了预对齐过程,降低了计算成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信