.png){kind=icon}
返回
A fast area-based stereo matching algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.imavis.2004.03.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
stereo
area-based
real-time
uniqueness constraint
bidirectional matching
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
4.1K
被引数:
6.7K
机构
暂无机构信息
引用论文
.png){kind=icon}
NIS expression in thyroid tumors, relation with prognosis clinicopathological and molecular features
OAAI
OAAI分享收藏分享收藏 没有更多内容
没有更多内容