Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
"GrabCut": interactive foreground extraction using iterated graph cuts
ACM SIGGRAPH 2004 Papers
Graph Cuts and Efficient N-D Image Segmentation
International Journal of Computer Vision
Integrated graph cuts for brain MRI segmentation
MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
Hi-index | 0.00 |
Delayed-enhancement magnetic resonance imaging (DE-MRI) is an effective technique for imaging left ventricular (LV) infarct. Existing techniques for LV infarct segmentation are primarily threshold-based making them prone to high user variability. In this work, we propose a segmentation algorithm that can learn from training images and segment based on this training model. This is implemented as a Markov random field (MRF) based energy formulation solved using graph-cuts. A good agreement was found with the Full-Width-at-Half-Maximum (FWHM) technique.