pith. sign in

arxiv: 2506.22799 · v1 · pith:F3VS5YJPnew · submitted 2025-06-28 · 💻 cs.GR · cs.CV· cs.LG

VoteSplat: Hough Voting Gaussian Splatting for 3D Scene Understanding

classification 💻 cs.GR cs.CVcs.LG
keywords votesplatlocalizationunderstandinggaussianscenevotingwhilecosts
0
0 comments X
read the original abstract

3D Gaussian Splatting (3DGS) has become horsepower in high-quality, real-time rendering for novel view synthesis of 3D scenes. However, existing methods focus primarily on geometric and appearance modeling, lacking deeper scene understanding while also incurring high training costs that complicate the originally streamlined differentiable rendering pipeline. To this end, we propose VoteSplat, a novel 3D scene understanding framework that integrates Hough voting with 3DGS. Specifically, Segment Anything Model (SAM) is utilized for instance segmentation, extracting objects, and generating 2D vote maps. We then embed spatial offset vectors into Gaussian primitives. These offsets construct 3D spatial votes by associating them with 2D image votes, while depth distortion constraints refine localization along the depth axis. For open-vocabulary object localization, VoteSplat maps 2D image semantics to 3D point clouds via voting points, reducing training costs associated with high-dimensional CLIP features while preserving semantic unambiguity. Extensive experiments demonstrate effectiveness of VoteSplat in open-vocabulary 3D instance localization, 3D point cloud understanding, click-based 3D object localization, hierarchical segmentation, and ablation studies. Our code is available at https://sy-ja.github.io/votesplat/

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Relation-Centric Open-Vocabulary 3D Gaussian Segmentation

    cs.CV 2026-07 unverdicted novelty 7.0

    PairGS builds a relation graph from sparse pairwise affinities on 3D Gaussians to achieve SOTA open-vocabulary segmentation with a 50x faster variant than optimization-based methods.