Search

Multi-phase dynamic contrast-enhanced magnetic resonance imaging image registration makes a substantial contribution to medical image analysis. However, existing methods (e.g., VoxelMorph, CycleMorph) often encounter the problem of image information misalignment in deformable registration tasks, posing challenges to the practical application. To address this issue, we propose a novel smooth image sampling method to align full organic information to realize detail-preserving image warping. In this paper, we clarify that the phenomenon about image information mismatch is attributed to imbalanced sampling. Then, a sampling frequency map constructed by sampling frequency estimators is utilized to instruct smooth sampling by reducing the spatial gradient and discrepancy between all-ones matrix and sampling frequency map. In addition, our estimator determines the sampling frequency of a grid voxel in the moving image by aggregating the sum of interpolation weights from warped non-grid sampling points in its vicinity and vectorially constructs sampling frequency map through projection and scatteration. We evaluate the effectiveness of our approach through experiments on two in-house datasets. The results showcase that our method preserves nearly complete details with ideal registration accuracy compared with several state-of-the-art registration methods. Additionally, our method exhibits a statistically significant difference in the regularity of the registration field compared to other methods, at a significance level of p < 0.05. Our code will be released at https://github.com/QingRui-Sha/SFM., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Objective . Existing registration networks based on cross-attention design usually divide the image pairs to be registered into patches for input. The division and merging operations of a series of patches are difficult to maintain the topology of the deformation field and reduce the interpretability of the network. Therefore, our goal is to develop a new network architecture based on a cross-attention mechanism combined with a multi-resolution strategy to improve the accuracy and interpretability of medical image registration. Approach . We propose a new deformable image registration network NCNet based on neighborhood cross-attention combined with multi-resolution strategy. The network structure mainly consists of a multi-resolution feature encoder, a multi-head neighborhood cross-attention module and a registration decoder. The hierarchical feature extraction capability of our encoder is improved by introducing large kernel parallel convolution blocks; the cross-attention module based on neighborhood calculation is used to reduce the impact on the topology of the deformation field and double normalization is used to reduce its computational complexity. Main result . We performed atlas-based registration and inter-subject registration tasks on the public 3D brain magnetic resonance imaging datasets LPBA40 and IXI respectively. Compared with the popular VoxelMorph method, our method improves the average DSC value by 7.9% and 3.6% on LPBA40 and IXI. Compared with the popular TransMorph method, our method improves the average DSC value by 4.9% and 1.3% on LPBA40 and IXI. Significance . We proved the advantages of the neighborhood attention calculation method compared to the window attention calculation method based on partitioning patches, and analyzed the impact of the pyramid feature encoder and double normalization on network performance. This has made a valuable contribution to promoting the further development of medical image registration methods., (© 2024 IOP Publishing Ltd.)

Lung image registration is more challenging than other organs. This is because the breath of the human body causes large deformations in the lung parenchyma and small deformations in tissues such as the pulmonary vascular. Many studies have recently used multi-resolution networks to solve the lung registration problem. However, they use the same structure of registration modules on each level, which makes it difficult to handle complex and small deformations. We propose an unsupervised heterogeneous multi-resolution network (UHMR-Net) to overcome the above problem. The image detail registration module (IDRM) is designed on the highest resolution level. Within this module, the cascaded network is used on the same resolution image to continuously learn the "remaining" detail deformation fields. The shallow shrinkage loss (SS-Loss) is designed to supervise the cascaded network, thus further improving the ability of the network to handle small deformations. Moreover, with the lightweight feature local correlation layer we proposed, the image boundary registration module (IBRM), on multiple low-resolution levels, can better solve the large deformation registration problem. The target registration error on the public DIR-Lab 4DCT dataset was 1.56 ± 1.39 mm, which was significantly better than the classic conventional methods and advanced deep-based methods., (© 2023. International Federation for Medical and Biological Engineering.)

Three-dimensional (3D) deformable image registration is a fundamental technique in medical image analysis tasks. Although it has been extensively investigated, current deep-learning-based registration models may face the challenges posed by deformations with various degrees of complexity. This paper proposes an adaptive multi-level registration network (AMNet) to retain the continuity of the deformation field and to achieve high-performance registration for 3D brain MR images. First, we design a lightweight registration network with an adaptive growth strategy to learn deformation field from multi-level wavelet sub-bands, which facilitates both global and local optimization and achieves registration with high performance. Second, our AMNet is designed for image-wise registration, which adapts the local importance of a region in accordance with the complexity degrees of its deformation, and thereafter improves the registration efficiency and maintains the continuity of the deformation field. Experimental results from five publicly-available brain MR datasets and a synthetic brain MR dataset show that our method achieves superior performance against state-of-the-art medical image registration approaches., Competing Interests: Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023 Elsevier B.V. All rights reserved.)

Purpose. Accurate neuroelectrode placement is essential to effective monitoring or stimulation of neurosurgery targets. This work presents and evaluates a method that combines deep learning and model-based deformable 3D-2D registration to guide and verify neuroelectrode placement using intraoperative imaging. Methods. The registration method consists of three stages: (1) detection of neuroelectrodes in a pair of fluoroscopy images using a deep learning approach; (2) determination of correspondence and initial 3D localization among neuroelectrode detections in the two projection images; and (3) deformable 3D-2D registration of neuroelectrodes according to a physical device model. The method was evaluated in phantom, cadaver, and clinical studies in terms of (a) the accuracy of neuroelectrode registration and (b) the quality of metal artifact reduction (MAR) in cone-beam CT (CBCT) in which the deformably registered neuroelectrode models are taken as input to the MAR. Results. The combined deep learning and model-based deformable 3D-2D registration approach achieved 0.2 ± 0.1 mm accuracy in cadaver studies and 0.6 ± 0.3 mm accuracy in clinical studies. The detection network and 3D correspondence provided initialization of 3D-2D registration within 2 mm, which facilitated end-to-end registration runtime within 10 s. Metal artifacts, quantified as the standard deviation in voxel values in tissue adjacent to neuroelectrodes, were reduced by 72% in phantom studies and by 60% in first clinical studies. Conclusions. The method combines the speed and generalizability of deep learning (for initialization) with the precision and reliability of physical model-based registration to achieve accurate deformable 3D-2D registration and MAR in functional neurosurgery. Accurate 3D-2D guidance from fluoroscopy could overcome limitations associated with deformation in conventional navigation, and improved MAR could improve CBCT verification of neuroelectrode placement., (© 2021 Institute of Physics and Engineering in Medicine.)

