Multi‐modal robust inverse‐consistent linear registration

Abstract

Registration performance can significantly deteriorate when image regions do not comply with model assumptions. Robust estimation improves registration accuracy by reducing or ignoring the contribution of voxels with large intensity differences, but existing approaches are limited to monomodal registration. In this work, we propose a robust and inverse-consistent technique for crossmodal, affine image registration. The algorithm is derived from a contextual framework of image registration. The key idea is to use a modality invariant representation of images based on local entropy estimation, and to incorporate a heteroskedastic noise model. This noise model allows us to draw the analogy to iteratively reweighted least squares estimation and to leverage existing weighting functions to account for differences in local information content in multimodal registration. Furthermore, we use the nonparametric windows density estimator to reliably calculate entropy of small image patches. Finally, we derive the Gauss–Newton update and show that it is equivalent to the efficient secondorder minimization for the fully symmetric registration approach. We illustrate excellent performance of the proposed methods on datasets containing outliers for alignment of brain tumor, full head, and histology images.

Contour-Driven Atlas-Based Segmentation

“…Examples of such features include Gabor wavelet features [40], [41], local binary patterns [42], Haar-like features [43], and histograms of oriented gradients [44]. Results of an empirical study that compared several features for non-local means segmentation [45] indicates good results for features that compute image gradients and local entropies [46], [47]. …”