Robust Non-Rigid Registration of 2D and 3D Graphs

• Presented at: Conference on Computer Vision and Pattern Recognition, Providence, RI, USA, June 2012
• Publication date: 2012

We present a new approach to matching graphs embedded in R2 or R3. Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not require an initial alignment, can handle partial matches, and can cope with non-linear deformations and topological differences. To handle arbitrary non-linear deformations, we represent them as Gaussian Processes. In the absence of appearance information, we iteratively establish correspondences between graph nodes, update the structure accordingly, and use the current mapping estimate to find the most likely correspondences that will be used in the next iteration. This makes the computation tractable. We demonstrate the effectiveness of our approach first on synthetic cases and then on angiography data, retinal fundus images, and microscopy image stacks acquired at very different resolutions.

Keywords: Registration, Graph Matching, Gaussian Processes

Reference

• EPFL-CONF-176238

Record created on 2012-04-17, modified on 2017-05-12