Graph Cuts Framework for Kidney Segmentation with Prior Shape Constraints
- 1 January 2007
- book chapter
- Published by Springer Nature
- Vol. 10, 384-392
Abstract
We propose a novel kidney segmentation approach based on the graph cuts technique. The proposed approach depends on both image appearance and shape information. Shape information is gathered from a set of training shapes. Then we estimate the shape variations using a new distance probabilistic model which approximates the marginal densities of the kidney and its background in the variability region using a Poisson distribution refined by positive and negative Gaussian components. To segment a kidney slice, we align it with the training slices so we can use the distance probabilistic model. Then its gray level is approximated with a LCG with sign-alternate components. The spatial interaction between the neighboring pixels is identified using a new analytical approach. Finally, we formulate a new energy function using both image appearance models and shape constraints. This function is globally minimized using s/t graph cuts to get the optimal segmentation. Experimental results show that the proposed technique gives promising results compared to others without shape constraints.Keywords
This publication has 7 references indexed in Scilit:
- Precise segmentation of multimodal imagesIEEE Transactions on Image Processing, 2006
- An experimental comparison of min-cut/max- flow algorithms for energy minimization in visionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- A level set approach for shape-driven segmentation and tracking of the left ventricleIEEE Transactions on Medical Imaging, 2003
- Shape Priors for Level Set Representations2002
- Segmentation of Dynamic N-D Data Sets via Graph Cuts Using Markov Models2001
- MR renography by semiautomated image analysis: Performance in renal transplant recipientsJournal of Magnetic Resonance Imaging, 2001
- Alignment by Maximization of Mutual Information1995