Tracking Endocardial Boundary and Motion via Graph Cut Distribution Matching and Multiple Model Filtering
نویسندگان
چکیده
Tracking the left ventricular (LV) endocardial boundary and motion from cardiac magnetic resonance (MR) images is difficult because of low contrast and photometric similarities between the heart wall and papillary muscles within the LV cavity. This study investigates the problem via Graph Cut Distribution Matching (GCDM) and Interacting Multiple Model (IMM) smoothing. GCDM yields initial frame segmentations by keeping the same photometric/geometric distribution of the cavity over cardiac cycles, whereas IMM constrains the results with prior knowledge of temporal consistency. Incorporation of prior knowledge that characterizes the dynamic behavior of the LV enhances the accuracy of both motion estimation and segmentation. However, accurately characterizing the behavior using a single Markovian model is not sufficient due to substantial variability in heart motion. Moreover, dynamic behaviors of normal and abnormal hearts are very different. This study introduces multiple models, each corresponding to a different phase of the LV dynamics. The IMM, an effective estimation algorithm for Markovian switching systems, yields the state estimate of endocardial points as well as the model probability that indicates the most-likely model. The proposed method is evaluated quantitatively by comparison with independent manual segmentations over 2280 images acquired from 20 subjects, which demonstrated competitive results in comparisons with a recent method.
منابع مشابه
Multiple Target Tracking With a 2-D Radar Using the JPDAF Algorithm and Combined Motion Model
Multiple target tracking (MTT) is taken into account as one of the most important topics in tracking targets with radars. In this paper, the MTT problem is used for estimating the position of multiple targets when a 2-D radar is employed to gather measurements. To do so, the Joint Probabilistic Data Association Filter (JPDAF) approach is applied to tracking the position of multiple targets. To ...
متن کاملSegmentation-Based Motion with Occlusions Using Graph-Cut Optimization
We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segmentation and robust global optimization via graph-cuts. In the first step, each segment (extracted by colour segmentation) is assigned to an affine motion model from a set of sparse correspondences. Using a layered model, we the...
متن کاملA Study on Human Gaze Detection Based on 3D Eye Model
Robust fake iris detection p. 10 A study on fast Iris restoration based on focus checking p. 19 A spatio-temporal metric for dynamic mesh comparison p. 29 Facetoface : an isometric model for facial animation p. 38 Matching two-dimensional articulated shapes using generalized multidimensional scaling p. 48 Further developments in geometrical algorithms for ear biometrics p. 58 Composition of com...
متن کاملA Novel Tracking Framework Using Kalman Filtering and Elastic Matching
A novel region-based multiple object tracking framework based on Kalman filtering and elastic matching is proposed. The proposed Kalman filtering-elastic matching model is general in two significant ways. First, it is suitable for tracking of both, rigid and elastic objects. Second, it is suitable for tracking using both, fixed cameras and moving cameras since the method does not rely on backgr...
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کامل