Translator Disclaimer
30 October 1997 Spline pyramids for intermodal image registration using mutual information
Author Affiliations +
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.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Philippe Thevenaz and Michael A. Unser "Spline pyramids for intermodal image registration using mutual information", Proc. SPIE 3169, Wavelet Applications in Signal and Image Processing V, (30 October 1997); doi: 10.1117/12.292794; https://doi.org/10.1117/12.292794
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
Back to Top