Improved Bloom Filter for Efficient Image Retrieval on Mobile Device

Wing W. Y. Ng, Yongzhi Xu, Xing Tian, Yuxiang Yang, Haotian Wu, Ying Gao
{"title":"Improved Bloom Filter for Efficient Image Retrieval on Mobile Device","authors":"Wing W. Y. Ng, Yongzhi Xu, Xing Tian, Yuxiang Yang, Haotian Wu, Ying Gao","doi":"10.1109/ICIST55546.2022.9926800","DOIUrl":null,"url":null,"abstract":"A huge volume of images is uploaded to the mobile cloud environment every day with rapid growth of mobile devices. Different from retrieving image using a personal computer, infor-mation retrieval on mobile devices requires higher efficiency due to limitations in data transmission and memory cost. Therefore, an efficient scalable image retrieval model is proposed in this paper which consists of a two-layer bloom filter. The first layer of the proposed bloom filter generated from the asymmetric cyclical hashing (ACH) is used for primary image existence verification. In order to reduce the false positive rate commonly happening in bloom filters, the second layer of the bloom filter based on secure hashing is applied for verification in the second stage. The proposed model realizes approximated nearest neighbor retrieval with limited cost of storage and protects the stored data from illegal access simultaneously. Experimental results show that the proposed model yields significant better retrieval accuracy than other retrieval methods with more than 6 times faster in retrieval time and a smaller space requirement.","PeriodicalId":211213,"journal":{"name":"2022 12th International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 12th International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST55546.2022.9926800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A huge volume of images is uploaded to the mobile cloud environment every day with rapid growth of mobile devices. Different from retrieving image using a personal computer, infor-mation retrieval on mobile devices requires higher efficiency due to limitations in data transmission and memory cost. Therefore, an efficient scalable image retrieval model is proposed in this paper which consists of a two-layer bloom filter. The first layer of the proposed bloom filter generated from the asymmetric cyclical hashing (ACH) is used for primary image existence verification. In order to reduce the false positive rate commonly happening in bloom filters, the second layer of the bloom filter based on secure hashing is applied for verification in the second stage. The proposed model realizes approximated nearest neighbor retrieval with limited cost of storage and protects the stored data from illegal access simultaneously. Experimental results show that the proposed model yields significant better retrieval accuracy than other retrieval methods with more than 6 times faster in retrieval time and a smaller space requirement.
改进的布隆滤波器在移动设备上的有效图像检索
随着移动设备的快速增长,每天都有大量的图像上传到移动云环境。与使用个人电脑检索图像不同,由于数据传输和存储成本的限制,移动设备上的信息检索需要更高的效率。为此,本文提出了一种有效的可扩展图像检索模型,该模型由两层布隆滤波器组成。所提出的布隆滤波器的第一层由不对称循环哈希(ACH)生成,用于主图像存在验证。为了降低布隆过滤器中常见的误报率,在第二阶段采用基于安全哈希的布隆过滤器的第二层进行验证。该模型以有限的存储成本实现了近似最近邻检索,同时保护存储的数据不被非法访问。实验结果表明,该模型的检索精度明显高于其他检索方法,检索时间提高了6倍以上,空间要求更小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信