Directed Graph Based Image Registration
In this paper, a novel intermediate templates guided image registration algorithm is proposed to achieve accurate registration results with a more appropriate strategy for intermediate template selection. We first demonstrate that registration directions and paths play a key role in the intermediate template guided registration methods. In light of this, a directed graph is built based on the asymmetric distances defined on all ordered image-pairs in the dataset. The allocated directed path can be used to guide the pairwise registration by successively registering the underlying subject towards the template through all intermediate templates on the path. Moreover, for the groupwise registration, a minimum spanning arborescence (MSA) is built with both the template (the root) and the directed paths (from all images to the template) determined simultaneously. Experiments on synthetic and real datasets show that our method can achieve more accurate registration results than both the traditional pairwise registration and the undirected graph based registration methods.
KeywordsDirected Graph Image Registration Undirected Graph Registration Method Virtual Node
Unable to display preview. Download preview PDF.
- 2.Vercauteren, T., Pennec, X., Perchant, A., Ayache, N.: Diffeomorphic demons: efficient non-parametric image registration. Neuroimage 45, S61–S72 (2009)Google Scholar
- 3.Munsell, B.C., Temlyakov, A., Wang, S.: Fast Multiple Shape Correspondence by Pre-Organizing Shape Instances. In: IEEE Conference on CVPR, pp. 840–847 (2009)Google Scholar
- 5.Avants, B., Gee, J.C.: Geodesic estimation for large deformation anatomical shape averaging and interpolation. NeuroImage 23, S139–S150 (2004)Google Scholar