Semi-automatic Reference Standard Construction for Quantitative Evaluation of Lung CT Registration
MICCAI '08 Proceedings of the 11th International Conference on Medical Image Computing and Computer-Assisted Intervention, Part II
Adaptive Stochastic Gradient Descent Optimisation for Image Registration
International Journal of Computer Vision
As-rigid-as-possible image registration for hand-drawn cartoon animations
Proceedings of the 7th International Symposium on Non-Photorealistic Animation and Rendering
Directly manipulated free-form deformation image registration
IEEE Transactions on Image Processing
MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part I
Evaluation of 4D-CT Lung Registration
MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part I
Iterative Co-linearity Filtering and Parameterization of Fiber Tracts in the Entire Cingulum
MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part I
Cerebellum segmentation in MRI using atlas registration and local multi-scale image descriptors
ISBI'09 Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro
Computers and Electronics in Agriculture
Spatial information encoded mutual information for nonrigid registration
WBIR'10 Proceedings of the 4th international conference on Biomedical image registration
Fast algorithm for multisource image registration based on geometric feature of corners
ICIC'10 Proceedings of the 6th international conference on Advanced intelligent computing theories and applications: intelligent computing
Stochastic approximation for background modelling
Computer Vision and Image Understanding
Preconditioned stochastic gradient descent optimisation for monomodal image registration
MICCAI'11 Proceedings of the 14th international conference on Medical image computing and computer-assisted intervention - Volume Part II
A new evolutionary search strategy for global optimization of high-dimensional problems
Information Sciences: an International Journal
Segmentation of prostate using interactive finsler active contours and shape prior
ICISP'12 Proceedings of the 5th international conference on Image and Signal Processing
Computers and Electrical Engineering
GPU accelerated normalized mutual information and B-spline transformation
EG VCBM'08 Proceedings of the First Eurographics conference on Visual Computing for Biomedicine
Computer Methods and Programs in Biomedicine
Direct visualization of deformation in volumes
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
International Journal of Computer Vision
Hi-index | 0.01 |
A popular technique for nonrigid registration of medical images is based on the maximization of their mutual information, in combination with a deformation field parameterized by cubic B-splines. The coordinate mapping that relates the two images is found using an iterative optimization procedure. This work compares the performance of eight optimization methods: gradient descent (with two different step size selection algorithms), quasi-Newton, nonlinear conjugate gradient, Kiefer-Wolfowitz, simultaneous perturbation, Robbins-Monro, and evolution strategy. Special attention is paid to computation time reduction by using fewer voxels to calculate the cost function and its derivatives. The optimization methods are tested on manually deformed CT images of the heart, on follow-up CT chest scans, and on MR scans of the prostate acquired using a BFFE, Tl, and T2 protocol. Registration accuracy is assessed by computing the overlap of segmented edges. Precision and convergence properties are studied by comparing deformation fields. The results show that the Robbins-Monro method is the best choice in most applications. With this approach, the computation time per iteration can be lowered approximately 500 times without affecting the rate of convergence by using a small subset of the image, randomly selected in every iteration, to compute the derivative of the mutual information. From the other methods the quasi-Newton and the nonlinear conjugate gradient method achieve a slightly higher precision, at the price of larger computation times.