Purpose: Computational surgical planning tools could help develop novel skull base surgical approaches that improve safety and patient outcomes. This defines a need for automated skull base segmentation to improve the usability of surgical planning software. The objective of this work was to design and validate an algorithm for atlas-based automated segmentation of skull base structures in individual image sets for skull base surgical planning., Methods: Advanced Normalization Tools software was used to construct a synthetic CT template from 6 subjects, and skull base structures were manually segmented to create a reference atlas. Landmark registration followed by Elastix deformable registration was applied to the template to register it to each of the 30 trusted reference image sets. Dice coefficient, average Hausdorff distance, and clinical usability scoring were used to compare the atlas segmentations to those of the trusted reference image sets., Results: The mean for average Hausdorff distance for all structures was less than 2 mm (mean for 95th percentile Hausdorff distance was less than 5 mm). For structures greater than 2.5 mL in volume, the average Dice coefficient was 0.73 (range 0.59-0.82), and for structures less than 2.5 mL in volume the Dice coefficient was less than 0.7. The usability scoring survey was completed by three experts, and all structures met the criteria for acceptable effort except for the foramen spinosum, rotundum, and carotid artery, which required more than minor corrections., Conclusion: Currently available open-source algorithms, such as the Elastix deformable algorithm, can be used for automated atlas-based segmentation of skull base structures with acceptable clinical accuracy and minimal corrections with the use of the proposed atlas. The first publicly available CT template and anterior skull base segmentation atlas being released (available at this link: http://hdl.handle.net/1773/46259 ) with this paper will allow for general use of automated atlas-based segmentation of the skull base.

Image registration is an inherently ill-posed problem that lacks the constraints needed for a unique mapping between voxels of the two images being registered. As such, one must regularize the registration to achieve physically meaningful transforms. The regularization penalty is usually a function of derivatives of the displacement-vector field and can be calculated either analytically or numerically. The numerical approach, however, is computationally expensive depending on the image size, and therefore a computationally efficient analytical framework has been developed. Using cubic B-splines as the registration transform, we develop a generalized mathematical framework that supports five distinct regularizers: diffusion, curvature, linear elastic, third-order, and total displacement. We validate our approach by comparing each with its numerical counterpart in terms of accuracy. We also provide benchmarking results showing that the analytic solutions run significantly faster-up to two orders of magnitude-than finite differencing based numerical implementations., (© 2021 IOP Publishing Ltd.)

Correlative microscopy experiments require the co-registration of the image data acquired by different micro-analytical techniques. Major challenges are the potentially very different fields-of-view and resolutions as well as the multi-modality of the data. To provide microscopists with an easy-to-use software for two-dimensional image co-registration we have developed Correlia, an open source software based on ImageJ a /Fiji, b which is fully tailored for the registration of multi-modal microscopy data. It can handle data-sets of in principle arbitrary extent and uses classical approaches, i.e., rigid registration tools or B-spline based deformation models for the correction of both, global and local misalignments, such that a fast registration output is provided. Here we describe some of the basics of Correlia focusing on its application: firstly, registration workflows are outlined on artificial data. In the second part these recipes are applied to register correlative data acquired on an algal biofilm and a soil sample., (Copyright © 2021 Elsevier Inc. All rights reserved.)

Purpose: To study the accuracy of deformable registration algorithm for CT and cone beam CT (CBCT) using a combination of physical and digital phantoms., Materials and Methods: The physical phantoms consisted of objects over a range of electron densities, shape and sizes. The system was tested for simple and complex scenarios including performance in the presence of metallic artefacts. Clinically present deformations were simulated using a set of five geometric and anatomic virtual phantoms., Results: The system could not account for large changes in size, shape and Hounsfield units. Deformations of low intensity structures and small objects were highly inaccurate, and errors were prominent for volume reduction scenario than volume growth. The presence of artefacts did alter the performance of the algorithm. Objects of low density and that close to artefacts were affected the most. Overall, deformations to CBCT were poor. In virtual phantoms, the system could not handle gas pockets and deformation errors in inverse direction were higher than that in forward direction., Conclusion: The algorithm was tested for several non-clinical and clinical scenarios. The performance was acceptable for realistic and clinically present deformations. However, it is necessary to tread cautiously for structures with small volumes and large reductions in volume.

This work demonstrates the potential for using a deformable mapping method to register lesions between dedicated breast computed tomography (bCT) and both automated breast ultrasound (ABUS) and digital breast tomosynthesis (DBT) images (craniocaudal [CC] and mediolateral oblique [MLO] views). Two multi-modality breast phantoms with external fiducial markers attached were imaged by the three modalities. The DBT MLO view was excluded for the second phantom. The automated deformable mapping algorithm uses biomechanical modeling to determine corresponding lesions based on distances between their centers of mass (d COM ) in the deformed bCT model and the reference model (DBT or ABUS). For bCT to ABUS, the mean d COM was 5.2 ± 2.6 mm. For bCT to DBT (CC), the mean d COM was 5.1 ± 2.4 mm. For bCT to DBT (MLO), the mean d COM was 4.7 ± 2.5 mm. This application could help improve a radiologist's efficiency and accuracy in breast lesion characterization, using multiple imaging modalities., Competing Interests: Conflict of interest disclosure M. Goodsitt is a co-investigator on a grant funded by GE Healthcare. C. Davis is an employee of General Electric Corporation and holds several US patents on medical imaging. M. Goodsitt and P. Carson are collaborators on research with GE Global Research, Niskayuna, NY., (Copyright © 2019 World Federation for Ultrasound in Medicine & Biology. Published by Elsevier Inc. All rights reserved.)

In this paper, we present three deformable registration algorithms designed within a paradigm that uses 3D statistical shape models to accomplish two tasks simultaneously: 1) register point features from previously unseen data to a statistically derived shape (e.g., mean shape), and 2) deform the statistically derived shape to estimate the shape represented by the point features. This paradigm, called the deformable most-likely-point paradigm, is motivated by the idea that generative shape models built from available data can be used to estimate previously unseen data. We developed three deformable registration algorithms within this paradigm using statistical shape models built from reliably segmented objects with correspondences. Results from several experiments show that our algorithms produce accurate registrations and reconstructions in a variety of applications with errors up to CT resolution on medical datasets. Our code is available at https://github.com/AyushiSinha/cisstICP., (Copyright © 2019 Elsevier B.V. All rights reserved.)

