Publication

Active testing search for point cloud matching

Conference Article

Conference

International Conference on Information Processing in Medical Imaging (IPMI)

Edition

23rd

Pages

572-583

Doc link

http://dx.doi.org/10.1007/978-3-642-38868-2_48

File

Download the digital copy of the doc pdf document

Abstract

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 rene 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.

Categories

computer vision, image matching.

Author keywords

graph matching, non-rigid registration, active search

Scientific reference

M.A. Pinheiro, R. Sznitman, E. Serradell, J. Kybic, F. Moreno-Noguer and P. Fua. Active testing search for point cloud matching, 23rd International Conference on Information Processing in Medical Imaging, 2013, Asilimar, USA, in Information Processing in Medical Imaging, Vol 7917 of Lecture Notes in Computer Science, pp. 572-583, Springer-Verlag.