Optimization of Weighted Curvature for Image Segmentation

Minimization of boundary curvature is a classic regularization technique for image segmentation in the presence of noisy image data. Techniques for minimizing curvature have historically been derived from descent methods which could be trapped in a local minimum and therefore required a good initialization. Recently, combinatorial optimization techniques have been applied to the optimization of curvature which provide a solution that achieves nearly a global optimum. However, when applied to image segmentation these methods required a meaningful data term. Unfortunately, for many images, particularly medical images, it is difficult to find a meaningful data term. Therefore, we propose to remove the data term completely and instead weight the curvature locally, while still achieving a global optimum.

[1]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  D. Mumford Elastica and Computer Vision , 1994 .

[3]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[4]  Jianhong Shen,et al.  Digital inpainting based on the Mumford–Shah–Euler image model , 2002, European Journal of Applied Mathematics.

[5]  Tony F. Chan,et al.  Euler's Elastica and Curvature-Based Inpainting , 2003, SIAM J. Appl. Math..

[6]  Vladimir Kolmogorov,et al.  Minimizing Nonsubmodular Functions with Graph Cuts-A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Camille Couprie,et al.  Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[8]  Daniel Cremers,et al.  Curvature regularity for region-based image segmentation and inpainting: A linear programming relaxation , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[9]  Leo Grady,et al.  Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Daniel Cremers,et al.  Introducing Curvature into Globally Optimal Image Segmentation: Minimum Ratio Cycles on Product Graphs , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[11]  M. Stella Atkins,et al.  A Fully Automatic Random Walker Segmentation for Skin Lesions in a Supervised Setting , 2009, MICCAI.

[12]  Gareth Funka-Lea,et al.  Automatic heart isolation for CT coronary visualization using graph-cuts , 2006, 3rd IEEE International Symposium on Biomedical Imaging: Nano to Macro, 2006..

[13]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[14]  Vladimir Kolmogorov,et al.  Optimizing Binary MRFs via Extended Roof Duality , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[15]  A. Bruckstein,et al.  Epi-convergence of discrete elastica , 2001 .

[16]  Leo Grady,et al.  Fast global optimization of curvature , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[17]  Marie-Pierre Jolly,et al.  Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[18]  Rüdiger Westermann,et al.  Random Walks for Interactive Organ Segmentation in Two and Three Dimensions: Implementation and Validation , 2005, MICCAI.

[19]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[20]  Guillermo Sapiro,et al.  A Geodesic Framework for Fast Interactive Image and Video Segmentation and Matting , 2007, 2007 IEEE 11th International Conference on Computer Vision.