Background: The aim of this work is to assess the impact of using different deformable registration (DR) algorithms on the quality of cone-beam CT (CBCT) correction with histogram matching (HM)., Methods and Materials: Data sets containing planning CT (pCT) and CBCT images for ten patients with prostate cancer were used. Each pCT image was registered to its corresponding CBCT image using one rigid registration algorithm with mutual information similarity metric (RR-MI) and three DR algorithms with normalized correlation coefficient, mutual information and normalized mutual information (DR-NCC, DR-MI and DR-NMI, respectively). Then, the HM was performed between deformed pCT and CBCT in order to correct the distribution of the Hounsfield Units (HU) in CBCT images., Results: The visual assessment showed that the absolute difference between corrected CBCT and deformed pCT was reduced after correction with HM except for soft tissue-air and soft-tissue-bone interfaces due to the improper registration. Furthermore, volumes comparison in terms of average HU error showed that using DR-NCC algorithm with HM yielded the lowest error values of about 55.95 ± 10.43 HU compared to DR-MI and DR-NMI for which the errors were 58.60 ± 10.35 and 56.58 ± 10.51 HU, respectively. Tissue class's comparison by the mean absolute error (MAE) plots confirmed the performance of DR-NCC algorithm to produce corrected CBCT images with lowest values of MAE even in regions where the misalignment is more pronounced. It was also found that the used method had successfully improved the spatial uniformity in the CBCT images by reducing the root mean squared difference (RMSD) between the pCT and CBCT in fat and muscle from 57 and 25 HU to 8HU, respectively., Conclusion: The choice of an accurate DR algorithm before performing the HM leads to an accurate correction of CBCT images. The results suggest that applying DR process based on NCC similarity metric reduces significantly the uncertainties in CBCT images and generates images in good agreement with pCT.

Purpose: To analyse the influence of the image registration method on the adaptive radiotherapy of an IMRT prostate treatment, and to compare the dose accumulation according to 3 different image registration methods with the planned dose., Material and Methods: The IMRT prostate patient was CT imaged 3 times throughout his treatment. The prostate, PTV, rectum and bladder were segmented on each CT. A Rigid, a deformable (DIR) B-spline and a DIR with landmarks registration algorithms were employed. The difference between the accumulated doses and planned doses were evaluated by the gamma index. The Dice coefficient and Hausdorff distance was used to evaluate the overlap between volumes, to quantify the quality of the registration., Results: When comparing adaptive vs no adaptive RT, the gamma index calculation showed large differences depending on the image registration method (as much as 87.6% in the case of DIR B-spline). The quality of the registration was evaluated using an index such as the Dice coefficient. This showed that the best result was obtained with DIR with landmarks compared with the rest and it was always above 0.77, reported as a recommended minimum value for prostate studies in a multi-centre review., Conclusions: Apart from showing the importance of the application of an adaptive RT protocol in a particular treatment, this work shows that the election of the registration method is decisive in the result of the adaptive radiotherapy and dose accumulation., (Copyright © 2017 Associazione Italiana di Fisica Medica. Published by Elsevier Ltd. All rights reserved.)

Purpose: Accurate preoperative planning is crucial for the outcome of total hip arthroplasty. Recently, 2D pelvic X-ray radiographs have been replaced by 3D CT. However, CT suffers from relatively high radiation dosage and cost. An alternative is to reconstruct a 3D patient-specific volume data from 2D X-ray images., Methods: In this paper, based on a fully automatic image segmentation algorithm, we propose a new control point-based 2D-3D registration approach for a deformable registration of a 3D volumetric template to a limited number of 2D calibrated X-ray images and show its application to personalized reconstruction of 3D volumes of the proximal femur. The 2D-3D registration is done with a hierarchical two-stage strategy: the scaled-rigid 2D-3D registration stage followed by a regularized deformable B-spline 2D-3D registration stage. In both stages, a set of control points with uniform spacing are placed over the domain of the 3D volumetric template first. The registration is then driven by computing updated positions of these control points with intensity-based 2D-2D image registrations of the input X-ray images with the associated digitally reconstructed radiographs, which allows computing the associated registration transformation at each stage., Results: Evaluated on datasets of 44 patients, our method achieved an overall surface reconstruction accuracy of [Formula: see text] and an average Dice coefficient of [Formula: see text]. We further investigated the cortical bone region reconstruction accuracy, which is important for planning cementless total hip arthroplasty. An average cortical bone region Dice coefficient of [Formula: see text] and an inner cortical bone surface reconstruction accuracy of [Formula: see text] were found., Conclusions: In summary, we developed a new approach for reconstruction of 3D personalized volumes of the proximal femur from 2D X-ray images. Comprehensive experiments demonstrated the efficacy of the present approach.

Purpose: Computer-assisted intervention often depends on multimodal deformable registration to provide complementary information. However, multimodal deformable registration remains a challenging task., Methods: This paper introduces a novel robust and fast modality-independent 3D binary descriptor, called miLBP, which integrates the principle of local self-similarity with a form of local binary pattern and can robustly extract the similar geometry features from 3D volumes across different modalities. miLBP is a bit string that can be computed by simply thresholding the voxel distance. Furthermore, the descriptor similarity can be evaluated efficiently using the Hamming distance., Results: miLBP was compared to vector-valued self-similarity context (SSC) in artificial image and clinical settings. The results show that miLBP is more robust than SSC in extracting local geometry features across modalities and achieved higher registration accuracy in different registration scenarios. Furthermore, in the most challenging registration between preoperative magnetic resonance imaging and intra-operative ultrasound images, our approach significantly outperforms the state-of-the-art methods in terms of both accuracy ([Formula: see text]) and speed (29.2 s for one case)., Conclusions: Registration performance and speed indicate that miLBP has the potential of being applied to the time-sensitive intra-operative computer-assisted intervention.

Comparison of human brain MR images is often challenged by large inter-subject structural variability. To determine correspondences between MR brain images, most existing methods typically perform a local neighborhood search, based on certain morphological features. They are limited in two aspects: (1) pre-defined morphological features often have limited power in characterizing brain structures, thus leading to inaccurate correspondence detection, and (2) correspondence matching is often restricted within local small neighborhoods and fails to cater to images with large anatomical difference. To address these limitations, we propose a novel method to detect distinctive landmarks for effective correspondence matching. Specifically, we first annotate a group of landmarks in a large set of training MR brain images. Then, we use regression forest to simultaneously learn (1) the optimal sets of features to best characterize each landmark and (2) the non-linear mappings from the local patch appearances of image points to their 3D displacements towards each landmark. The learned regression forests are used as landmark detectors to predict the locations of these landmarks in new images. Because each detector is learned based on features that best distinguish the landmark from other points and also landmark detection is performed in the entire image domain, our method can address the limitations in conventional methods. The deformation field estimated based on the alignment of these detected landmarks can then be used as initialization for image registration. Experimental results show that our method is capable of providing good initialization even for the images with large deformation difference, thus improving registration accuracy., (Copyright © 2015 Elsevier Ltd. All rights reserved.)

