scispace - formally typeset
Book ChapterDOI

Computing Stereopsis Using Feature Point Contour Matching

Reads0
Chats0
TLDR
A version of the Marr-Poggio-Grimson algorithm is presented that is characterized as matching extended contours of feature points obtained from a range of different spatial frequency tuned channels, and is illustrated on a series of natural images.
Abstract
Computational models of the human stereo system can provide insight into general information processing constraints that apply to any stereo system, either artificial or biological. In 1977, Marr and Poggio proposed one such computational model, that was characterized as matching certain feature points in difference-of-Gaussian filtered images, and using the information obtained by matching coarser resolution representations to restrict the search space for matching finer resolution representations. An implementation of the algorithm and its testing on a range of images was reported in 1980. Recent computational experiments applying the algorithm to a variety of natural images, especially aerial photographs, have led to a number of modifications. In this article, we present a version of the Marr-Poggio-Grimson algorithm that embodies these modifications, and is characterized as matching extended contours of feature points obtained from a range of different spatial frequency tuned channels. We illustrate its performance on a series of natural images.

read more

Citations
More filters
Journal ArticleDOI

On optimal infinite impulse response edge detection filters

TL;DR: The authors outline the design of an optimal, computationally efficient, infinite impulse response edge detection filter, computed based on Canny's high signal to noise ratio, good localization criteria, and a criterion on the spurious response of the filter to noise.
Journal ArticleDOI

The Laplacian-of-Gaussian kernel: a formal analysis and design procedure for fast, accurate convolution and full-frame output

TL;DR: An LoG of space constant σ can be decomposed into the product of a Gaussian and an LoG mask, and the resulting LoG has space Constant σ1.
Journal ArticleDOI

Picture processing: 1986

TL;DR: A bibliography of about 1450 references related to the computer processing of pictorial information, arranged by subject matter is presented, to provide a convenient compendium of references.
Journal ArticleDOI

Dynamic edge warping: an experimental system for recovering disparity maps in weakly constrained systems

TL;DR: Dynamic edge warping (DEW) is presented, a technique for recovering reasonably accurate disparity maps from uncalibrated stereo image pairs, and substitutes high-level information and constraints for precise geometric knowledge in driving and constraining the early correspondence process.

Serializing Parallel Programs by Removing Redundant Computation

TL;DR: This thesis introduces and evaluates three methods for automatically transforming a parallel algorithm into a less parallel one that takes advantage of only the parallelism available at run time, and combines the ease of writing, reading, debugging, and detecting parallelism in high-level programs.
References
More filters
Journal ArticleDOI

Theory of Edge Detection

TL;DR: The theory of edge detection explains several basic psychophysical findings, and the operation of forming oriented zero-crossing segments from the output of centre-surround ∇2G filters acting on the image forms the basis for a physiological model of simple cells.
Book

Obstacle avoidance and navigation in the real world by a seeing robot rover

TL;DR: The Stanford AI Lab cart as discussed by the authors is a card-table sized mobile robot controlled remotely through a radio link, and equipped with a TV camera and transmitter equipped with an onboard TV system.

Finding Edges and Lines in Images

John Canny
TL;DR: This thesis is an attempt to formulate a set of edge detection criteria that capture as directly as possible the desirable properties of an edge operator.
Journal ArticleDOI

Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming

TL;DR: This paper presents a stereo matching algorithm using the dynamic programming technique that uses edge-delimited intervals as elements to be matched, and employs the above mentioned two searches: one is inter-scanline search for possible correspondences of connected edges in right and left images and the other is intra-scanlines search for correspondence of edge-Delimited interval on each scanline pair.
Journal ArticleDOI

Disparity Analysis of Images

TL;DR: An algorithm for matching images of real world scenes is presented, which quickly converges to good estimates of disparity, which reflect the spatial organization of the scene.
Related Papers (5)