An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal graph based segmentation using flow lines with application to airway wall segmentation
IPMI'11 Proceedings of the 22nd international conference on Information processing in medical imaging
Hi-index | 0.00 |
We present a three-dimensional coupled surface graph cut algorithm for carotid wall segmentation from Magnetic Resonance Imaging (MRI). Using cost functions that highlight both inner and outer vessel wall borders, the method combines the search for both borders into a single graph cut optimization. Our approach requires little user interaction and can robustly segment the carotid artery bifurcation. Experiments on 32 carotid arteries from 16 patients show good agreement between manual segmentation performed by an expert and our method. The mean relative area of overlap is more than 85% for both lumen and outer vessel wall. In addition, differences in measured wall thickness with respect to the manual annotations were smaller than the in-plane pixel size.