Computing parallel speeded-up robust features (P-SURF) via POSIX threads

Abstract

Speeded-Up Robust Features (SURF), an image local feature extracting and describing method, finds and describes point correspondences between images with different viewing conditions. Despite the fact that it has recently been developed, SURF has already successfully found its applications in the area of computer vision, and was reported to be more appealing than the earlier Scale-Invariant Feature Transform (SIFT) in terms of robustness and performance. This paper presents a multi-threaded algorithm and its implementation that computes the same SURF. The algorithm parallelises several stages of computations in the original, sequential design. The main benefit brought about is the acceleration in computing the descriptor. Tests have been performed to show that the parallel SURF (P-SURF) generally shortened the computation time by a factor of 2 to 6 than the original, sequential method when running on multi-core processors. © 2009 Springer Berlin Heidelberg.