Learning the dynamics and time-recursive boundary detection of deformable objects

We propose a principled framework for recursively segmenting deformable objects across a sequence of frames. We demonstrate the usefulness of this method on left ventricular segmentation across a cardiac cycle. The approach involves a technique for learning the system dynamics together with methods of particle-based smoothing as well as non-parametric belief propagation on a loopy graphical model capturing the temporal periodicity of the heart. The dynamic system state is a low-dimensional representation of the boundary, and the boundary estimation involves incorporating curve evolution into recursive state estimation. By formulating the problem as one of state estimation, the segmentation at each particular time is based not only on the data observed at that instant, but also on predictions based on past and future boundary estimates. Although the paper focuses on left ventricle segmentation, the method generalizes to temporally segmenting any deformable object

Fuzzy-based Propagation of Prior Knowledge to Improve Large-Scale Image Analysis Pipelines

Many automatically analyzable scientific questions are well-posed and offer a variety of information about the expected outcome a priori. Although often being neglected, this prior knowledge can be systematically exploited to make automated analysis operations sensitive to a desired phenomenon or to evaluate extracted content with respect to this prior knowledge. For instance, the performance of processing operators can be greatly enhanced by a more focused detection strategy and the direct information about the ambiguity inherent in the extracted data. We present a new concept for the estimation and propagation of uncertainty involved in image analysis operators. This allows using simple processing operators that are suitable for analyzing large-scale 3D+t microscopy images without compromising the result quality. On the foundation of fuzzy set theory, we transform available prior knowledge into a mathematical representation and extensively use it enhance the result quality of various processing operators. All presented concepts are illustrated on a typical bioimage analysis pipeline comprised of seed point detection, segmentation, multiview fusion and tracking. Furthermore, the functionality of the proposed approach is validated on a comprehensive simulated 3D+t benchmark data set that mimics embryonic development and on large-scale light-sheet microscopy data of a zebrafish embryo. The general concept introduced in this contribution represents a new approach to efficiently exploit prior knowledge to improve the result quality of image analysis pipelines. Especially, the automated analysis of terabyte-scale microscopy data will benefit from sophisticated and efficient algorithms that enable a quantitative and fast readout. The generality of the concept, however, makes it also applicable to practically any other field with processing strategies that are arranged as linear pipelines.Comment: 39 pages, 12 figure

Top-down segmentation of non-rigid visual objects using derivative-based search on sparse manifolds

The solution for the top-down segmentation of non rigid visual objects using machine learning techniques is generally regarded as too complex to be solved in its full generality given the large dimensionality of the search space of the explicit representation of the segmentation contour. In order to reduce this complexity, the problem is usually divided into two stages: rigid detection and non-rigid segmentation. The rationale is based on the fact that the rigid detection can be run in a lower dimensionality space (i.e., less complex and faster) than the original contour space, and its result is then used to constrain the non-rigid segmentation. In this paper, we propose the use of sparse manifolds to reduce the dimensionality of the rigid detection search space of current state-of-the-art top-down segmentation methodologies. The main goals targeted by this smaller dimensionality search space are the decrease of the search running time complexity and the reduction of the training complexity of the rigid detector. These goals are attainable given that both the search and training complexities are function of the dimensionality of the rigid search space. We test our approach in the segmentation of the left ventricle from ultrasound images and lips from frontal face images. Compared to the performance of state-of-the-art non-rigid segmentation system, our experiments show that the use of sparse manifolds for the rigid detection leads to the two goals mentioned above. © 2013 IEEE.Jacinto C. Nascimento, Gustavo Carneirohttp://www.pamitc.org/cvpr13

A Study of Exploiting Objectness for Robust Online Object Tracking

