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.
- View record in Web of Science
Record created on 2010-06-07, modified on 2016-08-08