Do We Need Binary Features for 3D Reconstruction?
This addresses the problem of efficient feature matching for 3D reconstruction in computer vision, but it is incremental as it evaluates existing methods on a new dataset.
The paper investigates whether binary features are effective for 3D reconstruction, which requires many matching operations, and finds that most binary features underperform compared to SIFT in accuracy and completeness without significant computational gains.
Binary features have been incrementally popular in the past few years due to their low memory footprints and the efficient computation of Hamming distance between binary descriptors. They have been shown with promising results on some real time applications, e.g., SLAM, where the matching operations are relative few. However, in computer vision, there are many applications such as 3D reconstruction requiring lots of matching operations between local features. Therefore, a natural question is that is the binary feature still a promising solution to this kind of applications? To get the answer, this paper conducts a comparative study of binary features and their matching methods on the context of 3D reconstruction in a recently proposed large scale mutliview stereo dataset. Our evaluations reveal that not all binary features are capable of this task. Most of them are inferior to the classical SIFT based method in terms of reconstruction accuracy and completeness with a not significant better computational performance.