TL;DR
This paper introduces FPCC, a fast and efficient point cloud clustering method for instance segmentation in bin-picking scenarios, focusing on distinguishing occluded identical objects without relying on semantic information.
Contribution
The paper presents FPCC-Net and a novel clustering algorithm tailored for bin-picking, improving segmentation accuracy and computational efficiency over existing methods.
Findings
FPCC surpasses existing methods in bin-picking scene segmentation.
FPCC is more computationally efficient than previous approaches.
The approach effectively handles occluded identical objects.
Abstract
Instance segmentation is an important pre-processing task in numerous real-world applications, such as robotics, autonomous vehicles, and human-computer interaction. Compared with the rapid development of deep learning for two-dimensional (2D) image tasks, deep learning-based instance segmentation of 3D point cloud still has a lot of room for development. In particular, distinguishing a large number of occluded objects of the same class is a highly challenging problem, which is seen in a robotic bin-picking. In a usual bin-picking scene, many identical objects are stacked together and the model of the objects is known. Thus, the semantic information can be ignored; instead, the focus in the bin-picking is put on the segmentation of instances. Based on this task requirement, we propose a Fast Point Cloud Clustering (FPCC) for instance segmentation of bin-picking scene. FPCC includes a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
