An adaptive multifeature correspondence algorithm for stereo using dynamic programming

C. V. Jawahar

doi:10.1016/S0167-8655(01)00132-5

Return

An adaptive multifeature correspondence algorithm for stereo using dynamic programming

2002-03-01

PRE

C. V. Jawahar

P. J. Narayanan

DOI：10.1016/S0167-8655(01)00132-5

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2002 Elsevier Science B.V. All rights reserved.

Keywords:

stereo correspondence

dynamic programming

matching

feature integration

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.