We give a simple and efficient algorithm for approximating computation of disparities in a pair of rectified frames of an image sequence. The algorithm consists of rendering a sparse set of correspondences, which are triangulated, expanded and corrected in the areas of occlusions and homogeneous texture by a color distribution algorithm. The obtained approximations of the disparity maps are refined by a semi-global algorithm. The algorithm was tested for three data sets with rather different data quality. The results of the performance of our method are presented and areas of applications and future research are outlined. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Bulatov, D., Wernerus, P., & Lang, S. (2009). A new triangulation-based method for disparity estimation in image sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5575 LNCS, pp. 279–290). https://doi.org/10.1007/978-3-642-02230-2_29
Mendeley helps you to discover research relevant for your work.