Globally optimal regions and boundaries

We propose a new form of energy functional for the segmentation of regions in images, and an efficient method for finding its global optima. The energy can have contributions from both the region and its boundary, thus combining the best features of region- and boundary-based approaches to segmentation. By transforming the region energy into a boundary energy, we can treat both contributions on an equal footing, and solve the global optimization problem as a minimum mean weight cycle problem on a directed graph. The simple, polynomial-time algorithm requires no initialization and is highly parallelizable.

[1]  G. Dantzig,et al.  FINDING A CYCLE IN A GRAPH WITH MINIMUM COST TO TIME RATIO WITH APPLICATION TO A SHIP ROUTING PROBLEM , 1966 .

[2]  Ugo Montanari,et al.  On the optimal detection of curves in noisy pictures , 1971, CACM.

[3]  Richard M. Karp,et al.  A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[4]  G. Kanizsa,et al.  Organization in Vision: Essays on Gestalt Perception , 1979 .

[5]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[6]  Reconstruction , 1980, The Lancet.

[7]  Andrew Blake,et al.  Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.

[8]  Terry E. Weymouth,et al.  Using Dynamic Programming For Minimizing The Energy Of Active Contours In The Presence Of Hard Constraints , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[9]  Shimon Ullman,et al.  Structural Saliency: The Detection Of Globally Salient Structures using A Locally Connected Network , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[10]  Steven W. Zucker,et al.  Radial Projection: An Efficient Update Rule for Relaxation Labeling , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Steven W. Zucker,et al.  Trace Inference, Curvature Consistency, and Curve Detection , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Gérard G. Medioni,et al.  Inferring global perceptual contours from local features , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[13]  James Elder,et al.  The effect of contour closure on the rapid discrimination of two-dimensional shapes , 1993, Vision Research.

[14]  I Kovács,et al.  A closed curve is much more than an incomplete one: effect of closure in figure-ground segmentation. , 1993, Proceedings of the National Academy of Sciences of the United States of America.

[15]  James Elder,et al.  A measure of closure , 1994, Vision Research.

[16]  K. Thornber,et al.  Analytic solution of stochastic completion fields , 1995, Proceedings of International Symposium on Computer Vision - ISCV.

[17]  Alok Gupta,et al.  Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Steven W. Zucker,et al.  Computing Contour Closure , 1996, ECCV.

[19]  Ingemar J. Cox,et al.  "Ratio regions": a technique for image segmentation , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[20]  Lance R. Williams,et al.  Stochastic Completion Fields: A Neural Model of Illusory Contour Shape and Salience , 1997, Neural Computation.

[21]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[22]  Lance R. Williams,et al.  A Comparison of Measures for Detecting Natural Shapes in Cluttered Backgrounds , 1998, ECCV.

[23]  Jitendra Malik,et al.  Contour Continuity in Region Based Image Segmentation , 1998, ECCV.