Cookies on this website
We use cookies to ensure that we give you the best experience on our website. If you click 'Continue' we'll assume that you are happy to receive all cookies and you won't see this message again. Click 'Find out more' for information on how to change your cookie settings.

Log-euclidean polyaffine transforms have recently been introduced to characterize the local affine behavior of the deformation in principal anatomical structures. The elegant mathematical framework makes them a powerful tool for image registration. However, their application is limited to large structures since they require the pre-definition of affine regions. This paper extends the polyaffine registration to adaptively fit a log-euclidean polyaffine transform that captures deformations at smaller scales. The approach is based on the sparse selection of matching points in the images and the formulation of the problem as an expectation maximization iterative closest point problem. The efficiency of the algorithm is shown through experiments on inter-subject registration of brain MRI between a healthy subject and patients with multiple sclerosis.

Original publication

DOI

10.1007/978-3-642-23629-7_72

Type

Journal article

Journal

Med Image Comput Comput Assist Interv

Publication Date

2011

Volume

14

Pages

590 - 597

Keywords

Algorithms, Brain, Brain Mapping, Data Interpretation, Statistical, Diagnostic Imaging, Humans, Image Processing, Computer-Assisted, Magnetic Resonance Imaging, Models, Statistical, Reproducibility of Results