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.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We present PatchmatchNet, a novel and learnable cascade formulation of Patchmatch for high-resolution multi-view stereo. With high computation speed and low memory requirement, PatchmatchNet can process higher resolution imagery and is more suited to run on resource limited devices than competitors that employ 3D cost volume regularization. For the first time we introduce an iterative multi-scale Patchmatch in an end-to-end trainable architecture and improve the Patchmatch core algorithm with a novel and learned adaptive propagation and evaluation scheme for each iteration. Extensive experiments show a very competitive performance and generalization for our method on DTU, Tanks & Temples and ETH3D, but at a significantly higher efficiency than all existing top-performing models: at least two and a half times faster than state-of-the-art methods with twice less memory usage.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2012.01411")
get_code_for_paper("2012.01411")
have("2012.01411")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2012.01411.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2012.01411)
Connect an agent — have() is free.