Local Parallel Computation of Stochastic Completion Fields

We describe a local parallel method for computing the stochastic completion field introduced in the previous article (Williams and Jacobs, 1997). The stochastic completion field represents the likelihood that a completion joining two contour fragments passes through any given position and orientation in the image plane. It is based on the assumption that the prior probability distribution of completion shape can be modeled as a random walk in a lattice of discrete positions and orientations. The local parallel method can be interpreted as a stable finite difference scheme for solving the underlying Fokker-Planck equation identified by Mumford (1994). The resulting algorithm is significantly faster than the previously employed method, which relied on convolution with large-kernel filters computed by Monte Carlo simulation. The complexity of the new method is O (n3m), while that of the previous algorithm was O(n4m2 (for an n n image with m discrete orientations). Perhaps most significant, the use of a local method allows us to model the probability distribution of completion shape using stochastic processes that are neither homogeneous nor isotropic. For example, it is possible to modulate particle decay rate by a directional function of local image brightnesses (i.e., anisotropic decay). The effect is that illusory contours can be made to respect the local image brightness structure. Finally, we note that the new method is more plausible as a neural model since (1) unlike the previous method, it can be computed in a sparse, locally connected network, and (2) the network dynamics are consistent with psychophysical measurements of the time course of illusory contour formation.

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

[2]  Ramesh C. Jain,et al.  Using Dynamic Programming for Solving Variational Problems in Vision , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Gerald Sommer,et al.  Junction classification by multiple orientation detection , 1994, ECCV.

[4]  Allen R. Hanson,et al.  Perceptual completion of occluded surfaces , 1996, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[5]  Florentin Wörgötter,et al.  Design Principles of Columnar Organization in Visual Cortex , 1994, Neural Computation.

[6]  R. von der Heydt,et al.  Illusory contours and cortical neuron responses. , 1984, Science.

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

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

[9]  Mark Nitzberg,et al.  Nonlinear Image Filtering with Edge and Corner Enhancement , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

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

[12]  R. Ghez,et al.  A Primer of Diffusion Problems , 1988 .

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

[14]  Tony Lindeberg,et al.  Scale-Space Theory in Computer Vision , 1993, Lecture Notes in Computer Science.

[15]  V. Ramachandran,et al.  On the perception of illusory contours , 1994, Vision Research.

[16]  Joachim Weikert,et al.  Multiscale Texture Enhancement , 1995, CAIP.

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

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

[19]  P. Kellman,et al.  A theory of visual interpolation in object perception , 1991, Cognitive Psychology.

[20]  Jaakko Hintikka,et al.  On the Logic of Perception , 1969 .

[21]  Alberto Martelli,et al.  An application of heuristic search methods to edge and contour detection , 1976, CACM.

[22]  NitzbergMark,et al.  Nonlinear Image Filtering with Edge and Corner Enhancement , 1992 .

[23]  Jitendra Malik,et al.  Scale-Space and Edge Detection Using Anisotropic Diffusion , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

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

[25]  David Mumford,et al.  Filtering, Segmentation and Depth , 1993, Lecture Notes in Computer Science.

[26]  Eero P. Simoncelli,et al.  Steerable wedge filters , 1995, Proceedings of IEEE International Conference on Computer Vision.

[27]  Stephen Grossberg,et al.  The Role of Illusory Contours in Visual Segmentation , 1987 .

[28]  I. Rock,et al.  Illusory Contours as the Solution to a Problem , 1979, Perception.

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

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