Stochastic stereo matching over scale
International Journal of Computer VisionPublished 1 May 1989
Stephen T. Barnard
Citations238
SJR quartileQ1
SJR score3.14
SNIP5.15
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A stochastic optimization approach to stereo matching is presented, which provides a dense array of disparities, eliminating the need for interpolation.
Abstract
A stochastic optimization approach to stereo matching is presented. Unlike conventional correlation matching and feature matching, the method provides a dense array of disparities, eliminating the need for interpolation. First, the stereo-matching problem is defined in terms of finding a disparity map that satisfies two competing constraints: (1) matched points should have similar image intensity, and (2) the disparity map should vary as slowly as possible. These constraints are interpreted as specifying the potential energy of a system of oscillators. Ground states are approximated by a new variant of simulated annealing, which has two important features. First, the microcanonical ensemble is simulated using a new algorithm that is more efficient and more easily implemented than the familiar Metropolis algorithm (which simulates the canonical ensemble). Secondly, it uses a hierarchical, coarse-to-fine control structure employing Gaussian or Laplacian pyramids of the stereo images. In this way, quickly computed results at low resolutions are used to initialize the system at higher resolutions.
Keywords
Computer Science
ScienceOptimization by Simulated Annealing
44,600 Citations1983Scott Kirkpatrick, C. D. Gelatt +1 more
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.
The Journal of Chemical PhysicsEquation of State Calculations by Fast Computing Machines
37,074 Citations1953N. Metropolis, Arianna W. Rosenbluth +3 more
IEEE Transactions on Pattern Analysis and Machine IntelligenceStochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
17,980 Citations1984Stuart Geman, Donald Geman
The analogy between images and statistical mechanics systems is made and the analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations, creating a highly parallel ``relaxation'' algorithm for MAP estimation.
IRE Transactions on Communications SystemsThe Laplacian Pyramid as a Compact Image Code
5,994 Citations1983P.M.S. Burt, Edward H. Adelson
A technique for image encoding in which local operators of many scales but identical shape serve as the basis functions, which tends to enhance salient image features and is well suited for many image analysis tasks as well as for image compression.
Robot Vision
3,632 Citations1986Berthold K. P. Horn
This book presents a coherent approach to the fast-moving field of computer vision, using a consistent notation based on a detailed understanding of the image formation process, and will provide a useful and current reference for professionals working in the fields of machine vision, image processing, and pattern recognition.
Journal of Optimization Theory and ApplicationsThermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
3,357 Citations1985V. Černý
It is conjecture that the analogy with thermodynamics can offer a new insight into optimization problems and can suggest efficient algorithms for solving them.
Mathematics and Computers in SimulationSimulated annealing: theory and applications.
3,005 Citations1988
The American Journal of PsychologyFoundations of Cyclopean Perception
2,414 Citations1973Whitman Richards, Béla Julesz
Simulated Annealing: Theory and Applications
2,372 Citations1987Peter J. M. van Laarhoven, Emile Aarts
Performance of the simulated annealing algorithm and the relation with statistical physics and asymptotic convergence results are presented.
NatureComputational vision and regularization theory
1,414 Citations1985Tomaso Poggio, Vincent Torre +1 more
Descriptions of physical properties of visible surfaces, such as their distance and the presence of edges, must be recovered from the primary image data and algorithms and parallel analog circuits that can solve ‘ill-posed problems’ and which are suggestive of neural equivalents in the brain are proposed.
ScienceCooperative Computation of Stereo Disparity
1,380 Citations1976David Marr, Tomaso Poggio
It is shown 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.
Physical Review LettersMicrocanonical Monte Carlo Simulation
570 Citations1983Michael Creutz
A new algorithm for the simulation of statistical systems that produces a random walk through configurations of a constant total energy and is applicable to systems of both discrete and continuous variables.
IEEE Transactions on Pattern Analysis and Machine IntelligenceImage Analysis Using Multigrid Relaxation Methods
370 Citations1986Demetri Terzopoulos
This paper develops multiresolution iterative algorithms for computing lightness, shape-from-shading, and optical flow and examines the efficiency of these algorithms using synthetic image inputs, and describes the multigrid methodology that is broadly applicable in early vision.
Physical ReviewAmplitude Instability and Ergodic Behavior for Conservative Nonlinear Oscillator Systems
302 Citations1969Grayson H. Walker, Joseph Ford
International Journal of Computer VisionSignal matching through scale space
228 Citations1987Andrew Witkin, Demetri Terzopoulos +1 more
The general signal-matching problem is formulated as the minimization of an energy measure that combines a smoothness term and a similarity term that reduces to a dynamic system governed by a set of coupled, first-order differential equations.
DSpace@MIT (Massachusetts Institute of Technology)Probabilistic Solution of Inverse Problems
165 Citations1985José L. Marroquín
The goal of this work is to demonstrate the generality and practical value of a probabilistic approach to this problem, particularly in the context of Computer Vision, with a Gibbsian probability distribution on the space of all possible functions.
Nuclear Physics BMicrocanonical simulation of Ising systems
69 Citations1984Gyan Bhanot, Michael Creutz +1 more
Elsevier eBooksA STOCHASTIC APPROACH TO STEREO VISION
66 Citations1987Stephen T. Barnard
A stochastic optimization approach to stereo matching is presented, providing a dense array of disparities, eliminating the need for interpolation and allowing the large-scale structure of the disparity map to emerge at higher temperatures, and avoids the problem of converging too quickly on a local minimum.
Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)Stereo matching by hierarchical, microcanonical annealing
33 Citations1987Stephen T. Barnard
An improved stochastic stereo-matching algorithm is presented, incorporating two substantial modifications to an earlier version: a new variation of simulated annealing that is faster, simpler, and more controllable than the conventional "heat-bath version", and a hierarchical, coarse-to-fine-resolution control structure.