为什么 ORB 的计算效率比 SURF 和 SIFT 高得多?

Why is ORB so much more computationally efficient that SURF and SIFT?

我正在写一篇论文,需要一些帮助。谁能解释为什么 ORB 特征的计算效率比 SURF 和 SIFT 特征高得多?

ORB uses a template-based corner detector that is named FAST. In the FAST corner detector, a decision tree is learned to determine the order of pixels in the circular template. Using a decision tree to determine a point as a corner accelerates the processing time. This is the most important part of the speed factor.
SIFT uses DoG pyramid and Hessian Matrix. Working with the DoG is time-consuming. However, SURF 对 Hessian 矩阵使用盒式滤波器。它比高斯差分快,但不如 ORB(使用 FAST 角点检测器)快。这两种方法(SIFT 和 SURF)都是基于高斯 scale-spaces 上的偏微分。因此,ORB特征检测方法比SIFT和SURF方法计算效率更高