A Comparison of Measures for Detecting Natural Shapes in Cluttered Backgrounds

We propose a new measure of perceptual saliency and quantitatively compare its ability to detect natural shapes in cluttered backgrounds to five previously proposed measures. As defined in the new measure, the saliency of an edge is the fraction of closed random walks which contain that edge. The transition probability matrix defining the random walk between edges is based on a distribution of natural shapes modeled by a stochastic motion. Each of the saliency measures in our comparison is a function of a set of affinity values assigned to pairs of edges. Although the authors of each measure define the affinity between a pair of edges somewhat differently, all incorporate the Gestalt principles of good-continuation and proximity in some form. In order to make the comparison meaningful, we use a single definition of affinity and focus instead on the performance of the different functions for combining affinity values. The primary performance criterion is accuracy. We compute false-positive rates in classifying edges as signal or noise for a large set of test figures. In almost every case, the new measure significantly outperforms previous measures.

[1]  David J. Field,et al.  Contour integration by the human visual system: Evidence for a local “association field” , 1993, Vision Research.

[2]  Lance R. Williams,et al.  Analytic solution of stochastic completion fields , 1995, Biological Cybernetics.

[3]  Berthold K. P. Horn The Curve of Least Energy , 1983, TOMS.

[4]  Radu Horaud,et al.  Figure-Ground Discrimination: A Combinatorial Optimization Approach , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Kim L. Boyer,et al.  Quantitative measures of change based on feature organization: eigenvalues and eigenvectors , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

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

[8]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  Pietro Perona,et al.  A Factorization Approach to Grouping , 1998, ECCV.

[10]  Ronen Basri,et al.  Completion energies and scale , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[11]  Ronen Basri,et al.  Extracting Salient Curves from Images: An Analysis of the Saliency Network , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[12]  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.

[13]  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.

[14]  Lance R. Williams,et al.  Computing Stochastic Completion Fields in Linear-Time Using a Resolution Pyramid , 1997, Comput. Vis. Image Underst..

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

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

[17]  S. Grossberg,et al.  Neural dynamics of form perception: boundary completion, illusory figures, and neon color spreading. , 1985 .