This paper describes a hybrid level set approach for medical image segmentation. This new geometric deformable model combines region- and edge-based information with the prior shape knowledge introduced using deformable registration. Our proposal consists of two phases: training and test. The former implies the learning of the level set parameters by means of a Genetic Algorithm, while the latter is the proper segmentation, where another metaheuristic, in this case Scatter Search, derives the shape prior. In an experimental comparison, this approach has shown a better performance than a number of state-of-the-art methods when segmenting anatomical structures from different biomedical image modalities., (Copyright © 2013 Elsevier Ltd. All rights reserved.)

Deformable image registration (DIR) was widely used in radiation therapy, such as in automatic contour generation, dose accumulation, tumor growth or regression analysis. To achieve higher registration accuracy and faster convergence, an improved 'diffeomorphic demons' registration algorithm was proposed and validated. Based on Brox et al.'s gradient constancy assumption and Malis's efficient second-order minimization (ESM) algorithm, a grey value gradient similarity term and a transformation error term were added into the demons energy function, and a formula was derived to calculate the update of transformation field. The limited Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm was used to optimize the energy function so that the iteration number could be determined automatically. The proposed algorithm was validated using mathematically deformed images and physically deformed phantom images. Compared with the original 'diffeomorphic demons' algorithm, the registration method proposed achieve a higher precision and a faster convergence speed. Due to the influence of different scanning conditions in fractionated radiation, the density range of the treatment image and the planning image may be different. In such a case, the improved demons algorithm can achieve faster and more accurate radiotherapy.

We present an evaluation of various non-rigid registration algorithms for the purpose of compensating interfractional motion of the target volume and organs at risk areas when acquiring CBCT image data prior to irradiation. Three different deformable registration (DR) methods were used: the Demons algorithm implemented in the iPlan Software (BrainLAB AG, Feldkirchen, Germany) and two custom-developed piecewise methods using either a Normalized Correlation or a Mutual Information metric (featureletNC and featureletMI). These methods were tested on data acquired using a novel purpose-built phantom for deformable registration and clinical CT/CBCT data of prostate and lung cancer patients. The Dice similarity coefficient (DSC) between manually drawn contours and the contours generated by a derived deformation field of the structures in question was compared to the result obtained with rigid registration (RR). For the phantom, the piecewise methods were slightly superior, the featureletNC for the intramodality and the featureletMI for the intermodality registrations. For the prostate cases in less than 50% of the images studied the DSC was improved over RR. Deformable registration methods improved the outcome over a rigid registration for lung cases and in the phantom study, but not in a significant way for the prostate study. A significantly superior deformation method could not be identified., (Copyright © 2013. Published by Elsevier GmbH.)

PurposeMissing or discrepant imaging volume is a common challenge in deformable image registration (DIR). To minimize the adverse impact, we train a neural network to synthesize cropped portions of head and neck CT's and then test its use in DIR.MethodsUsing a training dataset of 409 head and neck CT's, we trained a generative adversarial network to take in a cropped 3D image and output an image with synthesized anatomy in the cropped region. The network used a 3D U-Net generator along with Visual Geometry Group (VGG) deep feature losses. To test our technique, for each of the 53 test volumes, we used Elastix to deformably register combinations of a randomly cropped, full, and synthetically full volume to a single cropped, full, and synthetically full target volume. We additionally tested our method's robustness to crop extent by progressively increasing the amount of cropping, synthesizing the missing anatomy using our network, and then performing the same registration combinations. Registration performance was measured using 95% Hausdorff distance across 16 contours.ResultsWe successfully trained a network to synthesize missing anatomy in superiorly and inferiorly cropped images. The network can estimate large regions in an incomplete image, far from the cropping boundary. Registration using our estimated full images was not significantly different from registration using the original full images. The average contour matching error for full image registration was 9.9 mm, whereas our method was 11.6, 12.1, and 13.6 mm for synthesized-to-full, full-to-synthesized, and synthesized-to-synthesized registrations, respectively. In comparison, registration using the cropped images had errors of 31.7 mm and higher. Plotting the registered image contour error as a function of initial preregistered error shows that our method is robust to registration difficulty. Synthesized-to-full registration was statistically independent of cropping extent up to 18.7 cm superiorly cropped. Synthesized-to-synthesized registration was nearly independent, with a -0.04 mm of change in average contour error for every additional millimeter of cropping.ConclusionsDifferent or inadequate in scan extent is a major cause of DIR inaccuracies. We address this challenge by training a neural network to complete cropped 3D images. We show that with image completion, the source of DIR inaccuracy is eliminated, and the method is robust to varying crop extent.

Accurate registration of lung X-rays is an important task in medical image analysis. However, the conventional methods usually cost a lot in running time, and the existing deep learning methods are hard to deal with the large deformation caused by respiratory and cardiac motion. In this paper, we attempt to use deep learning methods to deal with large deformation and enable it to achieve the accuracy of conventional methods. We proposed the cascading affine and B-spline network (CABN), which consists of convolutional cross-stitch affine block (CCAB) and B-splines U-net-like block (BUB) for large lung motion. CCAB makes use of the convolutional cross-stitch model to learn global features among images. And BUB adopts the idea of cubic B-splines which is suitable for large deformation. We separately demonstrated CCAB, BUB, and CABN on two chest X-ray datasets. The experimental results indicate that our methods are highly competitive both in accuracy and runtime when compared to both other deep learning methods and iterative conventional approaches. Moreover, CCAB also can be used for the preprocessing of non-rigid registration methods, replacing affine in conventional methods. [ABSTRACT FROM AUTHOR]

