swMATH ID: 29763
Software Authors: Calonder, M.; Lepetit, V.; Ozuysal, M.; Trzcinski, T.; Strecha, C.; Fua, P.
Description: BRIEF: computing a local binary descriptor very fast. 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.
Homepage: https://ieeexplore.ieee.org/document/6081878
Related Software: SURF; SIFT; HPatches; BRISK; PCA-SIFT; MegaDepth; D2-Net; SuperPoint; GANDissect; GMS; COTR; ContextDesc; ASLFeat; SuperGlue; MatchFormer; InLoc; ACNe; LoFTR; Grad-CAM; LF-Net
Cited in: 5 Publications

Citations by Year