Completion Energies and Scale.

Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel
IEEE Transactions on Pattern Analysis and Machine Intelligence (Impact Factor: 4.8). 01/2000; 22:1117-1131. DOI: 10.1109/34.879792
Source: DBLP

ABSTRACT Abstract 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 log where is the number of pixels in the image, using multigrid methods.

  • [Show abstract] [Hide abstract]
    ABSTRACT: This report will present a summary of views presented during a discussion at the 1999 Workshop on Perceptual Organization in Computer Vision. Our goal is to present diverse views, informally expressed on principles and algorithms of perceptual organization. Naturally, such a discussion must be somewhat limited both by the time available and by the specific set of researchers who could be present. Still, we hope to describe some interesting ideas expressed and to note the number of areas of apparent consensus among a fairly broad group. In particular, we will describe views on the state of the art in perceptual grouping, and what seem to be key open questions and promising directions for addressing them.
  • [Show abstract] [Hide abstract]
    ABSTRACT: This report describes some experiments with algorithms that determine depth from occluding edges as well as performing completion. First Gaussian diusion is applied to the problem, with continuous depth eects as result. After that several algorithms are developed for modal and amodal completion from T-junctions and line ends, and the resulting contours are sorted in depth. The problem of completion is approached by extracting features and building graphs from these, resulting in a number of...
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Recent developments in the eld of image manipulation and restoration have seen the merging of techniques that reconstruct texture and those that reconstruct structure to create algorithms that are more effective for a far greater variety of image completion scenarios. Few of these innovative and useful algorithms are available to ordinary users however. We describe the implemention of a version of one such technique, the fragment-based image completion algorithm developed by Drori, Cohen-Or and Yeshuran (2003) as a plug-in for the GIMP making it freely accessible and easy to use in conjunction with other image manipulation tools. Results thus far are comparable with those of the original authors.

Full-text (3 Sources)

Available from
May 22, 2014