arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.07516cs.CV
收藏

一种立体匹配的分解模型

A Decomposition Model for Stereo Matching

Beijing Institute of Technology(北京理工大学)

Chengtang Yao, Yunde Jia, Huijun Di, Pengxiang Li, Yuwei Wu

摘要:

在本文中,我们提出了一个立体匹配的分解模型,以解决计算成本(时间和内存成本)的过度增长的问题,随着分辨率的增加。为了减少在原始分辨率下进行立体匹配的巨大成本,我们的模型只在很低的分辨率下运行密集匹配,并在不同的更高分辨率下使用稀疏匹配来逐尺度地恢复丢失细节的视差。立体匹配分解后,我们的模型迭代地融合稀疏和密集的视差图从相邻的尺度与闭塞感知的面具。一个细化网络也被用来改善融合结果。与PSMNet和GANet等高性能方法相比,我们的方法实现了$10-100\times$速度的提高,同时获得了相当的视差估计结果。

英文摘要:

In this paper, we present a decomposition model for stereo matching to solve the problem of excessive growth in computational cost (time and memory cost) as the resolution increases. In order to reduce the huge cost of stereo matching at the original resolution, our model only runs dense matching at a very low resolution and uses sparse matching at different higher resolutions to recover the disparity of lost details scale-by-scale. After the decomposition of stereo matching, our model iteratively fuses the sparse and dense disparity maps from adjacent scales with an occlusion-aware mask. A refinement network is also applied to improving the fusion result. Compared with high-performance methods like PSMNet and GANet, our method achieves $10-100\times$ speed increase while obtaining comparable disparity estimation results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