conference paper
BRIEF: Binary Robust Independent Elementary Features
2010
Computer Vision-Eccv 2010, Pt Iv
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.
Type
conference paper
Web of Science ID
WOS:000286578100056
Date Issued
2010
Published in
Computer Vision-Eccv 2010, Pt Iv
ISBN of the book
978-3-642-15560-4
Series title/Series vol.
Lecture Notes in Computer Science; 6314
Start page
778
End page
792
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
June 7, 2010
Use this identifier to reference this record