BRIEF: Computing a Local Binary Descriptor Very Fast
IEEE Transactions on Pattern Analysis and Machine Intelligence2011Vol. 34(7), pp. 1281–1298
Citations Over TimeTop 1% of 2011 papers
Abstract
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast 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, which 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.
Related Papers
- → Description of interest regions with local binary patterns(2008)1,198 cited
- → Dynamic texture recognition using enhanced LBP features(2013)57 cited
- → Weighted Local Binary Pattern Infrared Face Recognition Based on Weber's Law(2011)12 cited
- → Recognition of Abnormal Vehicle Behaviors Using Combined Features(2019)1 cited
- → Noise Tolerant Histogram Voting for Gender Classification Based on LBP(2016)