Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Inferring global pereeptual contours from local features
| |
|
Inferring global pereeptual contours from local features Gideon Guy1 and Gérard Medioni1  | (1) | Institute for Robotics and Intelligent Systems, University of Southern California, 90089-0273 Los Angeles, California |
Received: 24 May 1994 Accepted: 8 December 1995 Abstract We address the problem of contour inference from partial data, as obtained from state-of-the-art edge detectors. We argue that in order to obtain more pereeptually salient contours, it is necessary to impose generic constraints such as continuity and co-curvilinearity. The implementation is in the form of a convolution with a mask which encodes both the orientation and the strength of the possible continuations. We first show how the mask, called the  Extension field  is derived, then how the contributions from different sites are collected to produce a saliency map. We show that the scheme can handle a variety of input data, from dot patterns to oriented edgels in a unified manner, and demonstrate results on a variety of input stimuli. We also present a similar approach to the problem of inferring contours formed by end points. In both cases, the scheme is non-linear, non iterative, and unified in the sense that all types of input tokens are handled in the same manner. This research was supported by the Advanced Research Projects Agency of the Department of Defense and was monitored by the Air Force Office of Scientific Research under Contract No. F49620-90-C-0078, and by a NSF Grant under award No. IRI-9024369. The United States Government is authorized to reproduce and distribute reprints for governmental purposes notwithstanding any copyright notation hereon.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|