.png){kind=icon}
Return
A fast area-based stereo matching algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.imavis.2004.03.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes an area-based stereo algorithm suitable to real time applications. The core of the algorithm relies on the uniqueness constraint and on a matching process that rejects previous matches as soon as more reliable ones are found. The proposed approach is also compared with bidirectional matching (BM), since the latter is the basic method for detecting unreliable matches in most area-based stereo algorithms. We describe the algorithm's matching core, the additional constraints introduced to improve the reliability and the computational optimizations carried out to achieve a very fast implementation. We provide a large set of experimental results, obtained on a standard set of images with ground-truth as well as on stereo sequences, and computation time measurements. These data are used to evaluate the proposed algorithm and compare it with a well-known algorithm based on BM. (C) 2004 Elsevier B.V. All rights reserved.
Keywords:
stereo
area-based
real-time
uniqueness constraint
bidirectional matching
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.2
Papers:
4.1K
Citations:
6.7K
Organization
No organization information available
Cited Papers
.png){kind=icon}
NIS expression in thyroid tumors, relation with prognosis clinicopathological and molecular features
OAAI
OAAIShareSaveShareSaveShareSave no more
no more