Resolving Implementation Ambiguity and Improving SURF

by   Peter Abeles, et al.

Speeded Up Robust Features (SURF) has emerged as one of the more popular feature descriptors and detectors in recent years. Performance and algorithmic details vary widely between implementations due to SURF's complexity and ambiguities found in its description. To resolve these ambiguities, a set of general techniques for feature stability is defined based on the smoothness rule. Additional improvements to SURF are proposed for speed and stability. To illustrate the importance of these implementation details, a performance study of popular SURF implementations is done. By utilizing all the suggested improvements, it is possible to create a SURF implementation that is several times faster and more stable.


page 3

page 5


Fast Estimation Method for the Stability of Ensemble Feature Selectors

It is preferred that feature selectors be stable for better interpretabi...

SHREC 2011: robust feature detection and description benchmark

Feature-based approaches have recently become very popular in computer v...

Optimised Playout Implementations for the Ludii General Game System

This paper describes three different optimised implementations of playou...

FastContext: an efficient and scalable implementation of the ConText algorithm

Objective: To develop and evaluate FastContext, an efficient, scalable i...

Eigenvector Component Calculation Speedup over NumPy for High-Performance Computing

Applications related to artificial intelligence, machine learning, and s...

Please sign up or login with your details

Forgot password? Click here to reset