# Open-YOLO 3D > Boudjoghra 2024 · [Paper](https://arxiv.org/abs/2406.02548) **One-line summary** — Fast open-vocabulary 3D instance segmentation that replaces the slow SAM + CLIP labeling pipeline with a real-time open-vocabulary 2D object detector, reaching a ~16x speedup over the prior state of the art. ## Problem Open-vocabulary 3D instance segmentation showed strong promise, but at the cost of slow inference: methods like OpenMask3D and Open3DIS label class-agnostic 3D proposals by projecting them into many views, refining with SAM, encoding crops with CLIP, and aggregating 3D CLIP features — 5-10 minutes per scene. The key observation: the projection of a class-agnostic 3D instance into an image *already* carries the instance information, so per-view segmentation with SAM is redundant when the end goal is only to assign a text label to each 3D mask. A second bottleneck is visibility computation, done by iteratively counting visible points per mask per frame. ## Method & architecture Pipeline: a 3D network proposes masks, a 2D detector votes on their labels across views. - **Class-agnostic 3D proposals**: Mask3D (3D CNN backbone + transformer mask decoder) predicts $K_{3D}$ binary instance masks $M \in \mathbb{Z}_2^{K_{3D}\times N}$ over the $N$-point cloud (NMS-filtered, no DBSCAN to keep inference fast). - **Low-Granularity (LG) label maps**: an open-vocabulary 2D detector (YOLO-World XL) produces boxes $(b_j, c_j)$ per RGB frame. Each frame becomes a label map $\mathcal{L}_i \in \mathbb{Z}^{W\times H}$, initialized to -1 (no class); box regions are painted with their class labels in decreasing order of weight $w_j = b_j^H + b_j^W$, so smaller (closer, visible) boxes overwrite larger ones. - **Accelerated visibility computation (VAcc)**: all points are projected to all $N_f$ frames in one batched operation, $P^{2D} = (I \star E)\cdot P$ ($I, E$ intrinsics/extrinsics, $\star$ batch-matrix multiplication). In-frame and occlusion visibility are computed as tensor ops: $$V^{f}=\mathbb{1}(0