Subpixel stereo matching by robust estimation of local distortion using gabor filters

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Area-based stereo matching algorithms are based on the support of a surrounding area to establish a point-to-point correspondence in two images. Two important problems arise in this context: How to obtain subpixel information and how to choose the optimal surrounding area.In this paper we present a non-iterative two-step algorithm for subpixel accurate stereo matching by using an adaptive window. In contrast to existing algorithms the window is not restricted to a rectangle but can be of any general shape. Starting from an initial sparse disparity estimate, the first step is to find the general shape of the window. This is performed by estimating the local disparity of each pixel in a box of maximum size using a bank of Gabor filters, and by applying a consistency constraint. In the second step the projective distortion is computed using the masked window. The performed experiments show the accurate and robust behavior of the proposed algorithm.

Cite

CITATION STYLE

APA

Werth, P., Scherer, S., & Pinz, A. (1999). Subpixel stereo matching by robust estimation of local distortion using gabor filters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1689, pp. 641–648). Springer Verlag. https://doi.org/10.1007/3-540-48375-6_76

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free