Probabilistic Signal Models to Regularise Dynamic Programming Stereo

Authors:
Georgy L. Gimel'farb;Uri Lipowezky
Affiliations:
-;-
Venue:
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Year:
2002

Citing 6
Cited 0

A maximum likelihood stereo algorithm

Computer Vision and Image Understanding
Fast and automatic stereo vision matching algorithm based on dynamic programming method

Pattern Recognition Letters
A dense disparity map of stereo images

Pattern Recognition Letters
A multi-level dynamic programming method for stereo line matching

Pattern Recognition Letters
A Stereo Vision System for Support of Planetary Surface Exploration

ICVS '01 Proceedings of the Second International Workshop on Computer Vision Systems
Binocular Stereo by Maximizing the Likelihood Ratio Relative to a Random Terrain

RobVis '01 Proceedings of the International Workshop on Robot Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ill-posedness of the binocular stereo problem stems from partial occlusions and homogeneous textures of a 3D surface. We consider the symmetric dynamic programming stereo regularised with respect to partial occlusions. The regularisation is based on Markovian models of epipolar profiles and stereo signals that allow for measuring similarity of stereo images with due account of binocular and monocular visibility of the surface points. Experiments show that the probabilistic regularisation yields mostly accurate elevation maps but fails in excessively occluded or shaded areas.