z-logo
open-access-imgOpen Access
Myocardium segmentation in Strain‐Encoded (SENC) magnetic resonance images using graph‐cuts
Author(s) -
AlAgamy Ahmed O.,
Osman Nael F.,
Fahmy Ahmed S.
Publication year - 2013
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2012.0513
Subject(s) - histogram , segmentation , cut , artificial intelligence , image segmentation , pattern recognition (psychology) , graph , computer science , computer vision , mathematics , algorithm , image (mathematics) , combinatorics
Evaluation of cardiac functions using Strain Encoded (SENC) magnetic resonance (MR) imaging is a powerful tool for imaging the deformation of left and right ventricles. However, automated analysis of SENC images is hindered due to the low signal‐to‐noise ratio SENC images. In this work, the authors propose a method to segment the left and right ventricles myocardium simultaneously in SENC‐MR short‐axis images. In addition, myocardium seed points are automatically selected using skeletonisation algorithm and used as hard constraints for the graph‐cut optimization algorithm. The method is based on a modified formulation of the graph‐cuts energy term. In the new formulation, a signal probabilistic model is used, rather than the image histogram, to capture the characteristics of the blood and tissue signals and include it in the cost function of the graph‐cuts algorithm. The method is applied to SENC datasets for 11 human subjects (five normal and six patients with known myocardial wall motion abnormality). The segmentation results of the proposed method are compared with those resulting from both manual segmentation and the conventional histogram‐based graph‐cuts segmentation algorithm. The results show that the proposed method outperforms the histogram‐based graph‐cuts algorithm especially to segment the thin structure of the right ventricle.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here