Search

Landmark correspondences are a widely used type of gold standard in image registration. However, the manual placement of corresponding points is subject to high inter-user variability in the chosen annotated locations and in the interpretation of visual ambiguities. In this paper, we introduce a principled strategy for the construction of a gold standard in deformable registration. Our framework: (i) iteratively suggests the most informative location to annotate next, taking into account its redundancy with previous annotations; (ii) extends traditional pointwise annotations by accounting for the spatial uncertainty of each annotation, which can either be directly specified by the user, or aggregated from pointwise annotations from multiple experts; and (iii) naturally provides a new strategy for the evaluation of deformable registration algorithms. Our approach is validated on four different registration tasks. The experimental results show the efficacy of suggesting annotations according to their informativeness, and an improved capacity to assess the quality of the outputs of registration algorithms. In addition, our approach yields, from sparse annotations only, a dense visualization of the errors made by a registration method. The source code of our approach supporting both 2D and 3D data is publicly available at https://github.com/LoicPeter/evaluation-deformable-registration. [ABSTRACT FROM AUTHOR]

Establishing dense correspondences of cone-beam computed tomography (CBCT) images is a crucial step for the attribute transfer and morphological variation assessment in clinical orthodontics. In this paper, a novel method, unsupervised spatially consistent clustering forest, is proposed to tackle the challenges for automatic supervoxel-wise correspondences of CBCT images. A complexity analysis of the proposed method with respect to the clustering hypotheses is provided with a data-dependent learning guarantee. The learning bound considers both the sequential tree traversals determined by questions stored in branch nodes and the clustering compactness of leaf nodes. A novel tree-pruning algorithm, guided by the learning bound, is also proposed to remove locally inconsistent leaf nodes. The resulting forest yields spatially consistent affinity estimations, thanks to the pruning penalizing trees with inconsistent leaf assignments and the combinational contextual feature channels used to learn the forest. A forest-based metric is utilized to derive the pairwise affinities and dense correspondences of CBCT images. The proposed method has been applied to the label propagation of clinically captured CBCT images. In the experiments, the method outperforms variants of both supervised and unsupervised forest-based methods and state-of-the-art label-propagation methods, achieving the mean dice similarity coefficients of 0.92, 0.89, 0.94, and 0.93 for the mandible, the maxilla, the zygoma arch, and the teeth data, respectively. [ABSTRACT FROM AUTHOR]

Identification of error in nonrigid registration is a critical problem in the medical image processing community. We recently proposed an algorithm that we call “Assessing Quality Using Image Registration Circuits” (AQUIRC) to identify nonrigid registration errors and have tested its performance using simulated cases. In this paper, we extend our previous work to assess AQUIRC's ability to detect local nonrigid registration errors and validate it quantitatively at specific clinical landmarks, namely the anterior commissure and the posterior commissure. To test our approach on a representative range of error we utilize five different registration methods and use 100 target images and nine atlas images. Our results show that AQUIRC's measure of registration quality correlates with the true target registration error (TRE) at these selected landmarks with an R^2=0.542. To compare our method to a more conventional approach, we compute local normalized correlation coefficient (LNCC) and show that AQUIRC performs similarly. However, a multi-linear regression performed with both AQUIRC's measure and LNCC shows a higher correlation with TRE than correlations obtained with either measure alone, thus showing the complementarity of these quality measures. We conclude the paper by showing that the AQUIRC algorithm can be used to reduce registration errors for all five algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a robust atlas-based segmentation (ABS) algorithm for segmentation of the breast boundary in 3-D MR images. The proposed algorithm combines the well-known methodologies of ABS namely probabilistic atlas and atlas selection approaches into a single framework where two configurations are realized. The algorithm uses phase congruency maps to create an atlas which is robust to intensity variations. This allows an atlas derived from images acquired with one MR imaging sequence to be used to segment images acquired with a different MR imaging sequence and eliminates the need for intensity-based registration. Images acquired using a Dixon sequence were used to create an atlas which was used to segment both Dixon images (intra-sequence) and T1-weighted images (inter-sequence). In both cases, highly accurate results were achieved with the median Dice similarity coefficient values of 94\% \pm 4\% and 87 \pm 6.5\%, respectively. [ABSTRACT FROM AUTHOR]