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.
Point cloud analysis has received much attention recently; and segmentation is one of the most important tasks. The success of existing approaches is attributed to deep network design and large amount of labelled training data, where the latter is assumed to be always available. However, obtaining 3d point cloud segmentation labels is often very costly in practice. In this work, we propose a weakly supervised point cloud segmentation approach which requires only a tiny fraction of points to be labelled in the training stage. This is made possible by learning gradient approximation and exploitation of additional spatial and color smoothness constraints. Experiments are done on three public datasets with different degrees of weak supervision. In particular, our proposed method can produce results that are close to and sometimes even better than its fully supervised counterpart with 10$\times$ fewer labels.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2004.04091")
get_code_for_paper("2004.04091")
have("2004.04091")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2004.04091.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2004.04091)
Connect an agent — have() is free.