1,930 research outputs found
Gap Filling of 3-D Microvascular Networks by Tensor Voting
We present a new algorithm which merges discontinuities in 3-D images of tubular structures presenting undesirable gaps. The application of the proposed method is mainly associated to large 3-D images of microvascular networks. In order to recover the real network topology, we need to ïŹll the gaps between the closest discontinuous vessels. The algorithm presented in this paper aims at achieving this goal. This algorithm is based on the skeletonization of the segmented network followed by a tensor voting method. It permits to merge the most common kinds of discontinuities found in microvascular networks. It is robust, easy to use, and relatively fast. The microvascular network images were obtained using synchrotron tomography imaging at the European Synchrotron Radiation Facility. These images exhibit samples of intracortical networks. Representative results are illustrated
Simulated annealing approach to vascular structure with application to the coronary arteries
Do the complex processes of angiogenesis during organism development ultimately lead to a near optimal coronary vasculature in the organs of adult mammals? We examine this hypothesis using a powerful and universal method, built on physical and physiological principles, for the determination of globally energetically optimal arterial trees. The method is based on simulated annealing, and can be used to examine arteries in hollow organs with arbitrary tissue geometries. We demonstrate that the approach can generate in silico vasculatures which closely match porcine anatomical data for the coronary arteries on all length scales, and that the optimized arterial trees improve systematically as computational time increases. The method presented here is general, and could in principle be used to examine the arteries of other organs. Potential applications include improvement of medical imaging analysis and the design of vascular trees for artificial organs
Quantitative magnetic resonance image analysis via the EM algorithm with stochastic variation
Quantitative Magnetic Resonance Imaging (qMRI) provides researchers insight
into pathological and physiological alterations of living tissue, with the help
of which researchers hope to predict (local) therapeutic efficacy early and
determine optimal treatment schedule. However, the analysis of qMRI has been
limited to ad-hoc heuristic methods. Our research provides a powerful
statistical framework for image analysis and sheds light on future localized
adaptive treatment regimes tailored to the individual's response. We assume in
an imperfect world we only observe a blurred and noisy version of the
underlying pathological/physiological changes via qMRI, due to measurement
errors or unpredictable influences. We use a hidden Markov random field to
model the spatial dependence in the data and develop a maximum likelihood
approach via the Expectation--Maximization algorithm with stochastic variation.
An important improvement over previous work is the assessment of variability in
parameter estimation, which is the valid basis for statistical inference. More
importantly, we focus on the expected changes rather than image segmentation.
Our research has shown that the approach is powerful in both simulation studies
and on a real dataset, while quite robust in the presence of some model
assumption violations.Comment: Published in at http://dx.doi.org/10.1214/07-AOAS157 the Annals of
Applied Statistics (http://www.imstat.org/aoas/) by the Institute of
Mathematical Statistics (http://www.imstat.org
Development of a globally optimised model of the cerebral arteries
The cerebral arteries are difficult to reproduce from first principles, featuring interwoven territories, and intricate layers of grey and white matter with differing metabolic demand. The aim of this study was to identify the ideal configuration of arteries required to sustain an entire brain hemisphere based on minimisation of the energy required to supply the tissue. The 3D distribution of grey and white matter within a healthy human brain was first segmented from Magnetic Resonance Images. A novel simulated annealing algorithm was then applied to determine the optimal configuration of arteries required to supply brain tissue. The model is validated through comparison of this ideal, entirely optimised, brain vasculature with the known structure of real arteries. This establishes that the human cerebral vasculature is highly optimised; closely resembling the most energy efficient arrangement of vessels. In addition to local adherence to fluid dynamics optimisation principles, the optimised vasculature reproduces global brain perfusion territories with well defined boundaries between anterior, middle and posterior regions. This validated brain vascular model and algorithm can be used for patient-specific modelling of stroke and cerebral haemodynamics, identification of sub-optimal conditions associated with vascular disease, and optimising vascular structures for tissue engineering and artificial organ design
Simultaneous self-organization of arterial and venous networks driven by the physics of global power optimization
Understanding of vascular organization is a long-standing problem in
quantitative biology and biophysics and is essential for the growth of large
cultured tissues. Approaches are needed that (1) make predictions of optimal
arteriovenous networks in order to understand the natural vasculatures that
originate from evolution (2) can design vasculature for 3D printing of cultured
tissues, meats, organoids and organs. I present a method for determining the
globally optimal structure of interlocking arterial and venous (arteriovenous)
networks. The core physics is comprised of the minimization of total power
associated with the whole vascular network, with penalties to stop arterial and
venous segments from intersecting. Specifically, the power needed for
Poiseuille flow through vessels and the metabolic power cost for blood
maintenance are optimized. Simultaneous determination of both arterial and
venous vasculatures is essential to avoid intersections between vessels that
would bypass the capillary network. As proof-of-concept, I examine the optimal
vascular structure for supplying square- and disk-like tissue shapes that would
be suitable for bioprinting in multi-well plates. Features in the trees are
driven by the bifurcation exponent and metabolic constant which affect whether
arteries and veins follow the same or different routes through the tissue. They
also affect the level of tortuosity in the vessels. The method could be used to
understand the distribution of blood vessels within organs, to form the core of
simulations, and combined with 3D printing to generate vasculatures for
arbitrary volumes of cultured tissue and cultured meat
Shape-driven segmentation of the arterial wall in intravascular ultrasound images
Segmentation of arterial wall boundaries from intravascular images is an important problem for many applications in the study of plaque characteristics, mechanical properties of the arterial wall, its 3D reconstruction,
and its measurements such as lumen size, lumen radius, and wall radius. We present a shape-driven approach to segmentation of the arterial wall from intravascular ultrasound images in the rectangular domain. In a properly built
shape space using training data, we constrain the lumen and media-adventitia contours to a smooth, closed geometry, which increases the segmentation quality without any tradeoff with a regularizer term. In addition to a shape prior,
we utilize an intensity prior through a non-parametric probability density based image energy, with global image measurements rather than pointwise measurements used in previous methods. Furthermore, a detection step is included to address the challenges introduced to the segmentation process by side branches and calcifications. All these features greatly enhance our segmentation method. The tests of our algorithm on a large dataset demonstrate the effectiveness of our approach
Recommended from our members
Global energy minimisation of arterial trees with application to embolic stroke
Computer generation of optimal arterial trees has previously been limited to the production of locally optimal configurations. The application of a global optimisation algorithm allows for the generation of vasculatures with consistent structure. Comparison of this structure to that of in-vivo vasculatures allows the determination of to what extent the vascular structure is the result of energy minimisation. In this thesis an algorithm capable of generation globally optimal vascular trees in geometries derived from medical imaging is developed.
We begin by outlining a small set of constraints which capture physiological principles guiding the organisation of arterial trees. The constraints are then used to produce an algorithm capable of finding the minimal energy configuration of a given arterial tree. The algorithm is used to produce both coronary and cerebral vasculature, and the latter is generated in geometries segmented from MRI data of a human brain. The trees are compared both morphologically and structurally to those found in-vivo. The morphological comparisons for the coronary vasculature show excellent agreement with experiment. The positions of the larger coronary arteries in the generated trees agree extremely well with experiment, suggesting that structure of the coronary vasculature is the result of energy minimisation.
The generated cerebral vasculature approximates the vascular territories of the major cerebral arteries, however the morphological comparisons show that the structure of the cerebral arteries is likely not the result of energy minimisation. The cerebral vasculatures is used to extend a statistical model of embolic stroke to include the effects of branching asymmetry, and an analytic approximation to the statistical model of embolic stroke is developed and validated. It is found that branching asymmetry produces an overall reduction in the level of blockage occuring during an embolic event
Resilience of three-dimensional sinusoidal networks in liver tissue
Can three-dimensional, microvasculature networks still ensure blood supply if individual links fail? We address this question in the sinusoidal network, a plexus-like microvasculature network, which transports nutrient-rich blood to every hepatocyte in liver tissue, by building on recent advances in high-resolution imaging and digital reconstruction of adult mice liver tissue. We find that the topology of the three-dimensional sinusoidal network reflects its two design requirements of a space-filling network that connects all hepatocytes, while using shortest transport routes: sinusoidal networks are sub-graphs of the Delaunay graph of their set of branching points, and also contain the corresponding minimum spanning tree, both to good approximation. To overcome the spatial limitations of experimental samples and generate arbitrarily-sized networks, we developed a network generation algorithm that reproduces the statistical features of 0.3-mm-sized samples of sinusoidal networks, using multi-objective optimization for node degree and edge length distribution. Nematic order in these simulated networks implies anisotropic transport properties, characterized by an empirical linear relation between a nematic order parameter and the anisotropy of the permeability tensor. Under the assumption that all sinusoid tubes have a constant and equal flow resistance, we predict that the distribution of currents in the network is very inhomogeneous, with a small number of edges carrying a substantial part of the flow-a feature known for hierarchical networks, but unexpected for plexus-like networks. We quantify network resilience in terms of a permeability-at-risk, i.e., permeability as function of the fraction of removed edges. We find that sinusoidal networks are resilient to random removal of edges, but vulnerable to the removal of high-current edges. Our findings suggest the existence of a mechanism counteracting flow inhomogeneity to balance metabolic load on the liver
- âŠ