2004
DOI: 10.1016/j.imavis.2004.03.009
|View full text |Cite
|
Sign up to set email alerts
|

A fast area-based stereo matching algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
135
0
3

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 229 publications
(138 citation statements)
references
References 17 publications
0
135
0
3
Order By: Relevance
“…For the best of authors' knowledge, we propose the first RGB-D benchmark dataset with handlabeled ground truth that includes sequences with different challenging scenarios for FgjBg segmentation. Moreover, we tested the proposed algorithm on the stereo data presented in [11] for which we provided a ground truth.…”
Section: Benchmark Data and Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…For the best of authors' knowledge, we propose the first RGB-D benchmark dataset with handlabeled ground truth that includes sequences with different challenging scenarios for FgjBg segmentation. Moreover, we tested the proposed algorithm on the stereo data presented in [11] for which we provided a ground truth.…”
Section: Benchmark Data and Resultsmentioning
confidence: 99%
“…The proposed dataset is composed by five sequences of indoor environments, obtained with a static device that registers different demanding situations such as cast shadows, color and depth camouflage and moved background object. Moreover the dataset contains a stereo sequence presented in [11] for which we provide the ground truth. The benchmark database has been used to test the proposed strategy and state of the art algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…After obtaining the camera calibration parameters by observing different orientations of a 2D planar calibration pattern [1], the main task is to determine correspondences between the stereo images along the epipolar lines. Methods to determine such correspondence in stereo vision can be divided into two classes: global and local methods [2,3], The global method relies on an iterative scheme and obtains the disparity on the basis of the minimization of a global cost function [4,5]. This method can produce an accurate and dense disparity map, but at a high computational cost as the local method is based on the relation between each pixel and its adjacent pixels.…”
Section: Introductionmentioning
confidence: 99%
“…This constraint may be violated at depth discontinuities in the scene. Three broad classes of techniques have been used for stereo matching: area-based (Di Stefano et al, 2004;Scharstein & Szelinski, 2002), feature-based (Venkateswar & Chellappa, 1995;Dhond & Aggarwal, 1989), and phase-based (Fleet et al, 1991;Fleet, 1994). Area-based algorithms use local pixel intensities as a distance measure and they produce dense disparity maps, i.e.…”
Section: Introductionmentioning
confidence: 99%