Graph cuts framework for kidney segmentation with prior shape constraints.
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.
Ali
Asem M
AM
CVIP Laboratory, University of Louisville, USA. asem@cvip.uofl.edu
Farag
Aly A
AA
Ell-Baz
Ayman S
AS
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D038524:Diffusion Magnetic Resonance Imaging / Q000379:methods*; D006801:Humans; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000379:methods*; D007668:Kidney / Q000033:anatomy & histology*; D008954:Models, Biological; D015233:Models, Statistical; D010363:Pattern Recognition, Automated / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D013382:Subtraction Technique