Active Testing Search for Point Cloud Matching

We present a general approach for solving the point-cloud matching problem for the case of mildly nonlinear transformations. Our method quickly finds a coarse approximation of the solution by exploring a reduced set of partial matches using an approach to which we refer to as Active Testing Search (...

Full description

Saved in:
Bibliographic Details
Published inInformation Processing in Medical Imaging pp. 572 - 583
Main Authors Pinheiro, Miguel Amável, Sznitman, Raphael, Serradell, Eduard, Kybic, Jan, Moreno-Noguer, Francesc, Fua, Pascal
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:We present a general approach for solving the point-cloud matching problem for the case of mildly nonlinear transformations. Our method quickly finds a coarse approximation of the solution by exploring a reduced set of partial matches using an approach to which we refer to as Active Testing Search (ATS). We apply the method to registration of graph structures by branching point matching. It is based solely on the geometric position of the points, no additional information is used nor the knowledge of an initial alignment. In the second stage, we use dynamic programming to refine the solution. We tested our algorithm on angiography, retinal fundus, and neuronal data gathered using electron and light microscopy. We show that our method solves cases not solved by most approaches, and is faster than the remaining ones.
ISBN:3642388671
9783642388675
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-38868-2_48