PURPOSE:The deformable registration of pulmonary computed tomography images before and after radiation therapy is challenging due to anatomic changes from radiation fibrosis. We hypothesize that a line-enhanced registration algorithm can reduce landmark error over the entire lung, including the irradiated regions, when compared to an intensity-based deformable registration algorithm. MATERIALS:Two intensity-based B-spline deformable registration algorithms of pre-radiation therapy and post-radiation therapy images were compared. The first was a control intensity-based algorithm that utilized computed tomography images without modification. The second was a line enhancement algorithm that incorporated a Hessian-based line enhancement filter prior to deformable image registration. Registrations were evaluated based on the landmark error between user-identified landmark pairs and the overlap ratio. RESULTS:Twenty-one patients with pre-radiation therapy and post-radiation therapy scans were included. The median time interval between scans was 1.2 years (range: 0.3-3.3 years). Median landmark errors for the line enhancement algorithm were significantly lower than those for the control algorithm over the entire lung (1.67 vs 1.83 mm; P < .01), as well as within the 0 to 5 Gy (1.40 vs 1.57; P < .01) and >5 Gy (2.25 vs 3.31; P < .01) dose intervals. The median lung mask overlap ratio for the line enhancement algorithm (96.2%) was greater than that for the control algorithm (95.8%; P < .01). Landmark error within the >5 Gy dose interval demonstrated a significant inverse relationship with post-radiation therapy fibrosis enhancement after line enhancement filtration (Pearson correlation coefficient = -0.48; P = .03). CONCLUSION:The line enhancement registration algorithm is a promising method for registering images before and after radiation therapy.

Background: Image-guided adaptive brachytherapy shows the ability to deliver high doses to tumors while sparing normal tissues. However, interfraction dose delivery introduces uncertainties to high dose estimation, which relates to normal tissue toxicity. The purpose of this study was to investigate the high-dose regions of two applicator approaches in brachytherapy.Method: For 32 cervical cancer patients, the CT images from each fraction were wrapped to a reference image, and the displacement vector field (DVF) was calculated with a hybrid intensity-based deformable registration algorithm. The fractional dose was then accumulated to calculate the position and the overlap of high dose (D2cc) during multiple fractions.Result: The overall Dice similarity coefficient (DSC) of the deformation algorithm for the bladder and the rectum was (0.97 and 0.91). No significant difference was observed between the two applicators. However, the location of the intracavitary brachytherapy (ICBT) high-dose region was relatively concentrated. The overlap volume of bladder and rectum D2cc was 0.42 and 0.71, respectively, which was higher than that of interstitial brachytherapy (ISBT) (0.26 and 0.31). The cumulative dose was overestimated in ISBT cases when using the GEC-recommended method. The ratio of bladder and rectum D2cc to the GEC method was 0.99 and 1, respectively, which was higher than that of the ISBT method (0.96 and 0.94).Conclusion: High-dose regions for brachytherapy based on different applicator types were different. The 3D-printed ICBT has better high-dose region consistency than freehand ISBT and hence is more predictable. [ABSTRACT FROM AUTHOR]

Deformable image registration (DIR) of fractional high-dose-rate (HDR) CT images is challenging due to the presence of applicators in the brachytherapy image. Point-to-point correspondence fails because of the undesired deformation vector fields (DVF) propagated from the applicator region (AR) to the surrounding tissues, which can potentially introduce significant DIR errors in dose mapping. This paper proposes a novel segmentation and point-matching enhanced efficient DIR (named SPEED) scheme to facilitate dose accumulation among HDR treatment fractions. In SPEED, a semi-automatic seed point generation approach is developed to obtain the incremented fore/background point sets to feed the random walks algorithm, which is used to segment and remove the AR, leaving empty AR cavities in the HDR CT images. A feature-based 'thin-plate-spline robust point matching' algorithm is then employed for AR cavity surface points matching. With the resulting mapping, a DVF defining on each voxel is estimated by B-spline approximation, which serves as the initial DVF for the subsequent Demons-based DIR between the AR-free HDR CT images. The calculated DVF via Demons combined with the initial one serve as the final DVF to map doses between HDR fractions. The segmentation and registration accuracy are quantitatively assessed by nine clinical HDR cases from three gynecological cancer patients. The quantitative analysis and visual inspection of the DIR results indicate that SPEED can suppress the impact of applicator on DIR, and accurately register HDR CT images as well as deform and add interfractional HDR doses.

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]

Objectives: To propose and evaluate a four-dimensional (4D) algorithm for joint motion elimination and spatiotemporal noise reduction in low-dose dynamic myocardial computed tomography perfusion (CTP).Methods: Thirty patients with suspected or confirmed coronary artery disease were prospectively included and underwent dynamic contrast-enhanced 320-row CTP. A novel deformable image registration method based on the principal component analysis (PCA) of the ante hoc temporally smoothed voxel-wise time-attenuation curves (ASTRA4D) is presented. Quantitative (standard deviation, signal-to-noise ratio (SNR), temporal variation, volumetric deformation) and qualitative (motion, contrast, contour sharpness [1, poor; 5, excellent]) measures of CTP quality were assessed for the original and motion-compensated sequences (without and with temporal filtering, PCA/ASTRA4D). Following myocardial perfusion deficit detection by two readers, diagnostic accuracy was evaluated using magnetic resonance myocardial perfusion imaging (MR-MPI) as the reference standard in 15 patients.Results: Registration using ASTRA4D was successful in all 30 patients and resulted in comparison with the benchmark PCA in significantly (p < 0.001) reduced noise over time (- 83%, 178.5 vs 29.9) and spatially (- 34%, 21.4 vs 14.1) as well as improved SNR (+ 47%, 3.6 vs 5.3) and subjective image quality (motion, contrast, contour sharpness [+ 1.0, + 1.0, + 0.5]). ASTRA4D had significantly improved per-segment sensitivity of 91% (58/64) and similar specificity of 96% (429/446) compared with PCA (52%, 33/64; 98%, 435/446; p = 0.011) in the visual detection of perfusion deficits.Conclusions: The ASTRA4D registration algorithm improved the spatiotemporal noise profile and CTP sequence image quality, resulting in significantly improved sensitivity of 4D CTP in the detection of myocardial ischemia.Key Points: • ASTRA4D combines local temporal regression and deformable image registration. • Quantitative and qualitative measures of CTP quality are improved compared to PCA. • Improved spatiotemporal differentiation of ischemic regions leads to an excellent perfusion deficit concordance of ASTRA4D with MRI. [ABSTRACT FROM AUTHOR]

This work presents a deformable point set registration algorithm that seeks an optimal set of radial basis functions to describe the registration. A novel, global optimization approach is introduced composed of simulated annealing with a particle filter based generator function to perform the registration. It is shown how constraints can be incorporated into this framework. A constraint on the deformation is enforced whose role is to ensure physically meaningful fields (i.e., invertible). Further, examples in which landmark constraints serve to guide the registration are shown. Results on 2D and 3D data demonstrate the algorithm’s robustness to noise and missing information. [ABSTRACT FROM PUBLISHER]

