BRIEF: Computing a Local Binary Descriptor Very Fast

Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach to creating them is to first compute floating-point ones, using an algorithm such as SIFT, and then to binarize them. In this paper, we show that we can directly compute a binary descriptor we call BRIEF on the basis of simple intensity difference tests. As a result, BRIEF is very fast both to build and to match. We compare it against SURF and SIFT on standard benchmarks and show that it yields comparable recognition accuracy, while running in an almost vanishing fraction of the time required by either.


Publié dans:
IEEE Transactions on Pattern Analysis and Machine Intelligence, 34, 7, 1281-1298
Année
2012
Publisher:
Institute of Electrical and Electronics Engineers
ISSN:
0162-8828
Mots-clefs:
Laboratoires:




 Notice créée le 2011-07-25, modifiée le 2018-09-13

n/a:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)