Share Email Print
cover

Proceedings Paper

Stereo matching with superpixels
Author(s): Mikołaj Roszkowski
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The purpose of a short-baseline stereo matching algorithm is calculation of the disparity map for a given rectified stereo pair. Most stereo algorithms presented in the literature achieve this goal by searching all possible disparities for all pixels. This may be extremely costly if an image size and search range are large. In this paper an efficient method of computing a disparity map for the whole image, by searching disparities for only a selected subset of pixels, is presented. It is shown how to select good initial set of pixels for matching given the over-segmentation of the input images. It is also presented that such a limited set of pixels is sufficient to obtain a rough estimate of the disparity map. Next, it is described how this disparity map can be improved. The results indicate that despite searching only a fraction of possible disparities for just a subset of input image pixels, a computed disparity maps are of quality comparable to those obtained with a full search algorithm. Moreover, the method is general enough to be used with almost any local stereo matching algorithm.

Paper Details

Date Published: 15 October 2012
PDF: 9 pages
Proc. SPIE 8454, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2012, 84540V (15 October 2012); doi: 10.1117/12.2000139
Show Author Affiliations
Mikołaj Roszkowski, Warsaw Univ. of Technology (Poland)


Published in SPIE Proceedings Vol. 8454:
Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2012
Ryszard S. Romaniuk, Editor(s)

© SPIE. Terms of Use
Back to Top