Deformable image registration (DIR) was widely used in radiation therapy, such as in automatic contour generation, dose accumulation, tumor growth or regression analysis. To achieve higher registration accuracy and faster convergence, an improved 'diffeomorphic demons' registration algorithm was proposed and validated. Based on Brox et al.'s gradient constancy assumption and Malis's efficient second-order minimization (ESM) algorithm, a grey value gradient similarity term and a transformation error term were added into the demons energy function, and a formula was derived to calculate the update of transformation field. The limited Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm was used to optimize the energy function so that the iteration number could be determined automatically. The proposed algorithm was validated using mathematically deformed images and physically deformed phantom images. Compared with the original 'diffeomorphic demons' algorithm, the registration method proposed achieve a higher precision and a faster convergence speed. Due to the influence of different scanning conditions in fractionated radiation, the density range of the treatment image and the planning image may be different. In such a case, the improved demons algorithm can achieve faster and more accurate radiotherapy. [ABSTRACT FROM AUTHOR]

Purpose: To develop a three-dimensional (3D) cone-beam computed tomography (CBCT) estimation method using a deformation field map, and to evaluate and optimize the efficiency and accuracy of the method for use in the clinical setting. Methods and Materials: We propose a method to estimate patient CBCT images using prior information and a deformation model. Patients’ previous CBCT data are used as the prior information, and the new CBCT volume to be estimated is considered as a deformation of the prior image volume. The deformation field map is solved by minimizing deformation energy and maintaining new projection data fidelity using a nonlinear conjugate gradient method. This method was implemented in 3D form using hardware acceleration and multi-resolution scheme, and it was evaluated for different scan angles, projection numbers, and scan directions using liver, lung, and prostate cancer patient data. The accuracy of the estimation was evaluated by comparing the organ volume difference and the similarity between estimated CBCT and the CBCT reconstructed from fully sampled projections. Results: Results showed that scan direction and number of projections do not have significant effects on the CBCT estimation accuracy. The total scan angle is the dominant factor affecting the accuracy of the CBCT estimation algorithm. Larger scan angles yield better estimation accuracy than smaller scan angles. Lung cancer patient data showed that the estimation error of the 3D lung tumor volume was reduced from 13.3% to 4.3% when the scan angle was increased from 60° to 360° using 57 projections. Conclusions: The proposed estimation method is applicable for 3D DTS, 3D CBCT, four-dimensional CBCT, and four-dimensional DTS image estimation. This method has the potential for significantly reducing the imaging dose and improving the image quality by removing the organ distortion artifacts and streak artifacts shown in images reconstructed by the conventional Feldkamp–Davis–Kress (FDK) algorithm. [ABSTRACT FROM AUTHOR]

A biomechanical model-based deformable image registration incorporating specimen-specific changes in material properties is optimized and evaluated for correlating histology of clinical prostatectomy specimens with in vivo MRI. In this methodology, a three-step registration based on biomechanics calculates the transformations between histology and fixed, fixed and fresh, and fresh and in vivo states. A heterogeneous linear elastic material model is constructed based on magnetic resonance elastography (MRE) results. The ex vivo tissue MRE data provide specimen-specific information for the fresh and fixed tissue to account for the changes due to fixation. The accuracy of the algorithm was quantified by calculating the target registration error (TRE) by identifying naturally occurring anatomical points within the prostate in each image. TRE were improved with the deformable registration algorithm compared to rigid registration alone. The qualitative assessment also showed a good alignment between histology and MRI after the proposed deformable registration. [ABSTRACT FROM AUTHOR]

Abstract: Introduction: Correct target definition is crucial in stereotactic radiotherapy for lung tumors. We evaluated use of deformable registration (DR) for target contouring on 4-dimensional (4D) CT scans. Materials and methods: Three clinicians contoured gross tumor volume (GTV) in an end-inspiration phase of 4DCT of 6 patients on two occasions. Two clinicians contoured GTVs in all phases of 4DCT and on maximum intensity projections (MIP). The initial GTV was auto-propagated to 9 other phases using a B-spline algorithm (VelocityAI). Internal target volumes (ITVs) generated were (i) ITV10manual encompassing all physician-contoured GTVs, (ii) ITV–MIPoptimized from MIP after review of individual 4DCT phases, (iii) ITV10deformed encompassing auto-propagated GTVs using DR, and (iv) ITV10deformed–optimized, from an ITV10deformed target that was modified to form a ‘clinically optimal’ ITV. Volume-overlaps were scored using Dice’s Similarity Coefficients (DSCs). Results: Intra-clinician GTV reproducibility was greater than inter-clinician reproducibility (mean DSC 0.93 vs. 0.88, p <0.0004). In five of 6 patients, ITV–MIPoptimized differed from the ITV10deformed–optimized. In all patients, the DSC between ITV10deformed–optimized and ITV10deformed was higher than that between ITV10deformed–optimized and ITV–MIPoptimized (p <0.02 T-test). Conclusion: ITVs created in stage I tumors using DR were closer to ‘clinically optimal’ ITVs than was the case with a MIP-modified approach. [Copyright &y& Elsevier]

Computer aided modeling of anatomic deformation, allowing various techniques and protocols in radiation therapy to be systematically verified and studied, has become increasingly attractive. In this study the potential issues in deformable image registration (DIR) were analyzed based on two numerical phantoms: One, a synthesized, low intensity gradient prostate image, and the other a lung patient’s CT image data set. Each phantom was modeled with region-specific material parameters with its deformation solved using a finite element method. The resultant displacements were used to construct a benchmark to quantify the displacement errors of the Demons and B-Spline-based registrations. The results show that the accuracy of these registration algorithms depends on the chosen parameters, the selection of which is closely associated with the intensity gradients of the underlying images. For the Demons algorithm, both single resolution (SR) and multiresolution (MR) registrations required approximately 300 iterations to reach an accuracy of 1.4 mm mean error in the lung patient’s CT image (and 0.7 mm mean error averaged in the lung only). For the low gradient prostate phantom, these algorithms (both SR and MR) required at least 1600 iterations to reduce their mean errors to 2 mm. For the B-Spline algorithms, best performance (mean errors of 1.9 mm for SR and 1.6 mm for MR, respectively) on the low gradient prostate was achieved using five grid nodes in each direction. Adding more grid nodes resulted in larger errors. For the lung patient’s CT data set, the B-Spline registrations required ten grid nodes in each direction for highest accuracy (1.4 mm for SR and 1.5 mm for MR). The numbers of iterations or grid nodes required for optimal registrations depended on the intensity gradients of the underlying images. In summary, the performance of the Demons and B-Spline registrations have been quantitatively evaluated using numerical phantoms. The results show that parameter selection for optimal accuracy is closely related to the intensity gradients of the underlying images. Also, the result that the DIR algorithms produce much lower errors in heterogeneous lung regions relative to homogeneous (low intensity gradient) regions, suggests that feature-based evaluation of deformable image registration accuracy must be viewed cautiously. [ABSTRACT FROM AUTHOR]

