摘要
提出了一种优化的ES穷尽搜索算法,通过对两个IRIS ID代码的二进制向量位数的比较,实现了数据库中的模糊搜索.这种比较是通过重复比较两个相对旋转的IRIS ID代码实现的.
An optimized exhaustive searching is put forward. The comparison of the bits that differ between binary vectors, results in the fuzzy searching in the database. The comparison is handled by repeating the comparisons of the IRIS ID codes over a range of relative rotations.
出处
《上海电力学院学报》
CAS
2011年第2期160-162,共3页
Journal of Shanghai University of Electric Power
关键词
最近邻居搜索
穷尽搜索
错误匹配率
装载时间
most adjucent searching
exhaustive searching
error match ratio
loading time
