Tractable and Reliable Registration of 2D Point Sets
Paper i proceeding, 2014

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-theart, our results show that the methods are both tractable and reliable despite the presence of a significant amount of outliers.

Författare

Erik Ask

Lunds universitet

Olof Enqvist

Chalmers, Signaler och system, Signalbehandling och medicinsk teknik, Digitala bildsystem och bildanalys

Linus Svärm

Lunds universitet

Fredrik Kahl

Chalmers, Signaler och system, Signalbehandling och medicinsk teknik, Digitala bildsystem och bildanalys

Giuseppe Lippolis

Skånes universitetssjukhus (SUS)

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 8689 PART 1 393-406

Ämneskategorier

Datorseende och robotik (autonoma system)

Medicinsk bildbehandling

DOI

10.1007/978-3-319-10590-1_26

ISBN

978-3-319-10589-5