3D point representation for pose estimation: Accelerated SIFT vs ORB

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Many novel local image descriptors (Random Ferns, ORB etc) are being proposed each year with claims of being as good as or superior to SIFT for representing point features. In this context we design a simple experimental framework to compare the performances of different descriptors for realtime recognition of 3D points in a given environment. We use this framework to show that robust descriptors like SIFT perform far better when compared to fast binary descriptors like ORB if matching process uses approximate nearest-neighbor search (ANNS) for acceleration. Such an analysis can be very useful for making appropriate choice from vast number of descriptors available in the literature.We further apply machine learning techniques to obtain better approximation of SIFT descriptor matching than ANNS. Though we could not improve its performance, our in-depth analysis of its root cause provides useful insights for guiding future exploration in this topic.

Cite

CITATION STYLE

APA

Bhat, K. K. S., Kannala, J., & Heikkilä, J. (2015). 3D point representation for pose estimation: Accelerated SIFT vs ORB. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9127, pp. 79–91). Springer Verlag. https://doi.org/10.1007/978-3-319-19665-7_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free