An adaptive multifeature correspondence algorithm for stereo using dynamic programming

Authors:
C. V. Jawahar;P. J. Narayanan
Affiliations:
Centre for Artificial Intelligence and Robotics, Raj Bhavan Circle, High Grounds, Bangalore, India;Centre for Artificial Intelligence and Robotics, Raj Bhavan Circle, High Grounds, Bangalore, India
Venue:
Pattern Recognition Letters
Year:
2002

Citing 5
Cited 0

Unsupervised textural classification of images using the texture spectrum

Pattern Recognition
Three-dimensional computer vision: a geometric viewpoint

Three-dimensional computer vision: a geometric viewpoint
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
Depth Discontinuities by Pixel-to-Pixel Stereo

International Journal of Computer Vision

Quantified Score

Hi-index	0.10

Visualization

Abstract

We present an algorithm for stereo correspondence that can take advantage of different image features adaptively for matching. A match measure combining different match measures computed from different features is used by our algorithm. It is possible to compute correspondences using the gray value, multispectral components, derived features such as the edge strength, texture, etc., in a flexible manner using this algorithm. The advantages of each feature can be combined in a single correspondence computation. We describe a non-supervised scheme to compute the relevance of each feature to a particular situation, given a set of possibly useful features. We present an implementation of the scheme using dynamic programming for pixel-to-pixel correspondence. Results demonstrate the advantages of our scheme under different conditions.