Share Email Print
cover

Proceedings Paper

Spline pyramids for intermodal image registration using mutual information
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We propose a new optimizer for multiresolution image registration. It is adapted to a criterion known as mutual information and is well suited to inter-modality. Our iteration strategy is inspired by the Marquardt-Levenberg algorithm, even though the underlying problem is not least- squares. We develop a framework based on a continuous polynomial spline representation of images. Together with the use of Parzen histogram estimates, it allows for closed- form expressions of the gradient and Hessian of the criterion. Tremendous simplifications result from the choice of Parzen windows satisfying the partition of unity, also based on B-splines. We use this framework to compute an image pyramid and to set our optimizer in a multiresolution context. We perform several experiments and show that it is particularly well adapted to a coarse-to-fine optimization strategy. We compare our approach to the popular Powell algorithm and conclude that our proposed optimizer is faster, at no cost in robustness or precision.

Paper Details

Date Published: 30 October 1997
PDF: 12 pages
Proc. SPIE 3169, Wavelet Applications in Signal and Image Processing V, (30 October 1997); doi: 10.1117/12.292794
Show Author Affiliations
Philippe Thevenaz, National Institutes of Health (United States)
Michael A. Unser, National Institutes of Health (United States)


Published in SPIE Proceedings Vol. 3169:
Wavelet Applications in Signal and Image Processing V
Akram Aldroubi; Andrew F. Laine; Michael A. Unser, Editor(s)

© SPIE. Terms of Use
Back to Top