title: Spatially adaptive log-euclidean polyaffine registration based on sparse matches.
abstract: 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.
authors: ICTEAM Institute, Université Catholique de Louvain, Louvain-La-Neuve, Belgium. maxime.taquet@uclouvain.be
authors: Maxime
authors: M
authors: Taquet
authors: Benoît
authors: B
authors: Macq
authors: Simon K
authors: SK
authors: Warfield
mesh_terms: D000465:Algorithms; D001921:Brain / Q000473:pathology*; D001931:Brain Mapping / Q000379:methods*; D003627:Data Interpretation, Statistical; D003952:Diagnostic Imaging / Q000379:methods*; D006801:Humans; D007091:Image Processing, Computer-Assisted / Q000379:methods*; D008279:Magnetic Resonance Imaging / Q000379:methods; D015233:Models, Statistical; D015203:Reproducibility of Results