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.
KeywordsQuadratic Polynomial Registration Algorithm Polynomial Expansion Deformable Registration Probabilistic Atlas
- 5.Knutsson, H., Westin, C.F.: Normalized and differential convolution: Methods for interpolation and filtering of incomplete and uncertain data. In: Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, New York City, USA, pp. 515–523. IEEE, Los Alamitos (1993)CrossRefGoogle Scholar
- 6.Farnebäck, G.: Polynomial Expansion for Orientation and Motion Estimation. PhD thesis, Linköping University, SE-581 83 Linköping, Sweden, Dissertation No. 790 (2002) ISBN 91-7373-475-6Google Scholar
- 7.ITK: The Insight Segmentation and Registration Toolkit, http://www.itk.org