Conference Paper

Reconstruction of 3D Dense Cardiac Motion From Tagged MR Sequences.

Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA
DOI: 10.1109/ISBI.2004.1398679 Conference: Proceedings of the 2004 IEEE International Symposium on Biomedical Imaging: From Nano to Macro, Arlington, VA, USA, 15-18 April 2004
Source: IEEE Xplore


This paper develops an energy minimization algorithm to reconstruct the 3D motion of transplanted hearts of small animals (rats) from tagged magnetic resonance (MR) sequences. We describe the heart by a layered aggregate of thin oriented elastic fibers. We use the orientation of myocardial fibers to develop a local dense motion of the heart. This dense model is fit to the tagged MRI data by minimizing an energy functional with two terms: the first term is the external energy, derived from matching the image intensities on the fibers across two consecutive frames; the second term is the fibers' internal energy, derived from biomechanics analysis. This paper illustrates the application of the approach to a set of cardiac MR sequences containing four slices of a transplanted rat heart.

Download full-text


Available from: Jose M F Moura
  • Source
    • "However, full reconstruction of a 3D scene requires knowledge of depth of every object point in a 3D scene. To obtain a dense depth map, one needs to solve the problem of dense matching/correspondence, i.e., alignment of every pixel between two adjacent input images [15][16][17]. A traditional solution to the dense matching problem is called epi-line searching. "
    [Show abstract] [Hide abstract]
    ABSTRACT: D reconstruction is a major problem in computer vision. This paper considers the problem of reconstructing 3D structures, given a 2D video sequence. This problem is challenging since it is difficult to identify the trajectory of each object point/pixel over time. Traditional stereo D reconstruction methods and volumetric D reconstruction methods suffer from the blank wall problem, and the estimated dense depth map is not smooth, resulting in loss of actual geometric structures such as planes. To retain geometric structures embedded in the 3D scene, this paper proposes a novel surface fitting approach for 3D dense reconstruction. Specifically, we develop an expanded deterministic annealing algorithm to decompose D point cloud to multiple geometric structures, and estimate the parameters of each geometric structure. In this paper, we only consider plane structure, but our methodology can be extended to other parametric geometric structures such as spheres, cylinders, and cones. The experimental results show that the new approach is able to segment D point cloud into appropriate geometric structures and generate accurate 3D dense depth map.
    Preview · Article · Jul 2011 · Journal of Visual Communication and Image Representation
  • Source
    • "With the advent of cardiac magnetic resonance tagging technology , we can estimate dense motion maps of the left ventricle [1]. That is, each pixel of the myocardium is assigned a vector indicating the moving direction and magnitude toward the next cardiac phase. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Magnetic resonance (MR) tagging technology can assist us in determining the motions of the myocardial pixels in a sequence of MR images. This paper presents a semi-supervised algorithm that processes these motion maps and classifies automatically myocardial dysfunctional motions. In distinction with other methods, our algorithm requires that only a few normal motions are labeled a priori. This is significant because, while normal motions can be confidently labeled by a human expert, abnormal motions are very difficult to label with high reliability by an operator. We use a graph to capture the motion map of the left ventricle. The normalized weighted adjacency matrix of the graph is interpreted as a stochastic matrix. Performing random walks, or diffusion, on the graph determines how similar myocardial motions are. Similar motions on the graph are represented by the diffusion maps framework as closer vectors in a Euclidean space. In the Euclidean space, we adopt eigen-analysis on a small portion of labeled normal motions. The analysis leads to a hyperelliptic surface that classifies the remaining cardiac motions as normal or dysfunctional.
    Full-text · Conference Paper · Sep 2007
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper develops an algorithm to detect abnormalities of small animals' transplanted hearts in MRI, at early stage of rejection when the hearts do not display prominent abnormal features. Existing detection methods require experts to manually identify these abnormal regions. This task is time consuming, and the detection criteria are operator dependent. We present a semi-automatic approach that needs experts to label only a small portion of the motion maps. Our algorithm begins with representing the left ventricular motions by a weighted graph that approximates the manifold where these motions lie. We compute the eigendecomposition of the Laplacian of the graph and use these as basis functions to represent the classifier. The experimental results with synthetic data and real cardiac MRI data demonstrate the application of our classifier to early detection of heart rejection
    Full-text · Conference Paper · Apr 2006
Show more