Abstract: We present an improved MR brain image registration algorithm, called TPS-HAMMER, which is based on the concepts of attribute vectors and hierarchical landmark selection scheme proposed in the highly successful HAMMER registration algorithm. We demonstrate that TPS-HAMMER algorithm yields better registration accuracy, robustness, and speed over HAMMER owing to (1) the employment of soft correspondence matching and (2) the utilization of thin-plate splines (TPS) for sparse-to-dense deformation field generation. These two aspects can be integrated into a unified framework to refine the registration iteratively by alternating between soft correspondence matching and dense deformation field estimation. Compared with HAMMER, TPS-HAMMER affords several advantages: (1) unlike the Gaussian propagation mechanism employed in HAMMER, which can be slow and often leaves unreached blotches in the deformation field, the deformation interpolation in the non-landmark points can be obtained immediately with TPS in our algorithm; (2) the smoothness of deformation field is preserved due to the nice properties of TPS; (3) possible misalignments can be alleviated by allowing the matching of the landmarks with a number of possible candidate points and enforcing more exact matches in the final stages of the registration. Extensive experiments have been conducted, using the original HAMMER as a comparison baseline, to validate the merits of TPS-HAMMER. The results show that TPS-HAMMER yields significant improvement in both accuracy and speed, indicating high applicability for the clinical scenario. [Copyright &y& Elsevier]

Abstract: This paper presents a novel approach to define deformation invariant attribute vector (DIAV) for each voxel in 3D brain image for the purpose of anatomic correspondence detection. The DIAV method is validated by using synthesized deformation in 3D brain MRI images. Both theoretic analysis and experimental studies demonstrate that the proposed DIAV is invariant to general nonlinear deformation. Moreover, our experimental results show that the DIAV is able to capture rich anatomic information around the voxels and exhibit strong discriminative ability. The DIAV has been integrated into a deformable registration algorithm for longitudinal brain MR images, and the results on both simulated and real brain images are provided to demonstrate the good performance of the proposed registration algorithm based on matching of DIAVs. [Copyright &y& Elsevier]

Abstract: A new approach, based on the hierarchical soft correspondence detection, has been presented for significantly improving the speed of our previous HAMMER image registration algorithm. Currently, HAMMER takes a relative long time, e.g., up to 80min, to register two regular sized images using Linux machine (with 2.40GHz CPU and 2-Gbyte memory). This is because the results of correspondence detection, used to guide the image warping, can be ambiguous in complex structures and thus the image warping has to be conservative and accordingly takes long time to complete. In this paper, a hierarchical soft correspondence detection technique has been employed to detect correspondences more robustly, thereby allowing the image warping to be completed straightforwardly and fast. By incorporating this hierarchical soft correspondence detection technique into the HAMMER registration framework, both the robustness and the accuracy of registration (in terms of low average registration error) can be achieved. Experimental results on real and simulated data show that the new registration algorithm, based on the hierarchical soft correspondence detection, can run nine times faster than HAMMER while keeping the similar registration accuracy. [Copyright &y& Elsevier]

State-of-the art algorithms for deformable image registration are based on the minimization of an image similarity functional that is regularized by adding a penalty term on the deformation map. The penalty function typically represents a smoothness regularization. In this article, we use a constrained optimization formulation in which the image similarity functional is coupled to a biophysical model. This formulation is pertinent when the data have been generated by imaging tissue that undergoes deformations due to an actual biophysical phenomenon. Such is the case of coregistering tumor-bearing brain images from the same individual. We present an approximate model that couples tumor growth with the mechanical deformations of the surrounding brain tissue. We consider primary brain tumors-in particular, gliomas. Glioma growth is modeled by a reaction-advection-diffusion PDE, with a two-way coupling with the underlying tissue elastic deformation. Tumor bulk, infiltration, and subsequent mass effects are not regarded separately but are captured by the model itself in the course of its evolution. Our formulation allows for updating the tumor diffusion coefficient following structural displacements caused by tumor growth/infiltration. Our forward problem implementation builds on the PETSc library of Argonne National Laboratory. Our reformulation results in a very small parameter space, and we use the derivative-free optimization library APPSPACK of Sandia National Laboratories. We test the forward model and the optimization framework by using landmark-based similarity functions and by applying it to brain tumor data from clinical and animal studies. State-of-the-art registration algorithms fail in such problems due to excessive deformations. We compare our results with previous work in our group, and we observed up to 50% improvement in landmark deformation prediction. We present preliminary validation results in which we were able to reconstruct deformation fields using four degrees of freedom. Our study demonstrates the validity of our formulation and points to the need for richer datasets and fast optimization algorithms. [ABSTRACT FROM AUTHOR]

Purpose: Evaluate the accuracy and the sensitivity to contour variation and model size of a finite element model-based deformable registration algorithm for the prostate. Methods and materials: Two magnetic resonance images (MRIs) were obtained for 21 prostate patients with three implanted markers. A single observer contoured the prostate and markers and performed blinded recontouring of the first MRI. A biomechanical-model based deformable registration algorithm, MORFEUS, was applied to each dataset pair, deforming the second image (B) to the first image (A). The residual error was calculated by comparing the center of mass (COM) of the markers with the predicted COM. Sensitivity to contour variation was calculated by deforming B to the repeat contour of A (A2). The sensitivity to the model size was calculated by reducing the number of nodes (B′, A′, A2′) and repeating the analysis. Results: The average residual error of the registration for B to A and B to A2 was 0.22 cm (SD: 0.08 cm) and 0.24 cm (SD: 0.09 cm), respectively. The average residual error of the registration of B′ to A′ and B′ to A2′ was 0.22 cm (SD: 0.10 cm) and 0.25 cm (SD: 0.10 cm), respectively. The average time to run MORFEUS on the standard and reduced model was 3606 s (SD: 7788 s) and 56 s (SD: 16 s), respectively. Conclusions: The accuracy of the algorithm, equal to the image voxel size, is not affected by intraobserver contour variability or model size. Reducing the model size significantly increases algorithm efficiency. [ABSTRACT FROM AUTHOR]

