A Pyramid Approach to Sub-Pixel Registration Based on Intensity (1998)
| Citations: | 76 - 16 self |
BibTeX
@MISC{Thevenaz98apyramid,
author = {Philippe Thevenaz and Urs Ruttiman and Michal Unser},
title = {A Pyramid Approach to Sub-Pixel Registration Based on Intensity},
year = {1998}
}
Years of Citing Articles
OpenURL
Abstract
We present an automatic sub-pixel registration algorithm that minimizes the mean square intensity difference between a reference and a test data set, which can be either images (2-D) or volumes (3-D). It uses an explicit spline representation of the images in conjunction with spline processing, and is based on a coarse-to-fine iterative strategy (pyramid approach). The minimization is performed according to a new variation (ML*) of the Marquardt-Levenberg algorithm for non-linear least-square optimization. The geometric deformation model is a global 3-D affine transformation that can be optionally restricted to rigid-body motion (rotation and translation), combined with isometric scaling. It also includes an optional adjustment of image contrast differences. We obtain excellent results for the registration of intra-modality Positron Emission Tomography (PET) and functional Magnetic Resonance Imaging (fMRI) data. We conclude that the multi-resolution refinement strategy is more robust than a comparable single-stage method, being less likely to be trapped into a false local optimum. In addition, our improved version of the Marquardt-Levenberg algorithm is faster.







