Related Experiment Video
Updated: Sep 30, 2025
Brain Infarct Segmentation and Registration on MRI or CT for Lesion-symptom Mapping
Published on: September 25, 2019
A new approach to symmetric registration of longitudinal structural MRI of the human brain
1The Nathan S. Kline Institute for Psychiatric Research, Orangeburg, NY, USA; Department of Psychiatry, New York University School of Medicine, New York, NY, USA.
Background:
This paper presents the Automatic Temporal Registration Algorithm (ATRA) for symmetric rigid-body registration of longitudinal T1-weighted three-dimensional MRI scans of the human brain. This is a fundamental processing step in computational neuroimaging.
New Method:
The notion of leave-one-out consistent (LOOC) landmarks with respect to a supervised landmark detection algorithm is introduced. An automatic algorithm is presented for identification of LOOC landmarks on MRI scans. Multiple sets of LOOC landmarks are identified on each volume and a Generalized Orthogonal Procrustes Analysis of the landmarks is used to find a rigid-body transformation of each volume into a common space where the volumes are aligned precisely.
Results:
Qualitative and quantitative evaluations of ATRA registration accuracy were performed using 2012 volumes from 503 subjects (4 longitudinal volumes/subject), and on a further 120 volumes acquired from 3 normal subjects (40 longitudinal volumes/subject). Since the ground truth registrations are unknown, we devised a novel method for showing that ATRA's registration accuracy is at least better than 0.5 mm translation or 0.5° rotation.
Comparison With Existing Method(S):
In comparison with existing methods, ATRA does not require any image preprocessing (e.g., skull-stripping or intensity normalization) and can handle conditions where rigid-body motion assumptions are not true (e.g., movement in eyes, jaw, neck) and brain tissue loss over time in neurodegenerative diseases. In a systematic comparison with the FSL FLIRT algorithm, ATRA provided faster and more accurate registrations.
Conclusions:
The algorithm is symmetric, in the sense that any permutation of the input volumes does not change the transformation matrices, and unbiased, in that all volumes undergo exactly one interpolation operation, which precisely aligns them in a common space. There is no interpolation bias and no reference volume. All volumes are treated exactly the same. The algorithm is fast and highly accurate.
