Papers › Point Cloud Oversegmentation with Graph-Structured Deep Metric Learning

Point Cloud Oversegmentation with Graph-Structured Deep Metric Learning

3 Apr 2019CVPR 2019 6arXiv:1904.02113archive 2025-07-28

Loic Landrieu, Mohamed Boussaha

We propose a new supervized learning framework for oversegmenting 3D point clouds into superpoints. We cast this problem as learning deep embeddings of the local geometry and radiometry of 3D points, such that the border of objects presents high contrasts. The embeddings are computed using a lightweight neural network operating on the points' local neighborhood. Finally, we formulate point cloud oversegmentation as a graph partition problem with respect to the learned embeddings. This new approach allows us to set a new state-of-the-art in point cloud oversegmentation by a significant margin, on a dense indoor dataset (S3DIS) and a sparse outdoor one (vKITTI). Our best solution requires over five times fewer superpoints to reach similar performance than previously published methods on S3DIS. Furthermore, we show that our framework can be used to improve superpoint-based semantic segmentation algorithms, setting a new state-of-the-art for this task as well.

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="1904.02113")

Code

Syntology Ran 1 of 13 code samples harvested from 2 repositories linked to this paper; 12 have no recorded run. Of those that ran: 1 ran · our draft was wrong.

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

loicland/superpoint_graph officialmentioned in papermentioned on GitHubpytorchMIT report
jsgaobiao/superpoint_graph mentioned on GitHubpytorchMIT report

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

13 samples harvested; 1 ran; 0 honoured the contract we drafted; 12 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
12unverified

Licence: 0 of the 13 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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.

compute_boundary_precision loicland/superpoint_graph/learning/metrics.py official repository unverified MIT (permissive) · 53525019df188c6b · report
compute_boundary_recall loicland/superpoint_graph/learning/metrics.py official repository unverified MIT (permissive) · 3cff4b0c303f38be · report
compute_dist loicland/superpoint_graph/supervized_partition/losses.py official repository unverified MIT (permissive) · 2782cfa4e987b0a1 · report
compute_loss loicland/superpoint_graph/supervized_partition/losses.py official repository unverified MIT (permissive) · 851ed5d8a57bf8c7 · report
compute_predicted_transitions loicland/superpoint_graph/learning/metrics.py official repository unverified MIT (permissive) · f6312733479ecec8 · report
get_info loicland/superpoint_graph/learning/custom_dataset.py official repository unverified MIT (permissive) · 787baadda400bd94 · report
get_info loicland/superpoint_graph/learning/s3dis_dataset.py official repository unverified MIT (permissive) · ba1f19c5139c4825 · report
get_info loicland/superpoint_graph/learning/sema3d_dataset.py official repository unverified MIT (permissive) · b36f9b676c19b53b · report
get_s3dis_info loicland/superpoint_graph/supervized_partition/graph_processing.py official repository unverified MIT (permissive) · 834ef8633c9081cb · report
get_sema3d_info loicland/superpoint_graph/supervized_partition/graph_processing.py official repository unverified MIT (permissive) · 60d50c0625cc0aa7 · report
read_structure loicland/superpoint_graph/supervized_partition/graph_processing.py official repository unverified MIT (permissive) · cbecc43af2c952d3 · report
zhang loicland/superpoint_graph/supervized_partition/losses.py official repository unverified MIT (permissive) · b08b6b16d4684b7b · report
create_fnet jsgaobiao/superpoint_graph/learning/graphnet.py community (archive-listed) ran · our draft was wrong MIT (permissive) · e7175798629e58c2 · report

Tasks

Semantic Segmentation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Semantic Segmentation S3DIS SSP+SPG Mean IoU 68.4 #28 of 54 Archive leaderboard report
Semantic Segmentation S3DIS SSP+SPG Number of params 0.290M #28 of 54 Archive leaderboard report
Semantic Segmentation S3DIS SSP+SPG Params (M) 0.29 #28 of 54 Archive leaderboard report
Semantic Segmentation S3DIS SSP+SPG mAcc 78.3 #28 of 54 Archive leaderboard report
Semantic Segmentation S3DIS SSP+SPG oAcc 87.9 #28 of 54 Archive leaderboard report
Semantic Segmentation S3DIS Area5 SSP+SPG Number of params 290K #50 of 61 Archive leaderboard report
Semantic Segmentation S3DIS Area5 SSP+SPG mAcc 68.2 #50 of 61 Archive leaderboard report
Semantic Segmentation S3DIS Area5 SSP+SPG mIoU 61.7 #50 of 61 Archive leaderboard report
Semantic Segmentation S3DIS Area5 SSP+SPG oAcc 87.9 #50 of 61 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

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