Comparison of gradient approximation techniques for optimisation of mutual information in nonrigid registration

Stefan Klein; Marius Staring; Josien P. W. Pluim

doi:10.1117/12.595277

29 April 2005 Comparison of gradient approximation techniques for optimisation of mutual information in nonrigid registration

Stefan Klein, Marius Staring, Josien P. W. Pluim

Author Affiliations +

Proceedings Volume 5747, Medical Imaging 2005: Image Processing; (2005) https://doi.org/10.1117/12.595277
Event: Medical Imaging, 2005, San Diego, California, United States

Abstract

Nonrigid registration of medical images by maximisation of their mutual information, in combination with a deformation field parameterised by cubic B-splines, has been shown to be robust and accurate in many applications. However, the high computation time is a big disadvantage. This work focusses on the optimisation procedure. Many implementations follow a gradient-descent like approach. The time needed for computing the derivative of the mutual information with respect to the B-spline parameters is the bottleneck in this process. We investigate the influence of several gradient approximation techniques on the number of iterations needed and the computation time per iteration. Three methods are studied: a simple finite difference strategy, the so-called simultaneous perturbation method, and a more analytic computation of the gradient based on a continuous, and differentiable representation of the joint histogram. In addition, the effect of decreasing the number of image samples, used for computing the gradient in each iteration, is investigated. Two types of experiments are performed. Firstly, the registration of an image to itself, after application of a known, randomly generated deformation, is considered. Secondly, experiments are performed with 3D ultrasound brain scans, and 3D CT follow-up scans of the chest. The experiments show that the method using an analytic gradient computation outperforms the other two. Furthermore, the computation time per iteration can be extremely decreased, without affecting the rate of convergence and final accuracy, by using very few samples of the image (randomly chosen every iteration) to compute the derivative. With this approach, large data sets (256³) can be registered within 5 minutes on a moderate PC.

Citation Download Citation

Stefan Klein, Marius Staring, and Josien P. W. Pluim "Comparison of gradient approximation techniques for optimisation of mutual information in nonrigid registration", Proc. SPIE 5747, Medical Imaging 2005: Image Processing, (29 April 2005); https://doi.org/10.1117/12.595277

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available