Stereo correspondence by dynamic programming on a tree

DMCA

Stereo correspondence by dynamic programming on a tree (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Olga Veksler

Venue:	IEEE CVPR, Vol II
Citations:	62 - 0 self

BibTeX

@INPROCEEDINGS{Veksler05stereocorrespondence,
    author = {Olga Veksler},
    title = {Stereo correspondence by dynamic programming on a tree},
    booktitle = {IEEE CVPR, Vol II},
    year = {2005},
    pages = {384--390}
}

OpenURL

Abstract

Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art because the vertical consistency between the scanlines is not enforced. We re-examine the use of dynamic programming for stereo correspondence by applying it to a tree structure, as opposed to the individual scanlines. The nodes of this tree are all the image pixels, but only the “most important” edges of the 4 connected neighbourhood system are included. Thus our algorithm is truly a global optimization method because disparity estimate at one pixel depends on the disparity estimates at all the other pixels, unlike the scanline based methods. We evaluate our algorithm on the benchmark Middlebury database. The algorithm is very fast, it takes only a fraction of a second for a typical image. The results are considerably better than that of the scanline based methods. While the results are not the state of the art, our algorithm offers a good trade off in terms of accuracy and computational efficiency. 1

Keyphrases

stereo correspondence dynamic programming computational efficiency disparity estimate vertical consistency good trade global optimization method tree structure neighbourhood system image pixel individual scanlines popular method benchmark middlebury database typical image important edge

DMCA