Biomedical Imaging GroupSTI
English only   BIG > Publications > Multiscale Registration

 Home Page
 News & Events
 Tutorials and Reviews
 Download Algorithms

 All BibTeX References

Iterative Multi-Scale Registration without Landmarks

P. Thévenaz, U.E. Ruttimann, M. Unser

Proceedings of the 1995 IEEE International Conference on Image Processing (ICIP'95), Washington DC, USA, October 23-26, 1995, vol. III, pp. 228-231.

We present an automatic sub-pixel registration algorithm that minimizes the mean square difference of intensities between a reference and a test data set (volumes or images). It uses spline processing, is based on a coarse-to-fine pyramid strategy, and performs minimization according to a variation of the iterative Marquardt-Levenberg scheme. The geometric deformation model is a general affine transformation that one may optionally restrict to a rigid-body (isometric scale, rotation and translation), procrustean (rotation and translation) or translational case; it also includes an optional parameter for the linear adaptation of intensity. We present several PET and fMRI experiments and show that this algorithm provides excellent results. We conclude that the multi-resolution refinement strategy is faster and more robust than a comparable single-scale one.

AUTHOR="Th{\'{e}}venaz, P. and Ruttimann, U.E. and Unser, M.",
TITLE="Iterative Multi-Scale Registration without Landmarks",
BOOKTITLE="Proceedings of the 1995 {IEEE} International Conference
        on Image Processing ({ICIP'95})",
address="Washington DC, USA",
month="October 23-26,",

© 1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.