Markov Random Fields with Efficient Approximations
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Computing Geodesics and Minimal Surfaces via Graph Cuts
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Graph Cuts and Efficient N-D Image Segmentation
International Journal of Computer Vision
Dynamic Graph Cuts for Efficient Inference in Markov Random Fields
IEEE Transactions on Pattern Analysis and Machine Intelligence
FIMH'07 Proceedings of the 4th international conference on Functional imaging and modeling of the heart
MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part I
IPMI'11 Proceedings of the 22nd international conference on Information processing in medical imaging
Hi-index | 0.00 |
This paper presents a novel method for segmenting the coronary lumen in CTA data. The method is based on graph cuts, with edge-weights depending on the intensity of the centerline, and robust kernel regression. A quantitative evaluation in 28 coronary arteries from 12 patients is performed by comparing the semi-automatic segmentations to manual annotations. This evaluation showed that the method was able to segment the coronary arteries with high accuracy, compared to manually annotated segmentations, which is reflected in a Dice coefficient of 0.85 and average symmetric surface distance of 0.22 mm.