SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2104.07516 · CVPR · 2021

A Decomposition Model for Stereo Matching

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

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

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 highperformance methods like PSMNet and GANet, our method achieves 10 -100× speed increase while obtaining comparable disparity estimation results.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2104.07516")
get_code_for_paper("2104.07516")
have("2104.07516")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2104.07516.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2104.07516.svg)](https://syntology.ai/paper/2104.07516)

Connect an agent — have() is free.