Completion energies and scale

The detection of smooth curves in images and their completion over gaps are two important problems in perceptual grouping. In this paper we examine the notion of completion energy and introduce a fast method to compute the most likely completions in images. Specifically we develop two novel analytic approximations to the curve of least energy. In addition, we introduce a fast numerical method to compute the curve of least energy, and show that our approximations are obtained at early stages of this numerical computation. We then use our newly developed energies to find the most likely completions in images through a generalized summation of induction fields. Since in practice edge elements are obtained by applying filters of certain widths and lengths to the image, we adjust our computation to take these parameters into account. Finally, we show that, due to the smoothness of the kernel of summation, the process of summing induction fields can be run in time that is linear in the number of different edge elements in the image, or in O(N log N) where N is the number of pixels in the image, using multigrid methods.

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

[2]  Alfred M. Bruckstein,et al.  On Minimal Energy Trajectories , 1990, Comput. Vis. Graph. Image Process..

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

[4]  W. Eric L. Grimson,et al.  Shape Encoding and Subjective Contours , 1980, AAAI.

[5]  Isaac Weiss.  3-D Shape Representation by Contours , 1985, IJCAI.

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

[7]  C. Gilbert,et al.  Improvement in visual sensitivity by changes in local context: Parallel studies in human observers and in V1 of alert monkeys , 1995, Neuron.

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

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

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

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

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

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

[14]  A. Brandt.  Multilevel computations of integral transforms and particle interactions with oscillatory kernels , 1991 .