BRIEF: Computing a Local Binary Descriptor Very Fast
BRIEF: Computing a Local Binary Descriptor Very Fast
复制标题
DOI：
10.1109/tpami.2011.222
复制
发表时间：
2012-07-01
影响因子：
23.6
通讯作者：
Fua, Pascal
中科院分区：
文献类型：
--
作者：
Calonder, Michael;Lepetit, Vincent;Fua, Pascal
二进制描述符作为一种非常快速地比较特征点同时需要相对少量的存储器的手段变得越来越流行。创建它们的典型方法是首先使用SIFT等算法计算浮点数，然后将它们二进制化。在本文中，我们表明，我们可以直接计算一个二进制描述符，我们称之为BRIEF，简单的强度差测试的基础上。因此，BRIEF的构建和匹配速度都非常快。我们将其与SURF和SIFT在标准基准上进行比较，并表明它产生了相当的识别精度，同时运行所需的时间几乎为零。
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.