Issue No. 11 - November (2010 vol. 32)
Timothy F. Cootes , University of Manchester, Manchester
Carole J. Twining , University of Manchester, Manchester
Vladimir S. Petrović , University of Manchester, Manchester
Kolawole O. Babalola , University of Manchester, Manchester
Christopher J. Taylor , University of Manchester, Manchester
Groupwise image registration algorithms seek to establish dense correspondences between sets of images. Typically, they involve iteratively improving the registration between each image and an evolving mean. A variety of methods have been proposed, which differ in their choice of objective function, representation of deformation field, and optimization methods. Given the complexity of the task, the final accuracy is significantly affected by the choices made for each component. Here, we present a groupwise registration algorithm which can take advantage of the statistics of both the image intensities and the range of shapes across the group to achieve accurate matching. By testing on large sets of images (in both 2D and 3D), we explore the effects of using different image representations and different statistical shape constraints. We demonstrate that careful choice of such representations can lead to significant improvements in overall performance.
Nonrigid registration, correspondence problem, appearance models.
C. J. Taylor, K. O. Babalola, V. S. Petrović, C. J. Twining and T. F. Cootes, "Computing Accurate Correspondences across Groups of Images," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 32, no. , pp. 1994-2005, 2009.