loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Michael Bleyer and Margrit Gelautz

Affiliation: Institute for Software Technology and Interactive Systems, Vienna University of Technology, Austria

Keyword(s): Stereo matching, tree-based dynamic programming, fast stereo method.

Related Ontology Subjects/Areas/Topics: Computer Vision, Visualization and Computer Graphics ; Motion, Tracking and Stereo Vision ; Stereo Vision and Structure from Motion

Abstract: This work describes a fast method for computing dense stereo correspondences that is capable of generating results close to the state-of-the-art. We propose running a separate disparity computation process in each image pixel. The idea is to root a tree graph on the pixel whose disparity needs to be reconstructed. The tree thereby forms an individual approximation of the standard four-connected grid for this specific pixel. An exact optimum of a predefined energy function on the applied tree structure is determined via dynamic programming (DP), and the root pixel is assigned to the disparity of optimal costs. We present two simple tree structures that allow for the efficient calculation of all trees’ optima with only four scanline-based DP passes. These simple trees are designed to capture all pixels of the reference frame and incorporate horizontal and vertical smoothness edges in order to weaken the scanline streaking problem inherent in DP-based approaches. We evaluate our results using the Middlebury test set. Our algorithm currently ranks at the eighth position of approximately 30 algorithms in the Middlebury database. More importantly, it is the currently best-performing method that does not use image segmentation and is significantly faster than most competing algorithms. Our method needs less than a second to determine the disparity map for typical stereo pairs. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.218.209.8

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Bleyer, M. and Gelautz, M. (2008). SIMPLE BUT EFFECTIVE TREE STRUCTURES FOR DYNAMIC PROGRAMMING-BASED STEREO MATCHING. In Proceedings of the Third International Conference on Computer Vision Theory and Applications (VISIGRAPP 2008) - Volume 1: VISAPP; ISBN 978-989-8111-21-0; ISSN 2184-4321, SciTePress, pages 415-422. DOI: 10.5220/0001072904150422

@conference{visapp08,
author={Michael Bleyer. and Margrit Gelautz.},
title={SIMPLE BUT EFFECTIVE TREE STRUCTURES FOR DYNAMIC PROGRAMMING-BASED STEREO MATCHING},
booktitle={Proceedings of the Third International Conference on Computer Vision Theory and Applications (VISIGRAPP 2008) - Volume 1: VISAPP},
year={2008},
pages={415-422},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001072904150422},
isbn={978-989-8111-21-0},
issn={2184-4321},
}

TY - CONF

JO - Proceedings of the Third International Conference on Computer Vision Theory and Applications (VISIGRAPP 2008) - Volume 1: VISAPP
TI - SIMPLE BUT EFFECTIVE TREE STRUCTURES FOR DYNAMIC PROGRAMMING-BASED STEREO MATCHING
SN - 978-989-8111-21-0
IS - 2184-4321
AU - Bleyer, M.
AU - Gelautz, M.
PY - 2008
SP - 415
EP - 422
DO - 10.5220/0001072904150422
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic