位图局部敏感哈希的匹配二进制特征搜索算法

摘要

针对现有匹配二进制特征搜索算法效率低和入围点少的问题,提出了快速计算位图算法和位图局部敏感哈希算法.首先,计算左图提取的二进制特征的位向量;然后,使用快速计算位图算法计算位向量的位图,将位图作为关键字,并与二进制特征的标识作为映射,构建局部敏感哈希表;接着,将哈希表中的关键字存入位集;最后,判断右图提取的二进制特征对应的位图是否存在于哈希表中,优化查询哈希表中的匹配二进制特征,提高匹配二进制特征的搜索效率和质量.实验证明:位图局部敏感哈希算法提高了二进制特征近邻搜索的效率、增加了入围点数.%To solve the issues of low efficiency and less inliers of existing matching binary feature search algorithms ,a Fast Calculating Bit Map algorithm (FCBM ) and a Bit Map Locality Sensitive Hashing algorithm (BMLSH) are proposed .First ,the bit vectors of the binary features extracted from left image is calculated and the FCBM is used to calculate bitmap of each bit vector .Second ,the bitmaps of the bit vectors are taken as the key words ,and each keyword and its corresponding binary feature identifier are used to construct local sensitive hash table ,then the maps are stored in the hash table.Furthermore ,the keywords in the hash table are stored in the bit set .Finally ,the bit set is used to judge w hether the bitmaps of right image binary feature exists or not in the hash table ,and the query of matching binary features are optimized to improve the search efficiency and quality . Experiments show that the proposed BMLSH can improve the search efficiency and increase the number of inlier points .