Brief: Binary Robust Independent Elementary Features
ECCV'10: Proceedings of the 11th European conference on Computer vision: Part IV(2010)
摘要
We propose to use binary strings as an efficient feature point descriptor, which we call BRIEF. We show that it is highly discriminative even when using relatively few bits and can be computed using simple intensity difference tests. Furthermore, the descriptor similarity can be evaluated using the Hamming distance, which is very efficient to compute, instead of the L-2 norm as is usually done.As a result, BRIEF is very fast both to build and to match. We compare it against SURF and U-SURF on standard benchmarks and show that it yields a similar or better recognition performance, while running in a fraction of the time required by either.
更多查看译文
关键词
descriptor similarity,efficient feature point descriptor,Hamming distance,L2 norm,better recognition performance,binary string,simple intensity difference test,standard benchmarks,robust independent elementary feature
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络