.png){kind=icon}
返回
Optimizing ZNCC calculation in binocular stereo matching
.png){kind=icon}
PRE
AI
DOI：10.1016/j.image.2017.01.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Stereo matching is a crucial and challenging step in binocular vision measurement. Robust zero-mean normalized cross-correlation (ZNCC) is widely used for stereo matching. However, direct calculation by using the prevalent ZNCC algorithm is computationally expensive because of the large number of redundancies that directly affect execution time. Therefore, this study proposes a fast method for the reliable computation of the similarity measure through ZNCC for stereo matching. We divide the standard ZNCC function into four independent parts, and this can efficiently reduce computational complexity. Furthermore, a storage strategy is proposed to store calculation results by column and apply a circular queue to the entire matching process. The rapid calculation of the template relies on the position of the pixels in the given image, which is based on the relevant characteristics of adjacent pixels. Invoking the stored calculation template value can help significantly reduce computational complexity. The proposed algorithm was tested on a 2.6-GHz computer with different sizes of images from the Middlebury Stereo Datasets, and the results reveal a remarkably shorter execution time.
Keyword:
Stereo matching
Binocular vision
ZNCC
Dense disparity map
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
S
IF:
2.7
论文数:
2.8K
被引数:
4.2K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容