25 research outputs found
Finsler Active Contours
©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.DOI: 10.1109/TPAMI.2007.70713In this paper, we propose an image segmentation technique based on augmenting the conformal (or geodesic) active contour framework with directional information. In the isotropic case, the euclidean metric is locally multiplied by a scalar conformal factor based on image information such that the weighted length of curves lying on points of interest (typically edges) is small. The conformal factor that is chosen depends only upon position and is in this sense isotropic. Although directional information has been studied previously for other segmentation frameworks, here, we show that if one desires to add directionality in the conformal active contour framework, then one gets a well-defined minimization problem in the case that the factor defines a Finsler metric. Optimal curves may be obtained using the calculus of variations or dynamic programming-based schemes. Finally, we demonstrate the technique by extracting roads from aerial imagery, blood vessels from medical angiograms, and neural tracts from diffusion-weighted magnetic resonance imagery
Geodesic tractography segmentation for directional medical image analysis
Acknowledgements page removed per author's request, 01/06/2014.Geodesic Tractography Segmentation is the two component approach presented in this thesis for the analysis of imagery in oriented domains, with emphasis on the application to diffusion-weighted magnetic resonance imagery (DW-MRI). The computeraided analysis of DW-MRI data presents a new set of problems and opportunities for the application of mathematical and computer vision techniques. The goal is to develop a set of tools that enable clinicians to better understand DW-MRI data and ultimately shed new light on biological processes.
This thesis presents a few techniques and tools which may be used to automatically find and segment major neural fiber bundles from DW-MRI data. For each technique, we provide a brief overview of the advantages and limitations of our approach relative to other available approaches.Ph.D.Committee Chair: Tannenbaum, Allen; Committee Member: Barnes, Christopher F.; Committee Member: Niethammer, Marc; Committee Member: Shamma, Jeff; Committee Member: Vela, Patrici
Diffusion, convection and erosion on R3 x S2 and their application to the enhancement of crossing fibers
In this article we study both left-invariant (convection-)diffusions and left-invariant Hamilton-Jacobi equations (erosions) on the space R3 x S2 of 3D-positions and orientations naturally embedded in the group SE(3) of 3D-rigid body movements. The general motivation for these (convection-)diffusions and erosions is to obtain crossing-preserving fiber enhancement on probability densities defined on the space of positions and orientations. The linear left-invariant (convection-)diffusions are forward Kolmogorov equations of Brownian motions on R3 x S2 and can be solved by R3 x S2-convolution with the corresponding Green’s functions or by a finite difference scheme. The left-invariant Hamilton-Jacobi equations are Bellman equations of cost processes on R3 x S2 and they are solved by a morphological R3 x S2-convolution with the corresponding Green’s functions. We will reveal the remarkable analogy between these erosions/dilations and diffusions. Furthermore, we consider pseudo-linear scale spaces on the space of positions and orientations that combines dilation and diffusion in a single evolution. In our design and analysis for appropriate linear, non-linear, morphological and pseudo-linear scale spaces on R3 x S2 we employ the underlying differential geometry on SE(3), where the frame of left-invariant vector fields serves as a moving frame of reference. Furthermore, we will present new and simpler finite difference schemes for our diffusions, which are clear improvements of our previous finite difference schemes. We apply our theory to the enhancement of fibres in magnetic resonance imaging (MRI) techniques (HARDI and DTI) for imaging water diffusion processes in fibrous tissues such as brain white matter and muscles. We provide experiments of our crossing-preserving (non-linear) left-invariant evolutions on neural images of a human brain containing crossing fibers
A PDE Approach to Data-driven Sub-Riemannian Geodesics in SE(2)
We present a new flexible wavefront propagation algorithm for the boundary
value problem for sub-Riemannian (SR) geodesics in the roto-translation group
with a metric tensor depending on a smooth
external cost , , computed from
image data. The method consists of a first step where a SR-distance map is
computed as a viscosity solution of a Hamilton-Jacobi-Bellman (HJB) system
derived via Pontryagin's Maximum Principle (PMP). Subsequent backward
integration, again relying on PMP, gives the SR-geodesics. For
we show that our method produces the global minimizers. Comparison with exact
solutions shows a remarkable accuracy of the SR-spheres and the SR-geodesics.
We present numerical computations of Maxwell points and cusp points, which we
again verify for the uniform cost case . Regarding image
analysis applications, tracking of elongated structures in retinal and
synthetic images show that our line tracking generically deals with crossings.
We show the benefits of including the sub-Riemannian geometry.Comment: Extended version of SSVM 2015 conference article "Data-driven
Sub-Riemannian Geodesics in SE(2)
A triangulation-invariant method for anisotropic geodesic map computation on surface meshes
pre-printThis paper addresses the problem of computing the geodesic distance map from a given set of source vertices to all other vertices on a surface mesh using an anisotropic distance metric. Formulating this problem as an equivalent control theoretic problem with Hamilton-Jacobi-Bellman partial differential equations, we present a framework for computing an anisotropic geodesic map using a curvature-based speed function. An ordered upwind method (OUM)-based solver for these equations is available for unstructured planar meshes. We adopt this OUM-based solver for surface meshes and present a triangulation-invariant method for the solver. Our basic idea is to explore proximity among the vertices on a surface while locally following the characteristic direction at each vertex. We also propose two speed functions based on classical curvature tensors and show that the resulting anisotropic geodesic maps reflect surface geometry well through several experiments, including isocontour generation, offset curve computation, medial axis extraction, and ridge/valley curve extraction. Our approach facilitates surface analysis and processing by defining speed functions in an application-dependent manner
Near-tubular fiber bundle segmentation for diffusion weighted imaging: Segmentation through frame reorientation
This paper proposes a methodology to segment near-tubular fiber bundles from diffusion weighted magnetic resonance images (DW-MRI). Segmentation is simplified by locally reorienting diffusion information based on large-scale fiber bundle geometry. Segmentation is achieved through simple global statistical modeling of diffusion orientation. Utilizing a modification of a recent segmentation approach by Bresson et al. allows for a convex optimization formulation of the segmentation problem, combining orientation statistics and spatial regularization. The approach compares favorably with segmentation by full-brain streamline tractography
Bundle-specific Tractogram Distribution Estimation Using Higher-order Streamline Differential Equation
Tractography traces the peak directions extracted from fiber orientation
distribution (FOD) suffering from ambiguous spatial correspondences between
diffusion directions and fiber geometry, which is prone to producing erroneous
tracks while missing true positive connections. The peaks-based tractography
methods 'locally' reconstructed streamlines in 'single to single' manner, thus
lacking of global information about the trend of the whole fiber bundle. In
this work, we propose a novel tractography method based on a bundle-specific
tractogram distribution function by using a higher-order streamline
differential equation, which reconstructs the streamline bundles in 'cluster to
cluster' manner. A unified framework for any higher-order streamline
differential equation is presented to describe the fiber bundles with disjoint
streamlines defined based on the diffusion tensor vector field. At the global
level, the tractography process is simplified as the estimation of
bundle-specific tractogram distribution (BTD) coefficients by minimizing the
energy optimization model, and is used to characterize the relations between
BTD and diffusion tensor vector under the prior guidance by introducing the
tractogram bundle information to provide anatomic priors. Experiments are
performed on simulated Hough, Sine, Circle data, ISMRM 2015 Tractography
Challenge data, FiberCup data, and in vivo data from the Human Connectome
Project (HCP) data for qualitative and quantitative evaluation. The results
demonstrate that our approach can reconstruct the complex global fiber bundles
directly. BTD reduces the error deviation and accumulation at the local level
and shows better results in reconstructing long-range, twisting, and large
fanning tracts
Anisotropic Fast-Marching on cartesian grids using Lattice Basis Reduction
We introduce a modification of the Fast Marching Algorithm, which solves the
generalized eikonal equation associated to an arbitrary continuous riemannian
metric, on a two or three dimensional domain. The algorithm has a logarithmic
complexity in the maximum anisotropy ratio of the riemannian metric, which
allows to handle extreme anisotropies for a reduced numerical cost. We prove
the consistence of the algorithm, and illustrate its efficiency by numerical
experiments. The algorithm relies on the computation at each grid point of a
special system of coordinates: a reduced basis of the cartesian grid, with
respect to the symmetric positive definite matrix encoding the desired
anisotropy at this point.Comment: 28 pages, 12 figure