Search PubMed⌕ Search

Biomedical subjects

T Poggio

Publications and source records attributed to T Poggio.

At least 19 recordsLinked to original sources
PubMed1992

Fast perceptual learning in visual hyperacuity.

In many different spatial discrimination tasks, such as in determining the sign of the offset in a vernier stimulus, the human visual system exhibits hyperacuity by evaluating spatial relations with the precision of a fraction of a photoreceptor's diameter. It is proposed that this impressive performance depends in part on a fast learning process that uses relatively few examples and that occurs at an early processing stage in the visual pathway. This hypothesis is given support by the demonstration that it is possible to synthesize, from a small number of examples of a given task, a simple network that attains the required performance level. Psychophysical experiments agree with some of the key predictions of the model. In particular, fast stimulus-specific learning is found to take place in the human visual system, and this learning does not transfer between two slightly different hyperacuity tasks.

Algorithms↗
PubMed1991

Models of object recognition.

Progress in the understanding of visual recognition in the past year has been signified by the demonstration of computational feasibility of and psychophysical support for two-dimensional view-interpolation methods.

Animals↗
PubMed1990

A network that learns to recognize three-dimensional objects.

The visual recognition of three-dimensional (3-D) objects on the basis of their shape poses at least two difficult problems. First, there is the problem of variable illumination, which can be addressed by working with relatively stable features such as intensity edges rather than the raw intensity images. Second, there is the problem of the initially unknown pose of the object relative to the viewer. In one approach to this problem, a hypothesis is first made about the viewpoint, then the appearance of a model object from such a viewpoint is computed and compared with the actual image. Such recognition schemes generally employ 3-D models of objects, but the automatic learning of 3-D models is itself a difficult problem. To address this problem in computational vision, we have developed a scheme, based on the theory of approximation of multivariate functions, that learns from a small set of perspective views a function mapping any viewpoint to a standard view. A network equivalent to this scheme will thus 'recognize' the object on which it was trained from any viewpoint.

Artificial Intelligence↗
PubMed1989

A parallel algorithm for real-time computation of optical flow.

The precise management of two-dimensional field of velocities from time-varying two-dimensional images is impossible in general. It is, however, possible to compute suitable 'optical flows' that are qualitatively similar to the velocity field in most cases. We describe a simple, parallel algorithm that computes an optical flow from sequences of real images, which is consistent with human psychophysics and suggests plausible physiological models. In particular, our algorithm runs on a Connection Machine supercomputer in close-to-real time. It shows several of the same 'illusions' that are perceived by humans. A natural physiological implementation of the model is consistent with data from cortical areas V1 and MT.

Algorithms↗
PubMed1988

Parallel integration of vision modules.

Computer algorithms have been developed for several early vision processes, such as edge detection, stereopsis, motion, texture, and color, that give separate cues to the distance from the viewer of three-dimensional surfaces, their shape, and their material properties. Not surprisingly, biological vision systems still greatly outperform computer vision programs. One of the keys to the reliability, flexibility, and robustness of biological vision systems is their ability to integrate several visual cues. A computational technique for integrating different visual cues has now been developed and implemented with encouraging results on a parallel supercomputer.

Algorithms↗
PubMed1988

Computing texture boundaries from images.

Recent computational and psychological theories of human texture vision assert that texture discrimination is based on first-order differences in geometric and luminance attributes of texture elements, called 'textons'. Significant differences in the density, orientation, size, or contrast of line segments or other small features in an image have been shown to cause immediate perception of texture boundaries. However, the psychological theories, which are based on the perception of synthetic images composed of lines and symbols, neglect two important issues. First, how can textons be computed from grey-level images of natural scenes? And second, how, exactly, can texture boundaries be found? Our analysis of these two issues has led to an algorithm that is fully implemented and which successfully detects boundaries in natural images. We propose that blobs computed by a centre-surround operator are useful as texture elements, and that a simple non-parametric statistic can be used to compare local distributions of blob attributes to locate texture boundaries. Although designed for natural images, our computation agrees with some psychophysical findings, in particular, those of Adelson and Bergen (described in the preceding article), which cast doubt on the hypothesis that line segment crossings or termination points are textons.

Algorithms↗
PubMed1979

A computational theory of human stereo vision.

An algorithm is proposed for solving the stereoscopic matching problem. The algorithm consists of five steps: (1) Each image is filtered at different orientations with bar masks of four sizes that increase with eccentricity; the equivalent filters are one or two octaves wide. (2) Zero-crossings in the filtered images, which roughly correspond to edges, are localized. Positions of the ends of lines and edges are also found. (3) For each mask orientation and size, matching takes place between pairs of zero-crossings or terminationss of the same sign in the two images, for a range of disparities up to about the width of the mask's central region. (4) Wide masks can control vergence movements, thus causing small masks to come into correspondence. (5) When a correspondence is achieved, it is stored in a dynamic buffer, called the 2 1/2-D sketch. It is shown that this proposal provides a theoretical framework for most existing psychophysical and neurophysiological data about stereopsis. Several critical experimental predictions are also made, for instance about the size of Panum's area under various conditions. The results of such experiments would tell us whether, for example, cooperativity is necessary for the matching process.

Humans↗
PubMed1979

Bandpass channels, zero-crossings, and early visual information processing.

Under appropriate conditions zero-crossings of a bandpass signal are very rich in information. The authors examine here the relevance of this result to the early stages of visual information processing, where zero-crossings in the output of independent spatial-frequency-tuned channels may contain sufficient information for much of the subsequent processing.

Humans↗
PubMed1978

Analysis of a cooperative stereo algorithm.

Marr and Poggio (1976) recently described a cooperative algorithm that solves the correspondence problem for stereopsis. This article uses a probabilistic technique to analyze the convergence of that algorithm, and derives the conditions governing the stability of the solution state. The actual results of applying the algorithm to random-dot stereograms are compared with the probabilistic analysis. A satisfactory mathematical analysis of the asymptotic behaviour of the algorithm is possible for a suitable choice of the parameter values and loading rules, and again the actual performance of the algorithm under these conditions is compared with the theoretical predictions. Finally, some problems raised by the analysis of this type of "cooperative" algorithm are briefly discussed.

Depth Perception↗
PubMed1977

Wiener-like system identification in physiology.

Applications of Wiener-like identification methods to biological systems have revealed several limitations of this technique. These practical limitations correspond to conceptual and mathematical problems intrinsic to this kind of identification of nonlinear systems.

Physiology↗
PubMed1976

Cooperative computation of stereo disparity.

The extraction of stereo-disparity information from two images depends upon establishing a correspondence between them. In this article we analyze the nature of the correspondence computation and derive a cooperative algorithm that implements it. We show that this algorithm successfully extracts information from random-dot stereograms, and its implications for the psychophysics and neurophysiology of the visual system are briefly discussed.

Depth Perception↗