Rationale and Objectives: Needle biopsy is currently the only way to confirm prostate cancer. To increase prostate cancer diagnostic rate, needles are expected to be deployed at suspicious cancer locations. High-contrast magnetic resonance (MR) imaging provides a powerful tool for detecting suspicious cancerous tissues. To do this, MR appearances of cancerous tissue should be characterized and learned from a sufficient number of prostate MR images with known cancer information. However, ground-truth cancer information is only available in histologic images. Therefore it is necessary to warp ground-truth cancerous regions in histological images to MR images by a registration procedure. The objective of this article is to develop a registration technique for aligning histological and MR images of the same prostate.Material and Methods: Five pairs of histological and T2-weighted MR images of radical prostatectomy specimens are collected. For each pair, registration is guided by two sets of correspondences that can be reliably established on prostate boundaries and internal salient bloblike structures of histologic and MR images.Results: Our developed registration method can accurately register histologic and MR images. It yields results comparable to manual registration, in terms of landmark distance and volume overlap. It also outperforms both affine registration and boundary-guided registration methods.Conclusions: We have developed a novel method for deformable registration of histologic and MR images of the same prostate. Besides the collection of ground-truth cancer information in MR images, the method has other potential applications. An automatic, accurate registration of histologic and MR images actually builds a bridge between in vivo anatomical information and ex vivo pathologic information, which is valuable for various clinical studies. [ABSTRACT FROM AUTHOR]

Image registration methods play a crucial role in computational neuroanatomy. This paper mainly contributes to the field of image registration with the use of nonlinear spatial transformations. Particularly, problems connected to matching magnetic resonance imaging (MRI) brain image data obtained from various subjects and with various imaging conditions are solved here. Registration is driven by local forces derived from multi-modal point similarity measures which are estimated with the use of joint intensity histogram and tissue probability maps. A spatial deformation model imitating principles of continuum mechanics is used. Five similarity measures are tested in an experiment with image data obtained from the Simulated Brain Database and a quantitative evaluation of the algorithm is presented. Results of application of the method in automated spatial detection of anatomical abnormalities in first-episode schizophrenia are presented. [ABSTRACT FROM AUTHOR]

Abstract: We previously presented an image registration method, referred to hierarchical attribute matching mechanism for elastic registration (HAMMER), which demonstrated relatively high accuracy in inter-subject registration of MR brain images. However, the HAMMER algorithm requires the pre-segmentation of brain tissues, since the attribute vectors used to hierarchically match the corresponding pairs of points are defined from the segmented image. In many applications, the segmentation of tissues might be difficult, unreliable or even impossible to complete, which potentially limits the use of the HAMMER algorithm in more generalized applications. To overcome this limitation, we have used local spatial intensity histograms to design a new type of attribute vector for each point in an intensity image. The histogram-based attribute vector is rotationally invariant, and importantly it also captures spatial information by integrating a number of local intensity histograms from multi-resolution images of original intensity image. The new attribute vectors are able to determine the corresponding points across individual images. Therefore, by hierarchically matching new attribute vectors, the proposed method can perform as successfully as the previous HAMMER algorithm did in registering MR brain images, while providing more generalized applications in registering images of various organs. Experimental results show good performance of the proposed method in registering MR brain images, DTI brain images, CT pelvis images, and MR mouse images. [Copyright &y& Elsevier]

Abstract: This paper proposes a 3D statistical model aiming at effectively capturing statistics of high-dimensional deformation fields and then uses this prior knowledge to constrain 3D image warping. The conventional statistical shape model methods, such as the active shape model (ASM), have been very successful in modeling shape variability. However, their accuracy and effectiveness typically drop dramatically in high-dimensionality problems involving relatively small training datasets, which is customary in 3D and 4D medical imaging applications. The proposed statistical model of deformation (SMD) uses wavelet-based decompositions coupled with PCA in each wavelet band, in order to more accurately estimate the pdf of high-dimensional deformation fields, when a relatively small number of training samples are available. SMD is further used as statistical prior to regularize the deformation field in an SMD-constrained deformable registration framework. As a result, more robust registration results are obtained relative to using generic smoothness constraints on deformation fields, such as Laplacian-based regularization. In experiments, we first illustrate the performance of SMD in representing the variability of deformation fields and then evaluate the performance of the SMD-constrained registration, via comparing a hierarchical volumetric image registration algorithm, HAMMER, with its SMD-constrained version, referred to as SMD+HAMMER. This SMD-constrained deformable registration framework can potentially incorporate various registration algorithms to improve robustness and stability via statistical shape constraints. [Copyright &y& Elsevier]

This paper presents a learning-based method for deformable registration of magnetic resonance (MR) brain images. There are two novelties in the proposed registration method. First, a set of best-scale geometric features are selected for each point in the brain, in order to facilitate correspondence detection during the registration procedure. This is achieved by optimizing an energy function that requires each point to have its best-scale geometric features consistent over the corresponding points in the training samples, and at the same time distinctive from those of nearby points in the neighborhood. Second, the active points used to drive the brain registration are hierarchically selected during the registration procedure, based on their saliency and consistency measures. That is, the image points with salient and consistent features (across different individuals) are considered for the initial registration of two images, while other less salient and consistent points join the registration procedure later. By incorporating these two novel strategies into the framework of the HAMMER registration algorithm, the registration accuracy has been improved according to the results on simulated brain data, and also visible improvement is observed particularly in the cortical regions of real brain data. [ABSTRACT FROM AUTHOR]

Purpose: Daily prostate deformation hinders accurate calculation of dose, especially to intraprostatic targets. We implemented a three-dimensional deformable registration algorithm to aid dose tracking for targeted prostate radiotherapy. Methods and Materials: The algorithm registers two computed tomography (CT) scans by iteratively minimizing their differences in image intensity. For validation, we measured the accuracy in registering (a) a pelvic CT set to its mathematically deformed counterpart, (b) CT scans of a deformable pelvic phantom with and without an endorectal balloon inflated, to simulate intraprostatic targets, 23 CT-opaque seeds were embedded in the prostate, and (c) two pelvic CT scans of a patient obtained on 2 separate days. Results: The mean (SD) error in registering the pelvic CT set to its transformed set was 0.5 mm (1.5), with correlation coefficient improvement from 0.626 to 0.991. Using the deformable pelvic phantom, the correlation coefficient improved from 0.543 to 0.816 after registration. The mean (SD) error in tracking the intraprostatic seeds was 0.8 mm (0.5). The correlation coefficient improved from 0.610 to 0.944 after registration of the two patient CT sets. Conclusion: The algorithm had an accuracy of about 1 mm. It could be used for optimizing dose calculation and delivery for prostate radiotherapy. [ABSTRACT FROM AUTHOR]