DocumentCode
2053897
Title
Graph Cut Segmentation with Nonlinear Shape Priors
Author
Malcolm, James ; Rathi, Yogesh ; Tannenbaum, Allen
Author_Institution
Georgia Inst. of Technol., Atlanta
Volume
4
fYear
2007
fDate
Sept. 16 2007-Oct. 19 2007
Abstract
Graph cut image segmentation with intensity information alone is prone to fail for objects with weak edges, in clutter, or under occlusion. Existing methods to incorporate shape are often too restrictive for highly varied shapes, use a single fixed shape which may be prone to misalignment, or are computationally intensive. In this note we show how highly variable nonlinear shape priors learned from training sets can be added to existing iterative graph cut methods for accurate and efficient segmentation of such objects. Using kernel principle component analysis, we demonstrate how a shape projection pre-image can induce an iteratively refined shape prior in a Bayesian manner. Examples of natural imagery show that both single-pass and iterative segmentation fail without such shape information.
Keywords
graph theory; image segmentation; iterative methods; principal component analysis; graph cut image segmentation; intensity information; iterative graph cut method; kernel principle component analysis; nonlinear shape priors; shape projection preimage; Bayesian methods; Histograms; Image segmentation; Iterative algorithms; Iterative methods; Joining processes; Kernel; Pixel; Principal component analysis; Shape; Image segmentation; graph cuts; kernel PCA; shape priors;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing, 2007. ICIP 2007. IEEE International Conference on
Conference_Location
San Antonio, TX
ISSN
1522-4880
Print_ISBN
978-1-4244-1437-6
Electronic_ISBN
1522-4880
Type
conf
DOI
10.1109/ICIP.2007.4380030
Filename
4380030
Link To Document