ECCV 2014 - LNCS 8689-8695

Tractable and Reliable Registration of 2D Point Sets

Erik Ask¹, Olof Enqvist², Linus Svärm¹, Fredrik Kahl^{1, 2}, and Giuseppe Lippolis³

¹Centre for Mathematical Sciences, Lund University, Lund, Sweden

²Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden

³Department of Clinical Sciences, Division of Urological Cancers, Skåne University Hospital, Lund University, Malmö, Sweden

Abstract. This paper introduces two new methods of registering 2D point sets over rigid transformations when the registration error is based on a robust loss function. In contrast to previous work, our methods are guaranteed to compute the optimal transformation, and at the same time, the worst-case running times are bounded by a low-degree polynomial in the number of correspondences. In practical terms, this means that there is no need to resort to ad-hoc procedures such as random sampling or local descent methods that cannot guarantee the quality of their solutions.

We have tested the methods in several different settings, in particular, a thorough evaluation on two benchmarks of microscopic images used for histologic analysis of prostate cancer has been performed. Compared to the state-of-the-art, our results show that the methods are both tractable and reliable despite the presence of a significant amount of outliers.

LNCS 8689, p. 393 ff.

Full article in PDF | BibTeX