A Probabilistic Interpretation of the Saliency Network

The calculation of salient structures is one of the early and basic ideas of perceptual organization in Computer Vision. Saliency algorithms aim to find image curves, maximizing some deterministic quality measure which grows with the length of the curve, its smoothness, and its continuity. This note proposes a modified saliency estimation mechanism, which is based on probabilistically specified grouping cues and on length estimation. In the context of the proposed method, the well-known saliency mechanism, proposed by Shaashua and Ullman [SU88], may be interpreted as a process trying to detect the curve with maximal expected length. The new characterization of saliency using probabilistic cues is conceptually built on considering the curve starting at a feature point, and estimating the distribution of the length of this curve, iteratively. Different saliencies, like the expected length, may be specified as different functions of this distribution. There is no need however to actually propagate the distributions during the iterative process. The proposed saliency characterization is associated with several advantages: First, unlike previous approaches, the search for the "best group" is based on a probabilistic characterization, which may be derived and verified from typical images, rather than on pre-conceived opinion about the nature of figure subsets. Therefore, it is expected also to be more reliable. Second, the probabilistic saliency is more abstract and thus more generic than the common geometric formulations. Therefore, it lends itself to different realizations of saliencies based on different cues, in a systematic rigorous way. To demonstrate that, we created, as instances of the general approach, a saliency process which is based on grey level similarity but still preserve a similar meaning. Finally, the proposed approach gives another interpretation for the measure than makes one curve a winner, which may often be more intuitive to grasp, especially as the saliency levels has a clear meaning of say, expected curve length.

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

[2]  R. von der Heydt,et al.  A computational model of neural contour processing: figure-ground segregation and illusory contours , 1994, Proceedings of PerAc '94. From Perception to Action.

[3]  Lance R. Williams,et al.  Local Parallel Computation of Stochastic Completion Fields , 1997, Neural Computation.

[4]  Michael Lindenbaum,et al.  Ground from figure discrimination , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

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

[6]  Rüdiger von der Heydt,et al.  A computational model of neural contour processing: Figure-ground segregation and illusory contours , 1993, 1993 (4th) International Conference on Computer Vision.

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

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

[9]  M. Wertheimer Laws of organization in perceptual forms. , 1938 .

[10]  Kim L. Boyer,et al.  Quantitative Measures of Change Based on Feature Organization: Eigenvalues and Eigenvectors , 1998, Comput. Vis. Image Underst..

[11]  Lance R. Williams,et al.  Local Parallel Computation of Stochastic Completion Fields , 1996, Neural Computation.

[12]  David G. Lowe,et al.  Perceptual Organization and Visual Recognition , 2012 .

[13]  H. Barlow Vision: A computational investigation into the human representation and processing of visual information: David Marr. San Francisco: W. H. Freeman, 1982. pp. xvi + 397 , 1983 .

[14]  Michael Lindenbaum,et al.  A Generic Grouping Algorithm and Its Quantitative Analysis , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  David Marr,et al.  VISION A Computational Investigation into the Human Representation and Processing of Visual Information , 2009 .