Papers › DPSNet: End-to-end Deep Plane Sweep Stereo

DPSNet: End-to-end Deep Plane Sweep Stereo

2 May 2019ICLR 2019 5arXiv:1905.00538archive 2025-07-28

Sunghoon Im, Hae-Gon Jeon, Stephen Lin, In So Kweon

Multiview stereo aims to reconstruct scene depth from images acquired by a camera under arbitrary motion. Recent methods address this problem through deep learning, which can utilize semantic cues to deal with challenges such as textureless and reflective regions. In this paper, we present a convolutional neural network called DPSNet (Deep Plane Sweep Network) whose design is inspired by best practices of traditional geometry-based approaches for dense depth reconstruction. Rather than directly estimating depth and/or optical flow correspondence from image pairs as done in many previous deep learning methods, DPSNet takes a plane sweep approach that involves building a cost volume from deep features using the plane sweep algorithm, regularizing the cost volume via a context-aware cost aggregation, and regressing the dense depth map from the cost volume. The cost volume is constructed using a differentiable warping process that allows for end-to-end training of the network. Through the effective incorporation of conventional multiview stereo concepts within a deep learning framework, DPSNet achieves state-of-the-art reconstruction results on a variety of challenging datasets.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1905.00538")

Code

Syntology Ran 2 of 10 code samples harvested from 1 repository linked to this paper; 8 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 1 ran with no contract checked.

By repository: community (archive-listed): 10 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested; 2 ran; 0 honoured the contract we drafted; 8 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
1ran
8unverified

Licence: 0 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from sunghoonim/DPSNet. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

convbn sunghoonim/DPSNet/models/submodule.py community (archive-listed) ran · our draft was wrong MIT (permissive) · 15ab3c76823aef7e · report
convbn_3d sunghoonim/DPSNet/models/submodule.py community (archive-listed) ran MIT (permissive) · 46674adf87c5459d · report
cam2pixel sunghoonim/DPSNet/inverse_warp.py community (archive-listed) unverified MIT (permissive) · 397deb932e72aeb7 · report
compute_errors_test sunghoonim/DPSNet/loss_functions.py community (archive-listed) unverified MIT (permissive) · 3795ee04b993aecb · report
compute_errors_train sunghoonim/DPSNet/loss_functions.py community (archive-listed) unverified MIT (permissive) · 56f26f9a1c756e3b · report
convtext sunghoonim/DPSNet/models/PSNet.py community (archive-listed) unverified MIT (permissive) · 12ea6024e74f0a0c · report
inverse_warp sunghoonim/DPSNet/inverse_warp.py community (archive-listed) unverified MIT (permissive) · 0f5e002aea945fe0 · report
pixel2cam sunghoonim/DPSNet/inverse_warp.py community (archive-listed) unverified MIT (permissive) · 7d9d5ed0cad1ad89 · report
quat2mat sunghoonim/DPSNet/sequence_folderse.py community (archive-listed) unverified MIT (permissive) · 9f46f38f391e2368 · report
tensor2array sunghoonim/DPSNet/utils.py community (archive-listed) unverified MIT (permissive) · e5ca72bb116ddd00 · report

Tasks

Deep LearningOptical Flow Estimation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections