Real-time robust image feature description and matching

3Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The problem of finding corresponding points between images of the same scene is at the heart of many computer vision problems. In this paper we present a real-time approach to finding correspondences under changes in scale, rotation, viewpoint and illumination using Simple Circular Accelerated Robust Features (SCARF). Prominent descriptors such as SIFT and SURF find robust correspondences, but at a computation cost that limits the number of points that can be handled on low-memory, low-power devices. Like SURF, SCARF is based on Haar wavelets. However, SCARF employs a novel non-uniform sampling distribution, structure, and matching technique that provides computation times comparable to the state-of-the-art without compromising distinctiveness and robustness. Computing 512 SCARF descriptors takes 12.6ms on a 2.4GHz processor, and each descriptor occupies just 60 bytes. Therefore the descriptor is ideal for real-time applications which are implemented on low-memory, low-power devices. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Thomas, S. J., MacDonald, B. A., & Stol, K. A. (2011). Real-time robust image feature description and matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6493 LNCS, pp. 334–345). https://doi.org/10.1007/978-3-642-19309-5_26

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