Andronache A, von Siebenthal M, Székely G, Cattin Ph
ETH Zurich-Computer Vision Laboratory, Sternwartstrasse 7, CH-8092 Zurich, Switzerland.
Med Image Anal. 2008 Feb;12(1):3-15. doi: 10.1016/j.media.2007.06.005. Epub 2007 Jun 28.
The hierarchical subdivision strategy which decomposes a non-rigid matching problem into numerous local rigid transformations is a very common approach in image registration. While mutual information (MI) has proven to be a very robust and reliable similarity measure for intensity-based matching of multi-modal images, numerous problems have to be faced if it is applied to small-sized images, compromising its usefulness for such subdivision schemes. We examine and explain the loss of MI's statistical consistency along the hierarchical subdivision. Information theoretical measures are proposed to identify the problematic regions in order to overcome the MI drawbacks. This does not only improve the accuracy and robustness of the registration, but also can be used as a very efficient stopping criterion for the further subdivision of nodes in the hierarchy, which drastically reduces the computational cost of the entire registration procedure. Moreover, we present a new intensity mapping technique allowing to replace MI by more reliable measures for small patches. Integrated into the hierarchical framework, this mapping can locally transform the multi-modal images into an intermediate pseudo-modality. This intensity mapping uses the local joint intensity histograms of the coarsely registered sub-images and allows the use of the more robust and computationally more efficient cross-correlation coefficient (CC) for the matching at lower levels of the hierarchy.
将非刚性匹配问题分解为众多局部刚性变换的分层细分策略是图像配准中非常常见的方法。虽然互信息(MI)已被证明是用于多模态图像基于强度匹配的非常稳健且可靠的相似性度量,但如果将其应用于小尺寸图像,则必须面对众多问题,这会损害其在此类细分方案中的实用性。我们研究并解释了沿分层细分过程中MI统计一致性的损失。提出了信息理论度量来识别有问题的区域,以克服MI的缺点。这不仅提高了配准的准确性和稳健性,还可以用作层次结构中节点进一步细分的非常有效的停止准则,从而大幅降低整个配准过程的计算成本。此外,我们提出了一种新的强度映射技术,允许用更可靠的度量来替代小图像块的MI。集成到分层框架中,这种映射可以将多模态图像局部变换为中间伪模态。这种强度映射使用粗略配准的子图像的局部联合强度直方图,并允许在层次结构的较低级别使用更稳健且计算效率更高的互相关系数(CC)进行匹配。