Comparison of SURF implementations
Speeded Up Robust Feature (SURF) is a state-of-the-art image region descriptor and detector that is invariant with regard to scale, orientation, and illumination. By using an integral image, the descriptor can be computed efficiently across different scales. In recent years it has emerged as one of the more popular and frequently-used feature descriptors, but it is not a trivial algorithm to implement, and several different implementations exist. The following study compares several different libraries to determine relative stability and runtime performance.
Results Last Updated: February 2, 2012
For a more detailed discussion of the algorithmic difference between these implementations and clarifications of ambiguities found in the original SURF paper, see the draft paper below:
Fast but less accurate. See FactoryDescribeRegionPoint.surf()
Accurate but slower. See FactoryDescribeRegionPoint.surfm()
|OpenCV||2.3.1 SVN r6879||C++||No ||http://opencv.willowgarage.com/wiki/|
 OpenCV can be configured to use multi-threaded code if it is compiled with IPP. Only a single thread was used in this test.
Benchmark Source Code:
- Study was performed by Peter Abeles
- Questions or Comments?
- Post those here: https://groups.google.com/group/boofcv
|Figure 1: Runtime performance comparison for detecting and describing. Single 850x680 pixel image and 2000 features. Lower is better.|
|Figure 2: Overall region descriptor stability comparison. Scores are relative to the best library. Higher is better.||Figure 3: Overall stability of interest point detection. Scores are relative to the best library. Higher is better.|
For the sake of those with short attention spans, the summary results are posted first and a discussion of testing methodology follows. Figure 1 shows how fast each library could detect and describe interest points. Figures 2 and 3 show a summary of each implementation's relative stability for describing and detecting across a standard set of test images.
For a discussion of these results and an understanding of why different implementations performed better than others, see the pre-print paper above. In summary, libraries with better stability did a better job of addressing the smoothness rule. Major differentiators between libraries involve how the gradient is interpolated during descriptor calculation and how the image border is handled. The reference library runs slowly and the binary is no longer compatible with the latest releases of Linux. If an alternative implementation is used to represent SURF's performance, it is recommended that Pan-o-Matic, or BoofCV be used. Other libraries exhibited significantly worse stability in the descriptor and/or detection calculations. BoofCV is able to achieve its speed despite being a Java library through several small algorithmic changes.
The stability benchmark was performed using standardized test images from , which have known transformations. Stability was measured based on the number of correct associations between two images in the data set. The testing procedure for each library is summarized below:
- For each image, detect features (scale and location) using the fast Hessian detector in the reference library.
- Save results to a file and use the same file for all libraries.
- For each image, compute a feature description (including orientation) for all features found.
- In each image sequence, associate features in the first image to the Nth image, where N > 1.
- Association is done by minimizing Euclidean error.
- Validation is done using reverse association, i.e. the association must be the optimal association going from frame 1 to N and N to 1.
- Compute the number of correct associations.
- An association is correct if it is within 3 pixels of the true location.
Since the transformation is known between images, the true location could have been used. However, in reality features will not lie at the exact point, and a descriptor needs to be tolerant of this type of error. Thus, this is a more accurate measure of the descriptor's strength in real-world data.
Stability results shown in Figure 2 display the relative stability across all test images for each library. Relative stability is computed by summing up the total percent of correctly associated features across the whole test data set, and then choosing the library with the best performance. The relative stability is computed by dividing each library's score by the best performer's score.
Configuration: All libraries were configured to describe oriented SURF-64 features as defined in the original SURF paper. JavaSURF does not support orientation estimation.
SURF feature points are typically detected using the fast Hessian detector described in the SURF paper. Interest point detection stability refers to how well an interest's point location and scale is detect after the image has undergone a transformation. A perfect detector would detect a point in the same location as it was in the original image after applying the image transform.
Performance was measured based upon the fraction of the total features detected in the first image which had a corresponding interest point detected in the later images. Two interest points were said to correspond if their location and scales were both within tolerance. The expected location and scale was computed using the known transformations. Scale was computed by sampling four evenly spaced points one pixel away from an interest point in the first frame. The known transform was then applied to each point and the change in distance measured. The expected scale was set to the average distance each point was from transformed interest point location.
When compiling the results it was noticed that libraries which detected more features always scored better when using the just mentioned metric. It was also noted that a poorly behaving detector could score highly in the just mentioned metric. For example if every pixel was marked as an interest point or if densely packed clusters were returned as detected features. One of the libraries even had a known bug were false positives would be returned near the image border.
To compensate for these issues, only interest points were considered if they were an unambiguous match and the detection threshold was tuned to return the same number of features for at least one image. A match was declared as ambiguous if more than one interest point was found to be close to the expected interest point location.
- Tune detection threshold to detect about 2000 features in graffiti image 1
- Only consider a 3x3 non-max region
- Octaves: 4
- Scales: 4
- Base Size: 9
- Initial Pixel Skip: 1
- Detect interest points in all images
- Transform interest points in image 1 to image N
- For each interest point in image 1:
- Find all interest points in image N within 1.5 pixels and 25% of the expected scale.
- If the expected pixel location is outside the image, ignore.
- If the number of matches is more than one, ignore.
- If the number of matches is one, mark the interest point as a correct detection.
- Count number of valid interest points which have zero or one matches.
- Detection metric for each image in the sequence is the total number of correct detections divided by the number of valid interest points.
The summary chart is generated by summing up the detection metric for each library across all the images and then dividing each library's score by the library with the best score.
Each library's speed in describing and detecting was benchmarked together (Figure 2). Each test was performed 11 times with the median time being shown. Java libraries tended to exhibit more variation than native libraries, although all libraries showed a significant amount of variation from trial to trial.
Only image processing time essential to SURF was measured, not image loading time. Time to convert the gray scale image into an integral image was measured, but not the time to convert the image to grayscale. Even if these image processing tasks were included, they would only account for a small fraction of the overall computation time. Elapsed time was measured in the actual application using System.currentTimeMillis() in Java and clock() in C++.
Testing Procedure for Describe:
- Kill all extraneous processes.
- Load feature location and size from file.
- Detect interest points and compute descriptors while recording elapsed time.
- Compute elapsed time 10 times and output best result.
- Run the whole experiment 11 times for each library and record the median time.
- Ubuntu 10.10 64bit
- Quadcore Q6600 2.4 GHz
- Memory 8194 GB
- g++ 4.4.5
- Java(TM) SE Runtime Environment (build 1.6.0_26-b03)
Compiler and JRE Configuration:
- All native libraries were compiled with -O3
- Java applications were run with no special flags
- Java has defaulted to "-server" on desktop computers since Java 6, see this technote.
- input image was boat/img1
- Impossible to configure libraries to detect exact same features
- Adjusted detection threshold to top out at around 2000 features
- Octaves: 4
- Scales: 4
- Base Size: 9
- Initial Pixel Skip: 1
Comments: Both BoofCV-F and BoofCV-M use the same detector which is why only BoofCV is listed in the detector results.
- February 2, 2012
- Updated results
- Changed runtime performance from being the min time to the median time
- OpenCV no longer detects its own features for descriptor stability. Slight improvement in results
- Descriptor stability benchmark uses interest points detected from the reference library now
- Pan-o-Matic was not being compiled with -O3 before
- December 5, 2011
- Forked benchmark source code into its own project and updated links
- November 14, 2011
- Added detect stability results
- November 12, 2011
- Added Pan-o-Matic to overall results