Parameter networks: towards a theory of low-level vision

  • Authors:
  • D. H. Ballard

  • Affiliations:
  • Computer Science Department, University of Rochester, Rochester, NY

  • Venue:
  • IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
  • Year:
  • 1981

Quantified Score

Hi-index 0.00

Visualization

Abstract

One of the most fundamental problems in vision is segmentation; the way in which parts of an image are perceived as a meaningful whole. Recent work has shown how to calculate images of physical parameters from raw intensity data. Such images are known as intrinsic images, and examples are images of velocity (optical flow), surface orientation, occluding contour, and disparity. While intrinsic images are not segmented, they are distinctly easier to segment than the original intensity image. Segments can be detected by a general Hough transform technique. Networks of feature parameters are appended to the intrinsic image organization. Then the intrinsic image points are mapped into these networks. This mapping will be many-to-one onto parameter values that represent segments. This basic method is extended into a general representation and control technique with the addition of three main ideas: abstraction levels; sequential search; and tight counting These ideas are a nucleus of a connectionist theory of low 'eve and m'ermediate-level vision. This theory explains segmentation in terms of massively parallel cooperative computation among intrinsic images and a set of parameter spaces at different levels of abstraction.