Graph Cut Segmentation Using a Constrained Statistical Model with Non-linear and Sparse Shape Optimization

Tahir Majeed, Ketut Fundana, Silja Kiriyanthan, Jörg Beinemann, Philippe C. Cattin

Abstract: This paper proposes a novel segmentation method combining shape knowledge obtained from a constrained Statistical Model (SM) into the well known Markov Random Field (MRF) segmentation framework. The employed SM based on Probabilistic Principal Component Analysis (PPCA) allows to compute local information about the remaining variance i.e. uncertainty about the correct segmentation boundary. This knowledge about the local segmentation uncertainty is then used to construct a prior with a non-linear shape update mechanism, where a high cost is incurred in locations with little uncertainty and a low cost for shifting the segmentation boundary in locations with high uncertainty.

External IDs:dblp:conf/miccai/MajeedFKBC12