Sparse window local stereo matching


Share/Save/Bookmark

Damjanović, Sanja and Heijden, Ferdinand van der and Spreeuwers, Luuk J. (2011) Sparse window local stereo matching. In: International Conference on Computer Vision Theory and Applications, VISAPP 2011, 5-7 March 2011, Villamoura, Portugal (pp. pp. 689-693).

[img] PDF
Restricted to UT campus only
: Request a copy
555kB
Abstract:We propose a new local algorithm for dense stereo matching of gray images. This algorithm is a hybrid of the pixel based and the window based matching approach; it uses a subset of pixels from the large window for matching. Our algorithm does not suffer from the common pitfalls of the window based matching. It successfully recovers disparities of the thin objects and preserves disparity discontinuities. The only criterion for pixel selection is the intensity difference with the central pixel. The subset contains only pixels which lay within a fixed threshold from the central gray value. As a consequence of the fixed threshold, a low-textured windows will use a larger percentage of pixels for matching, while textured windows can use just a few. In such manner, this approach also reduces the memory consumption. The cost is calculated as the sum of squared differences normalized to the number of the used pixels. The algorithm performance is demonstrated on the test images from the Middlebury stereo evaluation framework.
Item Type:Conference or Workshop Item
Copyright:© 2011 SciTEPress
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/79729
Official URL:http://dx.doi.org/10.5220/0003369106890693
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page