mlsanityData to 14 Oct 2026

FEC: Fast Euclidean Clustering for Point Cloud Segmentation

arXiv 2208.07678 ↗First posted 16 Aug 2022cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

Segmentation from point cloud data is essential in many applications such as remote sensing, mobile robots, or autonomous cars. However, the point clouds captured by the 3D range sensor are commonly sparse and unstructured, challenging efficient segmentation. In this paper, we present a fast solution to point cloud instance segmentation with small computational demands. To this end, we propose a novel fast Euclidean clustering (FEC) algorithm which applies a pointwise scheme over the clusterwise scheme used in existing works. Our approach is conceptually simple, easy to implement (40 lines in C++), and achieves two orders of magnitudes faster against the classical segmentation methods while producing high-quality results.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 7 of its 51 references that are in the map. First posted on arXiv 16 Aug 2022.

Builds on

7 of 51 references.

References · 7

  1. 2014Microsoft COCO: Common Objects in Contextcited by 17,608
  2. 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,248
  3. 2017VoxelNet: End-to-End Learning for Point Cloud Based 3D Object Detectioncited by 1,323
  4. 2017SGPN: Similarity Group Proposal Network for 3D Point Cloud Instance Segmentationcited by 169
  5. 20193D Instance Segmentation via Multi-Task Metric Learningcited by 80
  6. 2019LDLS: 3-D Object Segmentation Through Label Diffusion From 2-D Imagescited by 7
  7. 2020FPCC: Fast Point Cloud Clustering based Instance Segmentation for Industrial Bin-pickingcited by 7

Built on by

Cited by year

Citing papers per year: 2025: 3.

3 papers.