10,461 research outputs found
Atlas-Based Prostate Segmentation Using an Hybrid Registration
Purpose: This paper presents the preliminary results of a semi-automatic
method for prostate segmentation of Magnetic Resonance Images (MRI) which aims
to be incorporated in a navigation system for prostate brachytherapy. Methods:
The method is based on the registration of an anatomical atlas computed from a
population of 18 MRI exams onto a patient image. An hybrid registration
framework which couples an intensity-based registration with a robust
point-matching algorithm is used for both atlas building and atlas
registration. Results: The method has been validated on the same dataset that
the one used to construct the atlas using the "leave-one-out method". Results
gives a mean error of 3.39 mm and a standard deviation of 1.95 mm with respect
to expert segmentations. Conclusions: We think that this segmentation tool may
be a very valuable help to the clinician for routine quantitative image
exploitation.Comment: International Journal of Computer Assisted Radiology and Surgery
(2008) 000-99
Longitudinal Image Registration with Temporal-Order and Subject-Specificity Discrimination
Morphological analysis of longitudinal MR images plays a key role in monitoring disease progression for prostate cancer patients, who are placed under an active surveillance program. In this paper, we describe a learning-based image registration algorithm to quantify changes on regions of interest between a pair of images from the same patient, acquired at two different time points. Combining intensity-based similarity and gland segmentation as weak supervision, the population-data-trained registration networks significantly lowered the target registration errors (TREs) on holdout patient data, compared with those before registration and those from an iterative registration algorithm. Furthermore, this work provides a quantitative analysis on several longitudinal-data-sampling strategies and, in turn, we propose a novel regularisation method based on maximum mean discrepancy, between differently-sampled training image pairs. Based on 216 3D MR images from 86 patients, we report a mean TRE of 5.6 mm and show statistically significant differences between the different training data sampling strategies
Longitudinal Image Registration with Temporal-order and Subject-specificity Discrimination
Morphological analysis of longitudinal MR images plays a key role in
monitoring disease progression for prostate cancer patients, who are placed
under an active surveillance program. In this paper, we describe a
learning-based image registration algorithm to quantify changes on regions of
interest between a pair of images from the same patient, acquired at two
different time points. Combining intensity-based similarity and gland
segmentation as weak supervision, the population-data-trained registration
networks significantly lowered the target registration errors (TREs) on holdout
patient data, compared with those before registration and those from an
iterative registration algorithm. Furthermore, this work provides a
quantitative analysis on several longitudinal-data-sampling strategies and, in
turn, we propose a novel regularisation method based on maximum mean
discrepancy, between differently-sampled training image pairs. Based on 216 3D
MR images from 86 patients, we report a mean TRE of 5.6 mm and show
statistically significant differences between the different training data
sampling strategies.Comment: Accepted at MICCAI 202
Fast Predictive Simple Geodesic Regression
Deformable image registration and regression are important tasks in medical
image analysis. However, they are computationally expensive, especially when
analyzing large-scale datasets that contain thousands of images. Hence, cluster
computing is typically used, making the approaches dependent on such
computational infrastructure. Even larger computational resources are required
as study sizes increase. This limits the use of deformable image registration
and regression for clinical applications and as component algorithms for other
image analysis approaches. We therefore propose using a fast predictive
approach to perform image registrations. In particular, we employ these fast
registration predictions to approximate a simplified geodesic regression model
to capture longitudinal brain changes. The resulting method is orders of
magnitude faster than the standard optimization-based regression model and
hence facilitates large-scale analysis on a single graphics processing unit
(GPU). We evaluate our results on 3D brain magnetic resonance images (MRI) from
the ADNI datasets.Comment: 19 pages, 10 figures, 13 table
Scalable joint segmentation and registration framework for infant brain images
The first year of life is the most dynamic and perhaps the most critical phase of postnatal brain development. The ability to accurately measure structure changes is critical in early brain development study, which highly relies on the performances of image segmentation and registration techniques. However, either infant image segmentation or registration, if deployed independently, encounters much more challenges than segmentation/registration of adult brains due to dynamic appearance change with rapid brain development. In fact, image segmentation and registration of infant images can assists each other to overcome the above challenges by using the growth trajectories (i.e., temporal correspondences) learned from a large set of training subjects with complete longitudinal data. Specifically, a one-year-old image with ground-truth tissue segmentation can be first set as the reference domain. Then, to register the infant image of a new subject at earlier age, we can estimate its tissue probability maps, i.e., with sparse patch-based multi-atlas label fusion technique, where only the training images at the respective age are considered as atlases since they have similar image appearance. Next, these probability maps can be fused as a good initialization to guide the level set segmentation. Thus, image registration between the new infant image and the reference image is free of difficulty of appearance changes, by establishing correspondences upon the reasonably segmented images. Importantly, the segmentation of new infant image can be further enhanced by propagating the much more reliable label fusion heuristics at the reference domain to the corresponding location of the new infant image via the learned growth trajectories, which brings image segmentation and registration to assist each other. It is worth noting that our joint segmentation and registration framework is also flexible to handle the registration of any two infant images even with significant age gap in the first year of life, by linking their joint segmentation and registration through the reference domain. Thus, our proposed joint segmentation and registration method is scalable to various registration tasks in early brain development studies. Promising segmentation and registration results have been achieved for infant brain MR images aged from 2-week-old to 1-year-old, indicating the applicability of our method in early brain development study
Histopathological image analysis : a review
Over the past decade, dramatic increases in computational power and improvement in image analysis algorithms have allowed the development of powerful computer-assisted analytical approaches to radiological data. With the recent advent of whole slide digital scanners, tissue histopathology slides can now be digitized and stored in digital image form. Consequently, digitized tissue histopathology has now become amenable to the application of computerized image analysis and machine learning techniques. Analogous to the role of computer-assisted diagnosis (CAD) algorithms in medical imaging to complement the opinion of a radiologist, CAD algorithms have begun to be developed for disease detection, diagnosis, and prognosis prediction to complement the opinion of the pathologist. In this paper, we review the recent state of the art CAD technology for digitized histopathology. This paper also briefly describes the development and application of novel image analysis technology for a few specific histopathology related problems being pursued in the United States and Europe
Recommended from our members
CT colonography: external clinical validation of an algorithm for computer-assisted prone and supine registration
Purpose
To perform external validation of a computer-assisted registration algorithm for prone and supine computed tomographic (CT) colonography and to compare the results with those of an existing centerline method.
Materials and Methods
All contributing centers had institutional review board approval; participants provided informed consent. A validation sample of CT colonographic examinations of 51 patients with 68 polyps (6–55 mm) was selected from a publicly available, HIPAA compliant, anonymized archive. No patients were excluded because of poor preparation or inadequate distension. Corresponding prone and supine polyp coordinates were recorded, and endoluminal surfaces were registered automatically by using a computer algorithm. Two observers independently scored three-dimensional endoluminal polyp registration success. Results were compared with those obtained by using the normalized distance along the colonic centerline (NDACC) method. Pairwise Wilcoxon signed rank tests were used to compare gross registration error and McNemar tests were used to compare polyp conspicuity.
Results
Registration was possible in all 51 patients, and 136 paired polyp coordinates were generated (68 polyps) to test the algorithm. Overall mean three-dimensional polyp registration error (mean ± standard deviation, 19.9 mm ± 20.4) was significantly less than that for the NDACC method (mean, 27.4 mm ± 15.1; P = .001). Accuracy was unaffected by colonic segment (P = .76) or luminal collapse (P = .066). During endoluminal review by two observers (272 matching tasks, 68 polyps, prone to supine and supine to prone coordinates), 223 (82%) polyp matches were visible (120° field of view) compared with just 129 (47%) when the NDACC method was used (P < .001). By using multiplanar visualization, 48 (70%) polyps were visible after scrolling ± 15 mm in any multiplanar axis compared with 16 (24%) for NDACC (P < .001).
Conclusion
Computer-assisted registration is more accurate than the NDACC method for mapping the endoluminal surface and matching the location of polyps in corresponding prone and supine CT colonographic acquisitions
REGISTRATION AND SEGMENTATION OF BRAIN MR IMAGES FROM ELDERLY INDIVIDUALS
Quantitative analysis of the MRI structural and functional images is a fundamental component in the assessment of brain anatomical abnormalities, in mapping functional activation onto human anatomy, in longitudinal evaluation of disease progression, and in computer-assisted neurosurgery or surgical planning. Image registration and segmentation is central in analyzing structural and functional MR brain images. However, due to increased variability in brain morphology and age-related atrophy, traditional methods for image registration and segmentation are not suitable for analyzing MR brain images from elderly individuals. The overall goal of this dissertation is to develop algorithms to improve the registration and segmentation accuracy in the geriatric population. The specific aims of this work includes 1) to implement a fully deformable registration pipeline to allow a higher degree of spatial deformation and produce more accurate deformation field, 2) to propose and validate an optimum template selection method for atlas-based segmentation, 3) to propose and validate a multi-template strategy for image normalization, which characterizes brain structural variations in the elderly, 4) to develop an automated segmentation and localization method to access white matter integrity (WMH) in the elderly population, and finally 5) to study the default-mode network (DMN) connectivity and white matter hyperintensity in late-life depression (LLD) with the developed registration and segmentation methods. Through a series of experiments, we have shown that the deformable registration pipeline and the template selection strategies lead to improved accuracy in the brain MR image registration and segmentation, and the automated WMH segmentation and localization method provides more specific and more accurate information about volume and spatial distribution of WMH than traditional visual grading methods. Using the developed methods, our clinical study provides evidence for altered DMN connectivity in LLD. The correlation between WMH volume and DMN connectivity emphasizes the role of vascular changes in LLD's etiopathogenesis
Homeomorphic Image Registration via Conformal-Invariant Hyperelastic Regularisation
Deformable image registration is a fundamental task in medical image analysis
and plays a crucial role in a wide range of clinical applications. Recently,
deep learning-based approaches have been widely studied for deformable medical
image registration and achieved promising results. However, existing deep
learning image registration techniques do not theoretically guarantee
topology-preserving transformations. This is a key property to preserve
anatomical structures and achieve plausible transformations that can be used in
real clinical settings. We propose a novel framework for deformable image
registration. Firstly, we introduce a novel regulariser based on
conformal-invariant properties in a nonlinear elasticity setting. Our
regulariser enforces the deformation field to be smooth, invertible and
orientation-preserving. More importantly, we strictly guarantee topology
preservation yielding to a clinical meaningful registration. Secondly, we boost
the performance of our regulariser through coordinate MLPs, where one can view
the to-be-registered images as continuously differentiable entities. We
demonstrate, through numerical and visual experiments, that our framework is
able to outperform current techniques for image registration.Comment: 11 pages, 3 figure
Diffeomorphic image registration with applications to deformation modelling between multiple data sets
Over last years, the diffeomorphic image registration algorithms have been successfully introduced into the field of the medical image analysis. At the same time, the particular usability of these techniques, in majority derived from the solid mathematical background, has been only quantitatively explored for the limited applications such as longitudinal studies on treatment quality, or diseases progression.
The thesis considers the deformable image registration algorithms, seeking out those that maintain the medical correctness of the estimated dense deformation fields in terms of the preservation of the object and its neighbourhood topology, offer the reasonable computational complexity to satisfy time restrictions coming from the potential applications, and are able to cope with low quality data typically encountered in Adaptive Radiotherapy (ART). The research has led to the main emphasis being laid on the diffeomorphic image registration to achieve one-to-one mapping between images. This involves introduction of the log-domain parameterisation of the deformation field by its approximation via a stationary velocity field.
A quantitative and qualitative examination of existing and newly proposed algorithms for pairwise deformable image registration presented in this thesis, shows that the log-Euclidean parameterisation can be successfully utilised in the biomedical applications. Although algorithms utilising the log-domain parameterisation have theoretical justification for maintaining diffeomorphism, in general, the deformation fields produced by them have similar properties as these estimated by classical methods. Having this in mind, the best compromise in terms of the quality of the deformation fields has been found for the consistent image registration framework. The experimental results suggest also that the image registration with the symmetrical warping of the input images outperforms the classical approaches, and simultaneously can be easily introduced to most known algorithms.
Furthermore, the log-domain implicit group-wise image registration is proposed. By linking the various sets of images related to the different subjects, the proposed image registration approach establishes a common subject space and between-subject correspondences therein. Although the correspondences between groups of images can be found by performing the classic image registration, the reference image selection (not required in the proposed implementation), may lead to a biased mean image being estimated and the corresponding common subject space not adequate to represent the general properties of the data sets.
The approaches to diffeomorphic image registration have been also utilised as the principal elements for estimating the movements of the organs in the pelvic area based on the dense deformation field prediction system driven by the partial information coming from the specific type of the measurements parameterised using the implicit surface representation, and recognising facial expressions where the stationary velocity fields are used as the facial expression descriptors. Both applications have been extensively evaluated based on the real representative data sets of three-dimensional volumes and two-dimensional images, and the obtained results indicate the practical usability of the proposed techniques
- …