Sciweavers

Share
PAMI
2012

BRIEF: Computing a Local Binary Descriptor Very Fast

6 years 7 months ago
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.
Michael Calonder, Vincent Lepetit, Mustafa Öz
Added 28 Sep 2012
Updated 28 Sep 2012
Type Journal
Year 2012
Where PAMI
Authors Michael Calonder, Vincent Lepetit, Mustafa Özuysal, Tomasz Trzcinski, Christoph Strecha, Pascal Fua
Comments (0)
books