Active Testing Search for Point Cloud Matching
Type of documentArticle
Amável Pinheiro, Miguel
Rights(c) 2013 Springer. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-38868-2_48
MetadataShow full item record
We present a general approach for solving the point-cloud matching problem for the case of mildly nonlinear transformations. Our method quickly nds 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 re ne 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.
The following license files are associated with this item: