FEC: Fast Euclidean Clustering for Point Cloud Segmentation
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Cross-Domain Few-Shot Semantic Segmentation
No time to train! Training-Free Reference-Based Instance Segmentation
NOCTIS: Novel Object Cyclic Threshold based Instance Segmentation
SCORE: Scene Context Matters in Open-Vocabulary Remote Sensing Instance Segmentation
Beyond Appearance: Geometric Cues for Robust Video Instance Segmentation
TSDASeg: A Two-Stage Model with Direct Alignment for Interactive Point Cloud Segmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.