Publications

2010

Riklin-Raviv T, Van Leemput K, Menze BH, Wells WM, Golland P. Segmentation of image ensembles via latent atlases. Med Image Anal. 2010;14(5):654–65.
Spatial priors, such as probabilistic atlases, play an important role in MRI segmentation. However, the availability of comprehensive, reliable and suitable manual segmentations for atlas construction is limited. We therefore propose a method for joint segmentation of corresponding regions of interest in a collection of aligned images that does not require labeled training data. Instead, a latent atlas, initialized by at most a single manual segmentation, is inferred from the evolving segmentations of the ensemble. The algorithm is based on probabilistic principles but is solved using partial differential equations (PDEs) and energy minimization criteria. We evaluate the method on two datasets, segmenting subcortical and cortical structures in a multi-subject study and extracting brain tumors in a single-subject multi-modal longitudinal experiment. We compare the segmentation results to manual segmentations, when those exist, and to the results of a state-of-the-art atlas-based segmentation method. The quality of the results supports the latent atlas as a promising alternative when existing atlases are not compatible with the images to be segmented.
Rathi Y, Malcolm JG, Michailovich O, Westin CF, Shenton ME, Bouix S. Tensor kernels for simultaneous fiber model estimation and tractography. Magn Reson Med. 2010;64(1):138–48.
This paper proposes a novel framework for joint orientation distribution function estimation and tractography based on a new class of tensor kernels. Existing techniques estimate the local fiber orientation at each voxel independently so there is no running knowledge of confidence in the measured signal or estimated fiber orientation. In this work, fiber tracking is formulated as recursive estimation: at each step of tracing the fiber, the current estimate of the orientation distribution function is guided by the previous. To do this, second-and higher-order tensor-based kernels are employed. A weighted mixture of these tensor kernels is used for representing crossing and branching fiber structures. While tracing a fiber, the parameters of the mixture model are estimated based on the orientation distribution function at that location and a smoothness term that penalizes deviation from the previous estimate along the fiber direction. This ensures smooth estimation along the direction of propagation of the fiber. In synthetic experiments, using a mixture of two and three components it is shown that this approach improves the angular resolution at crossings. In vivo experiments using two and three components examine the corpus callosum and corticospinal tract and confirm the ability to trace through regions known to contain such crossing and branching.
Malcolm JG, Shenton ME, Rathi Y. Filtered multitensor tractography. IEEE Trans Med Imaging. 2010;29(9):1664–75.
We describe a technique that uses tractography to drive the local fiber model estimation. Existing techniques use independent estimation at each voxel so there is no running knowledge of confidence in the estimated model fit. We formulate fiber tracking as recursive estimation: at each step of tracing the fiber, the current estimate is guided by those previous. To do this we perform tractography within a filter framework and use a discrete mixture of Gaussian tensors to model the signal. Starting from a seed point, each fiber is traced to its termination using an unscented Kalman filter to simultaneously fit the local model to the signal and propagate in the most consistent direction. Despite the presence of noise and uncertainty, this provides a causal estimate of the local structure at each point along the fiber. Using two- and three-fiber models we demonstrate in synthetic experiments that this approach significantly improves the angular resolution at crossings and branchings. In vivo experiments confirm the ability to trace through regions known to contain such crossing and branching while providing inherent path regularization.
Sabuncu MR, Yeo BTT, Van Leemput K, Fischl B, Golland P. A generative model for image segmentation based on label fusion. IEEE Trans Med Imaging. 2010;29(10):1714–29.
We propose a nonparametric, probabilistic model for the automatic segmentation of medical images, given a training set of images and corresponding label maps. The resulting inference algorithms rely on pairwise registrations between the test image and individual training images. The training labels are then transferred to the test image and fused to compute the final segmentation of the test subject. Such label fusion methods have been shown to yield accurate segmentation, since the use of multiple registrations captures greater inter-subject anatomical variability and improves robustness against occasional registration failures. To the best of our knowledge, this manuscript presents the first comprehensive probabilistic framework that rigorously motivates label fusion as a segmentation approach. The proposed framework allows us to compare different label fusion algorithms theoretically and practically. In particular, recent label fusion or multiatlas segmentation algorithms are interpreted as special cases of our framework. We conduct two sets of experiments to validate the proposed methods. In the first set of experiments, we use 39 brain MRI scans-with manually segmented white matter, cerebral cortex, ventricles and subcortical structures-to compare different label fusion algorithms and the widely-used FreeSurfer whole-brain segmentation tool. Our results indicate that the proposed framework yields more accurate segmentation than FreeSurfer and previous label fusion algorithms. In a second experiment, we use brain MRI scans of 282 subjects to demonstrate that the proposed segmentation tool is sufficiently sensitive to robustly detect hippocampal volume changes in a study of aging and Alzheimer’s Disease.
Dambreville S, Sandhu R, Yezzi A, Tannenbaum A. A Geometric Approach to Joint 2D Region-Based Segmentation and 3D Pose Estimation Using a 3D Shape Prior. SIAM J Imaging Sci. 2010;3(1):110–132.
In this work, we present an approach to jointly segment a rigid object in a two-dimensional (2D) image and estimate its three-dimensional (3D) pose, using the knowledge of a 3D model. We naturally couple the two processes together into a shape optimization problem and minimize a unique energy functional through a variational approach. Our methodology differs from the standard monocular 3D pose estimation algorithms since it does not rely on local image features. Instead, we use global image statistics to drive the pose estimation process. This confers a satisfying level of robustness to noise and initialization for our algorithm and bypasses the need to establish correspondences between image and object features. Moreover, our methodology possesses the typical qualities of region-based active contour techniques with shape priors, such as robustness to occlusions or missing information, without the need to evolve an infinite dimensional curve. Another novelty of the proposed contribution is to use a unique 3D model surface of the object, instead of learning a large collection of 2D shapes to accommodate the diverse aspects that a 3D object can take when imaged by a camera. Experimental results on both synthetic and real images are provided, which highlight the robust performance of the technique in challenging tracking and segmentation applications.
Sandhu R, Dambreville S, Tannenbaum A. Point set registration via particle filtering and stochastic dynamics. IEEE Trans Pattern Anal Mach Intell. 2010;32(8):1459–73.
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms compute the transformation parameters by maximizing a metric given an estimate of the correspondence between points across the two sets of interest. This can be viewed as a posterior estimation problem, in which the corresponding distribution can naturally be estimated using a particle filter. In this work, we treat motion as a local variation in pose parameters obtained by running a few iterations of a certain local optimizer. Employing this idea, we introduce stochastic motion dynamics to widen the narrow band of convergence often found in local optimizer approaches for registration. Thus, the novelty of our method is threefold: First, we employ a particle filtering scheme to drive the point set registration process. Second, we present a local optimizer that is motivated by the correlation measure. Third, we increase the robustness of the registration performance by introducing a dynamic model of uncertainty for the transformation parameters. In contrast with other techniques, our approach requires no annealing schedule, which results in a reduction in computational complexity (with respect to particle size) as well as maintains the temporal coherency of the state (no loss of information). Also unlike some alternative approaches for point set registration, we make no geometric assumptions on the two data sets. Experimental results are provided that demonstrate the robustness of the algorithm to initialization, noise, missing structures, and/or differing point densities in each set, on several challenging 2D and 3D registration scenarios.
Dominitz A, Tannenbaum A. Texture mapping via optimal mass transport. IEEE Trans Vis Comput Graph. 2010;16(3):419–33.
In this paper, we present a novel method for texture mapping of closed surfaces. Our method is based on the technique of optimal mass transport (also known as the "earth-mover’s metric"). This is a classical problem that concerns determining the optimal way, in the sense of minimal transportation cost, of moving a pile of soil from one site to another. In our context, the resulting mapping is area preserving and minimizes angle distortion in the optimal mass sense. Indeed, we first begin with an angle-preserving mapping (which may greatly distort area) and then correct it using the mass transport procedure derived via a certain gradient flow. In order to obtain fast convergence to the optimal mapping, we incorporate a multiresolution scheme into our flow. We also use ideas from discrete exterior calculus in our computations.
Etgar L, Nakhmani A, Tannenbaum A, Lifshitz E, Tannenbaum R. Trajectory control of PbSe-gamma-Fe2O3 nanoplatforms under viscous flow and an external magnetic field. Nanotechnology. 2010;21(17):175702.
The flow behavior of nanostructure clusters, consisting of chemically bonded PbSe quantum dots and magnetic gamma-Fe(2)O(3) nanoparticles, has been investigated. The clusters are regarded as model nanoplatforms with multiple functionalities, where the gamma-Fe(2)O(3) magnets serve as transport vehicles, manipulated by an external magnetic field gradient, and the quantum dots act as fluorescence tags within an optical window in the near-infrared regime. The clusters’ flow was characterized by visualizing their trajectories within a viscous fluid (mimicking a blood stream), using an optical imaging method, while the trajectory pictures were analyzed by a specially developed processing package. The trajectories were examined under various flow rates, viscosities and applied magnetic field strengths. The results revealed a control of the trajectories even at low magnetic fields (
Walter T, Shattuck DW, Baldock R, Bastin ME, Carpenter AE, Duce S, Ellenberg J, Fraser A, Hamilton N, Pieper S, Ragan MA, Schneider JE, Tomancak P, Hériché JK. Visualization of image data from cells to organisms. Nat Methods. 2010;7(3 Suppl):26–41.
Advances in imaging techniques and high-throughput technologies are providing scientists with unprecedented possibilities to visualize internal structures of cells, organs and organisms and to collect systematic image data characterizing genes and proteins on a large scale. To make the best use of these increasingly complex and large image data resources, the scientific community must be provided with methods to query, analyze and crosslink these resources to give an intuitive visual representation of the data. This review gives an overview of existing methods and tools for this purpose and highlights some of their limitations and challenges.
Jolley M, Stinstra J, Tate J, Pieper S, MacLeod R, Chu L, Wang P, Triedman JK. Finite element modeling of subcutaneous implantable defibrillator electrodes in an adult torso. Heart Rhythm. 2010;7(5):692–8.
BACKGROUND: Total subcutaneous implantable subcutaneous defibrillators are in development, but optimal electrode configurations are not known. OBJECTIVE: We used image-based finite element models (FEM) to predict the myocardial electric field generated during defibrillation shocks (pseudo-DFT) in a wide variety of reported and innovative subcutaneous electrode positions to determine factors affecting optimal lead positions for subcutaneous implantable cardioverter-defibrillators (S-ICD). METHODS: An image-based FEM of an adult man was used to predict pseudo-DFTs across a wide range of technically feasible S-ICD electrode placements. Generator location, lead location, length, geometry and orientation, and spatial relation of electrodes to ventricular mass were systematically varied. Best electrode configurations were determined, and spatial factors contributing to low pseudo-DFTs were identified using regression and general linear models. RESULTS: A total of 122 single-electrode/array configurations and 28 dual-electrode configurations were simulated. Pseudo-DFTs for single-electrode orientations ranged from 0.60 to 16.0 (mean 2.65 +/- 2.48) times that predicted for the base case, an anterior-posterior configuration recently tested clinically. A total of 32 of 150 tested configurations (21%) had pseudo-DFT ratios