Graph cuts in segmentation of a left ventricle from MRI data

MaRDI QIDQ4648121zbMATH OpenFDO

Authors Jakub Loucký, Tomáš Oberhuber

Publication date 8 November 2012

Full work available at URL http://gcoe-mi.jp/english/temp/publish/a46eafff773c4444d41158f0b60bddc4.pdf

zbMATH Keywords

Ford-Fulkerson algorithmgraph cutsimage segmentation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computing methodologies for image processing (68U10) Biomedical imaging and signal processing (92C55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• A simple topology preserving max-flow algorithm for graph cut based image segmentation
• scientific article; zbMATH DE number 1849127
• scientific article; zbMATH DE number 2062604
• Reduced graphs for min-cut/max-flow approaches in image segmentation
• Efficient graph-based image segmentation

Cited in

(4)

• Application of graph partitioning to image segmentation
• A simple topology preserving max-flow algorithm for graph cut based image segmentation
• scientific article; zbMATH DE number 2043691 (Why is no real title available?)
• Analysis of biological data by graph theory approach searching of iron in biological cells

This page was built for publication: Graph cuts in segmentation of a left ventricle from MRI data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648121)