5,595 research outputs found
Extracting Tree-structures in CT data by Tracking Multiple Statistically Ranked Hypotheses
In this work, we adapt a method based on multiple hypothesis tracking (MHT)
that has been shown to give state-of-the-art vessel segmentation results in
interactive settings, for the purpose of extracting trees. Regularly spaced
tubular templates are fit to image data forming local hypotheses. These local
hypotheses are used to construct the MHT tree, which is then traversed to make
segmentation decisions. However, some critical parameters in this method are
scale-dependent and have an adverse effect when tracking structures of varying
dimensions. We propose to use statistical ranking of local hypotheses in
constructing the MHT tree, which yields a probabilistic interpretation of
scores across scales and helps alleviate the scale-dependence of MHT
parameters. This enables our method to track trees starting from a single seed
point. Our method is evaluated on chest CT data to extract airway trees and
coronary arteries. In both cases, we show that our method performs
significantly better than the original MHT method.Comment: Accepted for publication at the International Journal of Medical
Physics and Practic
Nilpotent Approximations of Sub-Riemannian Distances for Fast Perceptual Grouping of Blood Vessels in 2D and 3D
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 and . In our distance
approximations we consider homogeneous norms on nilpotent groups that locally
approximate , and which are obtained via the exponential and logarithmic
map on . 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 .
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 and .Comment: 18 pages, 9 figures, 3 tables, in review at JMI
Graph Refinement based Airway Extraction using Mean-Field Networks and Graph Neural Networks
Graph refinement, or the task of obtaining subgraphs of interest from
over-complete graphs, can have many varied applications. In this work, we
extract trees or collection of sub-trees from image data by, first deriving a
graph-based representation of the volumetric data and then, posing the tree
extraction as a graph refinement task. We present two methods to perform graph
refinement. First, we use mean-field approximation (MFA) to approximate the
posterior density over the subgraphs from which the optimal subgraph of
interest can be estimated. Mean field networks (MFNs) are used for inference
based on the interpretation that iterations of MFA can be seen as feed-forward
operations in a neural network. This allows us to learn the model parameters
using gradient descent. Second, we present a supervised learning approach using
graph neural networks (GNNs) which can be seen as generalisations of MFNs.
Subgraphs are obtained by training a GNN-based graph refinement model to
directly predict edge probabilities. We discuss connections between the two
classes of methods and compare them for the task of extracting airways from 3D,
low-dose, chest CT data. We show that both the MFN and GNN models show
significant improvement when compared to one baseline method, that is similar
to a top performing method in the EXACT'09 Challenge, and a 3D U-Net based
airway segmentation model, in detecting more branches with fewer false
positives.Comment: Accepted for publication at Medical Image Analysis. 14 page
Extraction of Airways with Probabilistic State-space Models and Bayesian Smoothing
Segmenting tree structures is common in several image processing
applications. In medical image analysis, reliable segmentations of airways,
vessels, neurons and other tree structures can enable important clinical
applications. We present a framework for tracking tree structures comprising of
elongated branches using probabilistic state-space models and Bayesian
smoothing. Unlike most existing methods that proceed with sequential tracking
of branches, we present an exploratory method, that is less sensitive to local
anomalies in the data due to acquisition noise and/or interfering structures.
The evolution of individual branches is modelled using a process model and the
observed data is incorporated into the update step of the Bayesian smoother
using a measurement model that is based on a multi-scale blob detector.
Bayesian smoothing is performed using the RTS (Rauch-Tung-Striebel) smoother,
which provides Gaussian density estimates of branch states at each tracking
step. We select likely branch seed points automatically based on the response
of the blob detection and track from all such seed points using the RTS
smoother. We use covariance of the marginal posterior density estimated for
each branch to discriminate false positive and true positive branches. The
method is evaluated on 3D chest CT scans to track airways. We show that the
presented method results in additional branches compared to a baseline method
based on region growing on probability images.Comment: 10 pages. Pre-print of the paper accepted at Workshop on Graphs in
Biomedical Image Analysis. MICCAI 2017. Quebec Cit
VTrails: Inferring Vessels with Geodesic Connectivity Trees
The analysis of vessel morphology and connectivity has an impact on a number
of cardiovascular and neurovascular applications by providing patient-specific
high-level quantitative features such as spatial location, direction and scale.
In this paper we present an end-to-end approach to extract an acyclic vascular
tree from angiographic data by solving a connectivity-enforcing anisotropic
fast marching over a voxel-wise tensor field representing the orientation of
the underlying vascular tree. The method is validated using synthetic and real
vascular images. We compare VTrails against classical and state-of-the-art
ridge detectors for tubular structures by assessing the connectedness of the
vesselness map and inspecting the synthesized tensor field as proof of concept.
VTrails performance is evaluated on images with different levels of
degradation: we verify that the extracted vascular network is an acyclic graph
(i.e. a tree), and we report the extraction accuracy, precision and recall
- …