Department of Computer Science, University of North Carolina at Chapel Hill, USA.
Hum Brain Mapp. 2010 Aug;31(8):1128-40. doi: 10.1002/hbm.20923.
Groupwise registration has recently been proposed for simultaneous and consistent registration of all images in a group. Since many deformation parameters need to be optimized for each image under registration, the number of images that can be effectively handled by conventional groupwise registration methods is limited. Moreover, the robustness of registration is at stake due to significant intersubject variability. To overcome these problems, we present a groupwise registration framework, which is based on a hierarchical image clustering and atlas synthesis strategy. The basic idea is to decompose a large-scale groupwise registration problem into a series of small-scale problems, each of which is relatively easy to solve using a general computer. In particular, we employ a method called affinity propagation, which is designed for fast and robust clustering, to hierarchically cluster images into a pyramid of classes. Intraclass registration is then performed to register all images within individual classes, resulting in a representative center image for each class. These center images of different classes are further registered, from the bottom to the top in the pyramid. Once the registration reaches the summit of the pyramid, a single center image, or an atlas, is synthesized. Utilizing this strategy, we can efficiently and effectively register a large image group, construct their atlas, and, at the same time, establish shape correspondences between each image and the atlas. We have evaluated our framework using real and simulated data, and the results indicate that our framework achieves better robustness and registration accuracy compared to conventional methods.
分组配准最近被提出用于同时和一致地配准一组中的所有图像。由于在配准下需要为每个图像优化许多变形参数,因此常规分组配准方法能够有效处理的图像数量是有限的。此外,由于受试者间的显著可变性,配准的稳健性受到了影响。为了克服这些问题,我们提出了一种基于分层图像聚类和图谱综合策略的分组配准框架。基本思想是将大规模的分组配准问题分解为一系列小规模的问题,每个问题都可以使用普通计算机相对容易地解决。特别是,我们使用了一种称为亲和力传播的方法,该方法专为快速和稳健的聚类而设计,用于分层地将图像聚类为类的金字塔。然后,对每个类内的所有图像进行内部类配准,从而为每个类生成一个代表性的中心图像。这些不同类别的中心图像进一步从金字塔的底部到顶部进行配准。一旦注册到达金字塔的顶点,就会合成单个中心图像或图谱。利用这种策略,我们可以高效地对大量图像组进行配准,构建它们的图谱,并同时在每个图像和图谱之间建立形状对应关系。我们使用真实和模拟数据评估了我们的框架,结果表明与传统方法相比,我们的框架具有更好的稳健性和配准精度。