Tracking is a fundamental problem in many computer vision applications. Despite the progress over the last decade, there still exist many challenges especially when the problem is posed in real world scenarios (e.g., cluttered background, occluded objects). Among them drifting has been widely observed to be a problem common to the class of online tracking algorithms - i.e., when challenges such as occlusion or nonlinear deformation of the object occurs, the tracker might lose the target completely in subsequent frames in an image sequence. In this work, we propose to exploit the objectness to partially alleviate the drifting problem with the class of online object tracking and verify the effectiveness of this idea by extensive experimental results. More specifically, a recently developed objectness measure was incorporated into Incremental Learning for Visual Tracking (IVT) algorithm in a principled way. We have come up with a strategy of reinitializing the training samples in the proposed approach to improve the robustness of online tracking. Experimental results show that using objectness measure does help to alleviate its drift to background for certain challenging sequences

Clinical Stress Echocardiography

Two-dimensional echocardiography is a commonly used non-invasive method for the assessment of left ventricular function. It provides precise information on both global and segmental myocardial function by displaying endocardial motion and wall thickening. Dobutamine stress echocardiography (DSE) is currently the leading non-invasive imaging technique for the diagnosis and prognosis of coronary artery disease (CAD), the documentation of myocardial viability and for long-term risk stratification [1]. The term clinical stress echocardiography is starting to be applied as DSE is used in different clinical settings

Combining multiple dynamic models and deep learning architectures for tracking the left ventricle endocardium in ultrasound data

We present a new statistical pattern recognition approach for the problem of left ventricle endocardium tracking in ultrasound data. The problem is formulated as a sequential importance resampling algorithm such that the expected segmentation of the current time step is estimated based on the appearance, shape, and motion models that take into account all previous and current images and previous segmentation contours produced by the method. The new appearance and shape models decouple the affine and nonrigid segmentations of the left ventricle to reduce the running time complexity. The proposed motion model combines the systole and diastole motion patterns and an observation distribution built by a deep neural network. The functionality of our approach is evaluated using a dataset of diseased cases containing 16 sequences and another dataset of normal cases comprised of four sequences, where both sets present long axis views of the left ventricle. Using a training set comprised of diseased and healthy cases, we show that our approach produces more accurate results than current state-of-the-art endocardium tracking methods in two test sequences from healthy subjects. Using three test sequences containing different types of cardiopathies, we show that our method correlates well with interuser statistics produced by four cardiologists.Gustavo Carneiro and Jacinto C. Nasciment

Learning the dynamics of deformable objects and recursive boundary estimation using curve evolution techniques

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Includes bibliographical references (p. 161-176).The primary objective of this thesis is to develop robust algorithms for the incorporation of statistical information in the problem of estimating object boundaries in image data. We propose two primary algorithms, one which jointly estimates the underlying field and boundary in a static image and another which performs image segmentation across a temporal sequence. Some motivating applications come from the earth sciences and medical imaging. In particular, we examine the problems of oceanic front and sea surface temperature estimation in oceanography, soil boundary and moisture estimation in hydrology, and left ventricle boundary estimation across a cardiac cycle in medical imaging. To accomplish joint estimation in a static image, we introduce a variational technique that incorporates the spatial statistics of the underlying field to segment the boundary and estimate the field on either side of the boundary. For image segmentation across a sequence of frames, we propose a method for learning the dynamics of a deformable boundary that uses these learned dynamics to recursively estimate the boundary in each frame over time. In the recursive estimation algorithm, we extend the traditional particle filtering approach by applying sample-based methods to a complex shape space.(cont.) We find a low-dimensional representation for this shape-shape to make the learning of the dynamics tractable and then incorporate curve evolution into the state estimates to recursively estimate the boundaries. Experimental results are obtained on cardiac magnetic resonance images, sea surface temperature data, and soil moisture maps. Although we focus on these application areas, the underlying mathematical principles posed in the thesis are general enough that they can be applied to other applications as well. We analyze the algorithms on data of differing quality, with both high and low SNR data and also full and sparse observations.by Walter Sun.Ph.D