Interactive Graph Cut Based Segmentation with Shape Priors
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Graph Cuts and Efficient N-D Image Segmentation
International Journal of Computer Vision
Image-Segmentation Evaluation From the Perspective of Salient Object Extraction
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Star Shape Prior for Graph-Cut Image Segmentation
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
Supervised Nonparametric Image Parcellation
MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part II
Graph cuts framework for kidney segmentation with prior shape constraints
MICCAI'07 Proceedings of the 10th international conference on Medical image computing and computer-assisted intervention - Volume Part I
Non-parametric iterative model constraint graph min-cut for automatic kidney segmentation
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part III
Non-invasive image-based approach for early detection of acute renal rejection
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part I
3D Graph cut with new edge weights for cerebral white matter segmentation
Pattern Recognition Letters
Hi-index | 0.10 |
Kidney segmentation from abdominal MRI data is used as an effective and accurate indicator for renal function in many clinical situations. The goal of this research is to accurately segment kidney from very low contrast MRI data. The present problem becomes challenging mainly due to poor contrast, high noise and partial volume effects introduced during the scanning process. In this paper, we propose a novel kidney segmentation algorithm using graph cuts and pixel connectivity. A connectivity term is introduced in the energy function of the standard graph cut via pixel labeling. Each pixel is assigned a different label based on its probabilities to belong to two different segmentation classes and probabilities of its neighbors to belong to these segmentation classes. The labeling process is formulated according to Dijkstra's shortest path algorithm. Experimental results yield a (mean+/-s.d.) Dice coefficient value of (98.60+/-0.52)% on 25 datasets.