Optimization is a key component of image registration. Due to the non-convexity and high computation cost of the objective function, a common tactic is to set an initial guess and then use multi-resolution or local optimization methods to find a local optimum of the objective function. For almost all local optimization methods, the initial location in the search space plays a critical role in the accuracy of the registration. Initial guesses are often obtained through data-specific methods. The paper offers a new hybrid optimization method assisted by a density-based clustering algorithm. The new method is less data-specific and more suitable for semi-automatic or automatic image registration. Global optimization does not guarantee timely convergence. A genetic algorithm is a component of our hybrid method; however, our method usually converges within a reasonable time. This new method has been applied to registering high resolution brain images.
A cluster-assisted global optimization method for high resolution medical image registration
2004-01-01
332250 byte
Conference paper
Electronic Resource
English
Selective Corner Matching for High-Resolution Image Registration
British Library Conference Proceedings | 2006
|Image-to-Image Registration tp Produce High-Resolution Images
Online Contents | 1997
|Image Registration Using Single Cluster PHD Methods
British Library Conference Proceedings | 2017
|Global cost optimization in image registration using simulated annealing [3457-12]
British Library Conference Proceedings | 1998
|