9,418 research outputs found

    Computerized Analysis of Magnetic Resonance Images to Study Cerebral Anatomy in Developing Neonates

    Get PDF
    The study of cerebral anatomy in developing neonates is of great importance for the understanding of brain development during the early period of life. This dissertation therefore focuses on three challenges in the modelling of cerebral anatomy in neonates during brain development. The methods that have been developed all use Magnetic Resonance Images (MRI) as source data. To facilitate study of vascular development in the neonatal period, a set of image analysis algorithms are developed to automatically extract and model cerebral vessel trees. The whole process consists of cerebral vessel tracking from automatically placed seed points, vessel tree generation, and vasculature registration and matching. These algorithms have been tested on clinical Time-of- Flight (TOF) MR angiographic datasets. To facilitate study of the neonatal cortex a complete cerebral cortex segmentation and reconstruction pipeline has been developed. Segmentation of the neonatal cortex is not effectively done by existing algorithms designed for the adult brain because the contrast between grey and white matter is reversed. This causes pixels containing tissue mixtures to be incorrectly labelled by conventional methods. The neonatal cortical segmentation method that has been developed is based on a novel expectation-maximization (EM) method with explicit correction for mislabelled partial volume voxels. Based on the resulting cortical segmentation, an implicit surface evolution technique is adopted for the reconstruction of the cortex in neonates. The performance of the method is investigated by performing a detailed landmark study. To facilitate study of cortical development, a cortical surface registration algorithm for aligning the cortical surface is developed. The method first inflates extracted cortical surfaces and then performs a non-rigid surface registration using free-form deformations (FFDs) to remove residual alignment. Validation experiments using data labelled by an expert observer demonstrate that the method can capture local changes and follow the growth of specific sulcus

    Locally Adaptive Frames in the Roto-Translation Group and their Applications in Medical Imaging

    Get PDF
    Locally adaptive differential frames (gauge frames) are a well-known effective tool in image analysis, used in differential invariants and PDE-flows. However, at complex structures such as crossings or junctions, these frames are not well-defined. Therefore, we generalize the notion of gauge frames on images to gauge frames on data representations U:Rd⋊Sd−1→RU:\mathbb{R}^{d} \rtimes S^{d-1} \to \mathbb{R} defined on the extended space of positions and orientations, which we relate to data on the roto-translation group SE(d)SE(d), d=2,3d=2,3. This allows to define multiple frames per position, one per orientation. We compute these frames via exponential curve fits in the extended data representations in SE(d)SE(d). These curve fits minimize first or second order variational problems which are solved by spectral decomposition of, respectively, a structure tensor or Hessian of data on SE(d)SE(d). We include these gauge frames in differential invariants and crossing preserving PDE-flows acting on extended data representation UU and we show their advantage compared to the standard left-invariant frame on SE(d)SE(d). Applications include crossing-preserving filtering and improved segmentations of the vascular tree in retinal images, and new 3D extensions of coherence-enhancing diffusion via invertible orientation scores

    Nilpotent Approximations of Sub-Riemannian Distances for Fast Perceptual Grouping of Blood Vessels in 2D and 3D

    Get PDF
    We propose an efficient approach for the grouping of local orientations (points on vessels) via nilpotent approximations of sub-Riemannian distances in the 2D and 3D roto-translation groups SE(2)SE(2) and SE(3)SE(3). In our distance approximations we consider homogeneous norms on nilpotent groups that locally approximate SE(n)SE(n), and which are obtained via the exponential and logarithmic map on SE(n)SE(n). In a qualitative validation we show that the norms provide accurate approximations of the true sub-Riemannian distances, and we discuss their relations to the fundamental solution of the sub-Laplacian on SE(n)SE(n). The quantitative experiments further confirm the accuracy of the approximations. Quantitative results are obtained by evaluating perceptual grouping performance of retinal blood vessels in 2D images and curves in challenging 3D synthetic volumes. The results show that 1) sub-Riemannian geometry is essential in achieving top performance and 2) that grouping via the fast analytic approximations performs almost equally, or better, than data-adaptive fast marching approaches on Rn\mathbb{R}^n and SE(n)SE(n).Comment: 18 pages, 9 figures, 3 tables, in review at JMI

    Multiscale modelling of vascular tumour growth in 3D: the roles of domain size & boundary condition

    Get PDF
    We investigate a three-dimensional multiscale model of vascular tumour growth, which couples blood flow, angiogenesis, vascular remodelling, nutrient/growth factor transport, movement of, and interactions between, normal and tumour cells, and nutrient-dependent cell cycle dynamics within each cell. In particular, we determine how the domain size, aspect ratio and initial vascular network influence the tumour's growth dynamics and its long-time composition. We establish whether it is possible to extrapolate simulation results obtained for small domains to larger ones, by constructing a large simulation domain from a number of identical subdomains, each subsystem initially comprising two parallel parent vessels, with associated cells and diffusible substances. We find that the subsystem is not representative of the full domain and conclude that, for this initial vessel geometry, interactions between adjacent subsystems contribute to the overall growth dynamics. We then show that extrapolation of results from a small subdomain to a larger domain can only be made if the subdomain is sufficiently large and is initialised with a sufficiently complex vascular network. Motivated by these results, we perform simulations to investigate the tumour's response to therapy and show that the probability of tumour elimination in a larger domain can be extrapolated from simulation results on a smaller domain. Finally, we demonstrate how our model may be combined with experimental data, to predict the spatio-temporal evolution of a vascular tumour

    A Rule Based Segmentation Approaches to Extract Retinal Blood Vessels in Fundus Image

    Get PDF
    The physiological structures of the retinal blood vessel are one of the key features that visible in the retinal images and contain the information associate with the anatomical abnormalities. It is accepted all over the world to judge the cardiovascular and retinal disease. To avoid the risk of visual impairment, appropriate vessel segmentation is mandatory. Here has proposed a segmentation algorithm that efficiently extracts the blood vessels from the retinal fundus image. The proposed segmentation algorithm is performed Lab and Principle Component (PC) based gray level conversion, Contrast Limited Adaptive Histogram Equalization (CLAHE), morphological operations, Local Property-Based Pixel Correction (LPBPC). For appropriate detection proposed vessels correction algorithm LPBPC that check the feature of the vessels and remove the wrong vessel detection. To measure the appropriateness of the proposed algorithm, the experimental results are compared with the corresponding ground truth images. The experimental results have shown that the proposed blood vessel algorithm is more accurate than the existing algorithms

    Sub-Riemannian Fast Marching in SE(2)

    Full text link
    We propose a Fast Marching based implementation for computing sub-Riemanninan (SR) geodesics in the roto-translation group SE(2), with a metric depending on a cost induced by the image data. The key ingredient is a Riemannian approximation of the SR-metric. Then, a state of the art Fast Marching solver that is able to deal with extreme anisotropies is used to compute a SR-distance map as the solution of a corresponding eikonal equation. Subsequent backtracking on the distance map gives the geodesics. To validate the method, we consider the uniform cost case in which exact formulas for SR-geodesics are known and we show remarkable accuracy of the numerically computed SR-spheres. We also show a dramatic decrease in computational time with respect to a previous PDE-based iterative approach. Regarding image analysis applications, we show the potential of considering these data adaptive geodesics for a fully automated retinal vessel tree segmentation.Comment: CIARP 201
    • …
    corecore