BRIEF: Binary Robust Independent Elementary Features

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.


Published in:
Computer Vision-Eccv 2010, Pt Iv, 6314, 778-792
Presented at:
11th European Conference on Computer Vision (ECCV)
Year:
2010
Publisher:
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa
ISBN:
978-3-642-15560-4
Laboratories:




 Record created 2010-06-07, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)