Sciweavers

Share
TIP
2008

Using Spanning Graphs for Efficient Image Registration

9 years 1 months ago
Using Spanning Graphs for Efficient Image Registration
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm that, for the first time, jointly estimates both an alignment measure and a viable descent direction with respect to a parameterized class of spatial transformations. We also show how prior information about the interimage modality relationship from prealigned image pairs can be incorporated into the graph-based algorithm. A comparison of the graph theoretic alignment measure is provided with more traditional measures based on plug-in entropy estimators. This highlights previously unrecognized similarities between these two registration methods. Our analysis gives additional insight into the tradeoffs the graph-based algorithm is making and how these will manifest themselves in the registration algorithm's performance.
Mert R. Sabuncu, Peter J. Ramadge
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TIP
Authors Mert R. Sabuncu, Peter J. Ramadge
Comments (0)
books