Affine and deformable registration based on polynomial expansion.
This paper presents a registration framework based on the polynomial expansion transform. The idea of polynomial expansion is that the image is locally approximated by polynomials at each pixel. Starting with observations of how the coefficients of ideal linear and quadratic polynomials change under translation and affine transformation, algorithms are developed to estimate translation and compute affine and deformable registration between a fixed and a moving image, from the polynomial expansion coefficients. All algorithms can be used for signals of any dimensionality. The algorithms are evaluated on medical data.
Farnebäck
Gunnar
G
Department of Radiology, Brigham and Womens' Hospital, Harvard Medical School, Boston, MA 02115, USA.
Westin
Carl-Fredrik
CF
D000465:Algorithms; D000818:Animals; D001185:Artificial Intelligence; D006801:Humans; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000379:methods*; D009716:Numerical Analysis, Computer-Assisted; D010363:Pattern Recognition, Automated / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D013382:Subtraction Technique; D013552:Swine