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 propose an approach for dense semantic 3D reconstruction which uses a data term that is defined as potentials over viewing rays, combined with continuous surface area penalization. Our formulation is a convex relaxation which we augment with a crucial non-convex constraint that ensures exact handling of visibility. To tackle the non-convex minimization problem, we propose a majorize-minimize type strategy which converges to a critical point. We demonstrate the benefits of using the non-convex constraint experimentally. For the geometry-only case, we set a new state of the art on two datasets of the commonly used Middlebury multi-view stereo benchmark. Moreover, our general-purpose formulation directly reconstructs thin objects, which are usually treated with specialized algorithms. A qualitative evaluation on the dense semantic 3D reconstruction task shows that we improve significantly over previous methods.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1604.02885")
get_code_for_paper("1604.02885")
have("1604.02885")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1604.02885.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1604.02885)
Connect an agent — have() is free.