8,977 research outputs found
A Combinatorial Solution to Non-Rigid 3D Shape-to-Image Matching
We propose a combinatorial solution for the problem of non-rigidly matching a
3D shape to 3D image data. To this end, we model the shape as a triangular mesh
and allow each triangle of this mesh to be rigidly transformed to achieve a
suitable matching to the image. By penalising the distance and the relative
rotation between neighbouring triangles our matching compromises between image
and shape information. In this paper, we resolve two major challenges: Firstly,
we address the resulting large and NP-hard combinatorial problem with a
suitable graph-theoretic approach. Secondly, we propose an efficient
discretisation of the unbounded 6-dimensional Lie group SE(3). To our knowledge
this is the first combinatorial formulation for non-rigid 3D shape-to-image
matching. In contrast to existing local (gradient descent) optimisation
methods, we obtain solutions that do not require a good initialisation and that
are within a bound of the optimal solution. We evaluate the proposed method on
the two problems of non-rigid 3D shape-to-shape and non-rigid 3D shape-to-image
registration and demonstrate that it provides promising results.Comment: 10 pages, 7 figure
Elastic Registration of Geodesic Vascular Graphs
Vascular graphs can embed a number of high-level features, from morphological
parameters, to functional biomarkers, and represent an invaluable tool for
longitudinal and cross-sectional clinical inference. This, however, is only
feasible when graphs are co-registered together, allowing coherent multiple
comparisons. The robust registration of vascular topologies stands therefore as
key enabling technology for group-wise analyses. In this work, we present an
end-to-end vascular graph registration approach, that aligns networks with
non-linear geometries and topological deformations, by introducing a novel
overconnected geodesic vascular graph formulation, and without enforcing any
anatomical prior constraint. The 3D elastic graph registration is then
performed with state-of-the-art graph matching methods used in computer vision.
Promising results of vascular matching are found using graphs from synthetic
and real angiographies. Observations and future designs are discussed towards
potential clinical applications
Left Ventricle Myocardium Segmentation from 3D Cardiac MR Images using Combined Probabilistic Atlas and Graph Cut-based Approaches
Medical imaging modalities, including Computed Tomography (CT) Magnetic Resonance Imaging (MRI) and Ultrasound (US) are critical for the diagnosis and progress monitoring of many cardiac conditions, planning, visualization and delivery of therapy via minimally invasive intervention procedures, as well as for teaching, training and simulation applications.
Image segmentation is a processing technique that allows the user to extract the necessary information from an image dataset, in the form of a surface model of the region of interest from the anatomy. A wide variety of segmentation techniques have been developed and implemented for cardiac MR images. Despite their complexity and performance, many of them are intended for specific image datasets or are too specific to be employed for segmenting classical clinical quality Magnetic Resonance (MR) images.
Graph Cut based segmentation algorithms have been shown to work well in regards to medical image segmentation. In addition, they are computationally efficient, which scales well to real time applications. While the basic graph cuts algorithms use lower-order statistics, combining this segmentation approach with atlas-based methods may help improve segmentation accuracy at a lower computational cost.
The proposed technique will be tested at each step during the development by assessing the segmentation results against the available ground truth segmentation. Several metrics will be used to quantify the performance of the proposed technique, including computational performance, segmentation accuracy and fidelity assessed via the Sørensen-Dice Coefficient (DSC), Mean Absolute Distance (MAD) and Hausdorff Distance (HD) metrics
Deformable Shape Completion with Graph Convolutional Autoencoders
The availability of affordable and portable depth sensors has made scanning
objects and people simpler than ever. However, dealing with occlusions and
missing parts is still a significant challenge. The problem of reconstructing a
(possibly non-rigidly moving) 3D object from a single or multiple partial scans
has received increasing attention in recent years. In this work, we propose a
novel learning-based method for the completion of partial shapes. Unlike the
majority of existing approaches, our method focuses on objects that can undergo
non-rigid deformations. The core of our method is a variational autoencoder
with graph convolutional operations that learns a latent space for complete
realistic shapes. At inference, we optimize to find the representation in this
latent space that best fits the generated shape to the known partial input. The
completed shape exhibits a realistic appearance on the unknown part. We show
promising results towards the completion of synthetic and real scans of human
body and face meshes exhibiting different styles of articulation and
partiality.Comment: CVPR 201
- …