Pith. sign in

REVIEW 4 major objections 5 minor 28 references

OpenFusion++: An Open-vocabulary Real-time Scene Understanding System

T0 review · 4 major / 5 minor · reviewed 2026-08-16 · deepseek-v4-flash

Pith's one-line read OpenFusion++ sharpens real-time open-vocabulary 3D maps by fusing confidence, area-weighted semantics, and two-stage queries.

desk verdict OpenFusion++ is a real incremental advance with two well-motivated modules, but the adaptive cache's core equation (Eq. 4) has the depth-area relation inverted, so the reported cache gains are not explained as written. read the letter →

arxiv 2504.19266 v1 pith:DYKESJ2I submitted 2025-04-27 cs.CV

classification cs.CV
keywords open-vocabulary3Dsceneunderstandingreal-timesemanticmappingTSDFreconstructionconfidence-guidedpointsamplingadaptivecachedual-pathquerySEEMRGB-Dperception
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

OpenFusion++ is a real-time 3D mapping system that labels and answers questions about objects in an indoor scene as a robot or AR device streams RGB-D video. The paper claims that three additions to the OpenFusion baseline—confidence-guided point sampling, an area-weighted adaptive semantic cache, and a two-stage object-plus-environment query—boost both segmentation accuracy and the ability to resolve context-dependent queries. This claim is supported by quantitative results on Replica, ScanNet, and ScanNet++, where mean accuracy improves by 6.29, 1.94, and 4.64 points respectively, and by qualitative query results on ICL, Replica, and ScanNet. The significance is that open-vocabulary 3D understanding can be improved at run time by using confidence signals and observation completeness that already exist in the 2D segmentation pipeline, without retraining a model.

What carries the argument

Three concrete mechanisms carry the argument. (1) Confidence-guided point sampling: within each centimeter-scale voxel block, the system assumes one instance and selects the candidate point set with the highest average confidence (Eq. 2–3), using SEEM's per-pixel confidence to resolve instance-boundary conflicts that random sampling would blur. (2) Adaptive semantic cache: a hash-indexed min-heap stores up to three semantic embeddings per instance, ordered by ascending negative physical area; insertion triggers an area-weighted fusion update of the global embedding (Eq. 4–5), so later, more complete views continuously refine the label. (3) Dual-path hierarchical query: the query's core object noun is extracted by a spaCy model, encoded by SEEM's text encoder, and used to score candidate instances by cosine similarity; after a threshold-based candidate set is formed, Alpha-CLIP matches the full query against each candidate's environment features and returns the best instance.

What would settle it

On a controlled sequence with two small, adjacent objects of different categories (e.g., a mug on a bookshelf) whose extent is comparable to one voxel block, run OpenFusion++ end to end; if the reconstructed map omits or mislabels the lower-confidence object only where the two overlap, the single-instance-per-block assumption is the cause. The paper's own Replica ablation, where confidence sampling alone lowers f-mIoU by 1.87 points, provides a baseline expectation for this failure mode.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that a real-time open-vocabulary 3D mapper can be made more accurate at three points in its pipeline without sacrificing responsiveness. First, when a voxel block receives 3D points from more than one 2D instance mask, the system computes the average SEEM confidence of each candidate point set and keeps only the highest-confidence set, giving that block its label (Eq. 2–3). Second, instead of freezing each instance's semantic embedding at its first observation, the mapper inserts each new observation into a per-instance min-heap ordered by ascending physical area, keeps up to three entries, and updates the global embedding as an area-weighted fusion (Eq. 4–5). Third, a query is answered in two stages: SEEM text features select candidate instances whose category is near the query's core noun, then Alpha-CLIP features re-rank those candidates by how well they match the full query, including context like 'near the window.' The paper reports that these mechanisms together raise mean accuracy over the baseline on all evaluated datasets and that the complete system outperforms each module alone in the ablation studies.

Load-bearing premise

The load-bearing premise is that each centimeter-scale voxel block contains exactly one instance, so selecting the highest-average-confidence point set decides the block's label; when two instances occupy the same block, the lower-confidence instance is erased, and the paper acknowledges that confidence sampling then 'dominates insertions, preventing correction.'

Editorial extensions

If this is right

  • Open-vocabulary 3D mappers can use confidence signals that already exist in the 2D segmenter to fix boundary conflicts, so no retraining or new sensor is needed.
  • Instance semantic labels can be continuously refined from partial views using physical area as a completeness proxy, reducing first-impression semantic drift.
  • Complex queries such as 'the cabinet near the window' become answerable by separating category-level selection from environment-level matching.
  • The gains hold across different category granularities (20 classes on ScanNet vs 200 on ScanNet++), suggesting the method is not overfit to one benchmark's label set.
  • If the reported accuracy gains transfer to deployment, robots and AR devices can name and locate arbitrary objects in a scene in real time without a fixed category list.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The single-instance-per-voxel-block assumption means the method likely struggles when two small objects are closer than one block size; a batch-insertion variant with weighted confidence voting, which the conclusion itself floats as future work, would be a natural remedy.
  • The same confidence-guided selection rule could be transferred to any point-cloud-based semantic fusion pipeline that has per-point uncertainty, not just TSDF maps.
  • The dual-path query design suggests that open-vocabulary 3D retrieval may generally benefit from splitting the tasks of 'what kind of thing' and 'which one in this scene' rather than forcing both into one embedding space.
  • A concrete testable extension: measuring query latency versus accuracy under varying cache sizes, since the min-heap cap of three observations is a hyperparameter with no reported sensitivity analysis.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The manuscript presents OpenFusion++, a real-time open-vocabulary 3D scene understanding system built on the OpenFusion TSDF-based mapping framework. It introduces three main contributions: confidence-guided 3D point sampling to improve instance boundaries, an adaptive semantic cache that updates instance embeddings from multi-view observations, and a dual-path query framework combining SEEM object features with Alpha-CLIP spatial context. The paper reports quantitative semantic segmentation improvements over OpenFusion on Replica, ScanNet, and ScanNet++ (Table I), and qualitative query-response results on ICL, Replica, and ScanNet. An ablation study (Table II) attributes gains on Replica to the confidence-guided sampling and adaptive cache modules.

Significance. If the reported results are reliable, OpenFusion++ is a useful incremental contribution to open-vocabulary 3D mapping: it directly addresses semantic drift and instance-boundary errors in incremental TSDF-based mapping, and its dual-path query framework is a practical response to nested queries such as “the cabinet next to the window.” The paper ships no code or machine-checked proofs, but it does include a quantitative comparison against a meaningful external baseline and an ablation study, which are appropriate for this kind of systems paper. However, the central cache mechanism contains a mathematical error that undermines the explanation of the ablation gains, and the quantitative evaluation lacks statistical support and full disclosure of test sequences. These issues must be resolved before the performance claims can be accepted.

major comments (4)
  1. [Section III-C, Eq. (4)] Equation (4) is not the physical area of the 2D instance mask and has the depth dependence inverted. For a pinhole camera, the physical surface area subtended by one pixel at depth D is proportional to D^2/(f_x f_y), not f_x f_y/D^2. The quantity in Eq. (4) has units of inverse area, and for a fixed object it decreases rather than increases as the viewpoint becomes more global. Since the heap ordering W = -A_t^k and the multi-view fusion weights in Eq. (5) both depend on A_t^k, the adaptive cache mechanism as written is biased toward close-up partial observations. This directly contradicts the claim that the cache preserves complete observations, and it means the +2.29 mAcc and +1.10 f-mIoU gains attributed to the cache in Table II are not explained by the mechanism as described. The authors should correct Eq. (4) to use D^2/(f_x f_y) and re-run the ablation, or clearly explain what quantity Eq. (4) is intended to represent.
  2. [Section III-C, min-heap eviction] The min-heap eviction rule is internally inconsistent. The text says the heap stores embeddings “in ascending order based on the weight W = -A_t^k” and that when the heap is full, “the smallest area entry is removed.” With W = -A_t^k and a min-heap, the root has the most negative W, i.e., the largest A_t^k, so removing the root removes the largest-area observation, not the smallest. If the intended behavior is to evict the least complete observation, the implementation should use a max-heap on A_t^k or a min-heap with W = A_t^k. The authors need to clarify the actual data structure and, if the deployed code uses the formula as written, report what is really being evicted.
  3. [Section IV, Table I and Table II] The quantitative evidence for “significantly outperforms” is statistically incomplete. The manuscript does not name the 26 test sequences (8 Replica, 10 ScanNet, 8 ScanNet++), does not report error bars, per-sequence breakdowns, or significance tests, and the hyperparameters alpha = 0.8 and cache size N = 3 are fixed without sensitivity analysis. The abstract and introduction claim experiments on ICL, Replica, ScanNet, and ScanNet++, but ICL appears only in qualitative query tests and not in Table I; the paper should either add ICL results to the quantitative table or remove it from the abstract claim. The ablation in Table II also shows that confidence-guided sampling alone decreases f-mIoU by 1.87, so the statement that the module improves “semantic accuracy” is only true for mAcc. Finally, despite “real-time” in the title, no frame rate, latency, or runtime comparison is reported; the system should be measured or the real-time claim should be qualified.
  4. [Section III-B and Section V] The confidence-guided sampling strategy assumes that each centimeter-scale voxel block contains exactly one instance, as stated before Eq. (3). When a block straddles two instances, the method forces a single label onto the whole block, and the paper’s own conclusion acknowledges that confidence sampling dominates insertions and can prevent later correction. This is a genuine limitation of the first contribution, not just a presentation issue: it can erase a legitimate instance at object boundaries, which is exactly the scenario the paper claims to fix (e.g., sofa–pillow confusion in Fig. 2). The authors should quantify how often this occurs, for example by reporting a boundary-region ablation or by measuring the effect when the one-instance assumption is violated, and should discuss whether the mAcc gain is partly an artifact of assigning larger instances’ labels to smaller ones.
minor comments (5)
  1. [Abstract and Section IV] The abstract lists ICL as a dataset for quantitative experiments, but ICL is only used for qualitative query tests; please align the abstract with the actual evaluation.
  2. [Section III-D] “en core web sm” is a typo for the spaCy model “en_core_web_sm”; also, the spaCy model should be explicitly cited or listed in the implementation details.
  3. [Section II-C] In Related Works C, “OpenFusion [1] proposed a TSDF-based real-time scene reconstruction framework” cites [1] (Radford et al., CLIP); the correct reference is [4] (Yamazaki et al., OpenFusion).
  4. [Throughout] The metric notation is inconsistent: the manuscript alternates between “F-mIOU,” “f-mIoU,” and “F-mIoU.” Please standardize to a single notation.
  5. [Figure 4 caption] The phrase “weights of semantic embeddings are managed by inverting the physical coverage area as a minimum heap” is unclear; after correcting Eq. (4), please rewrite the caption to explain the heap ordering in terms of the corrected area measure.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular reasoning identified: the modules are defined from external inputs, evaluated against an external baseline, and supported by ablations; the Eq. (4) area-formula issue is a correctness risk, not a circular reduction.

full rationale

OpenFusion++'s derivation chain is self-contained. Confidence-guided sampling (Eqs. 2-3) uses SEEM confidence maps and depth as external inputs; the arg-max rule is a data-selection heuristic, and the assigned labels come from SEEM rather than from the reported mAcc/f-mIoU metrics. The adaptive semantic cache (Eq. 5) fuses observed embeddings with weights computed from masks and depth; none of the hyperparameters (alpha=0.8, cache size N=3, point count N=16) is stated to be fitted to the test outcomes, and the cache's contribution is tested by an ablation (Table II) against the same external OpenFusion baseline. The dual-path query framework uses fixed cosine similarity and a threshold alpha=0.8, with no dataset labels encoded in the retrieval equations. Table I compares directly with OpenFusion, and no self-citation or uniqueness theorem is load-bearing. The paper's own limitation statement about confidence sampling preventing later correction is an acknowledged robustness concern, not a circular dependency. The main genuine risk is Eq. (4): for a pinhole camera the physical area subtended by one pixel at depth D is proportional to D^2/(fx*fy), not fx*fy/D^2, so the claimed monotonic increase of A_t^k with global views is mathematically inverted. That is a correctness or implementation error that could invalidate the cache mechanism's explanation of its ablation gain, but it is not a case where the derivation reduces to its own inputs; the reported cache improvement is an empirical result, not a constructional equivalence. The abstract's mention of ICL experiments is not matched by Table I, which is a reporting inconsistency rather than circularity. Overall, no circular step meets the required evidentiary standard.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The main free parameters are the query threshold alpha and the cache size, both hand-set. The core axioms are the single-instance-per-voxel assumption, the reliability of SEEM confidence maps, the monotonicity of projected area, and the benefit of area-weighted embedding averaging. No new physical or mathematical entities are introduced.

free parameters (4)
  • alpha (query candidate threshold) = 0.8
    Defines the candidate set in Eq. 8 as the fraction of the top similarity score. Chosen by hand; no sensitivity analysis is reported.
  • cache size N (min-heap capacity) = 3
    Maximum number of embeddings stored per instance in the adaptive semantic cache; chosen by hand without an ablation on this value.
  • points per voxel block N = 16
    Fixed capacity of 3D points per voxel block; inherited from OpenFusion, but still a parameter that affects sampling quality.
  • voxel block size = 8/512 m
    Physical edge length of a voxel block; inherited from OpenFusion and used in the single-instance assumption.
assumptions (4)
  • domain assumption Each centimeter-scale voxel block contains only one instance.
    Used in Eq. 3 to select the point set with the highest average confidence as the sole label for the block. If a block straddles two instances, one instance is erased. The paper's conclusion acknowledges this risk.
  • domain assumption SEEM pixel-wise confidence maps correctly indicate boundary uncertainty.
    The confidence-guided sampling assumes that low confidence at eroded boundaries (e.g., sofa-pillow) is a reliable signal for preferring one instance over another. No independent validation of this mapping is given.
  • domain assumption Physical area A_t^k monotonically increases as the viewpoint observes more of an instance.
    Used to justify the min-heap ordering by area as an observation-completeness measure. Occlusions and viewpoint changes can cause the projected area to decrease, breaking the monotonicity.
  • domain assumption Area-weighted averaging of semantic embeddings improves global semantics without information loss.
    Eq. 5 fuses embeddings with area weights. The paper asserts this preserves feature diversity and prevents information loss, but provides no proof or ablation isolating this averaging rule.

how reviews work

0 comments
Cite this review

Pith. "Pith review of OpenFusion++: An Open-vocabulary Real-time Scene Understanding System." pith.science (2026). https://pith.science/paper/DYKESJ2I

@misc{pith2026250419266,
  author       = {Pith},
  title        = {Pith review of: OpenFusion++: An Open-vocabulary Real-time Scene Understanding System},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DYKESJ2I}},
  note         = {Machine review of arXiv:2504.19266}
}
read the original abstract

Real-time open-vocabulary scene understanding is essential for efficient 3D perception in applications such as vision-language navigation, embodied intelligence, and augmented reality. However, existing methods suffer from imprecise instance segmentation, static semantic updates, and limited handling of complex queries. To address these issues, we present OpenFusion++, a TSDF-based real-time 3D semantic-geometric reconstruction system. Our approach refines 3D point clouds by fusing confidence maps from foundational models, dynamically updates global semantic labels via an adaptive cache based on instance area, and employs a dual-path encoding framework that integrates object attributes with environmental context for precise query responses. Experiments on the ICL, Replica, ScanNet, and ScanNet++ datasets demonstrate that OpenFusion++ significantly outperforms the baseline in both semantic accuracy and query responsiveness.

Figures

Figures reproduced from arXiv: 2504.19266 by the authors.

Figure 1
Figure 1. Overview of OpenFusion++ and its three core modules. 1) Real-time TSDF-based geometric reconstruction that [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 3
Figure 3. Sampling strategies within voxel blocks. The figure [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figure 4
Figure 4. Semantic cache. The figure shows the process of [PITH_FULL_IMAGE:figures/full_fig_p004_4.png] view at source ↗
Figures from the paper (4 more)
Figure 6
Figure 6. Figure 6: Qualitative experimental results. Based on the list of categories corresponding to each scenario, we obtain the semantic [PITH_FULL_IMAGE:figures/full_fig_p006_6.png]
Figure 7
Figure 7. Figure 7: Visualisation of query results. The figure shows the results of the response given by the system for a given nested [PITH_FULL_IMAGE:figures/full_fig_p006_7.png]
Figure 8
Figure 8. Figure 8: Ablation studies of map update strategies. The black dashed line connects multiple instances with the same semantics. [PITH_FULL_IMAGE:figures/full_fig_p007_8.png]
Figure 9
Figure 9. Figure 9: Results of query ablation experiments. Two types [PITH_FULL_IMAGE:figures/full_fig_p007_9.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

28 extracted references · 11 canonical work pages

  1. [1]

    Learning transferable visual models from natural language supervision,

    A. Radford, J. W. Kim, C. Hallacy, A. Ramesh, G. Goh, S. Agarwal, G. Sastry, A. Askell, P. Mishkin, J. Clark et al., “Learning transferable visual models from natural language supervision,” in International conference on machine learning . PMLR, 2021, pp. 8748–8763

  2. [2]

    Towards Real-Time Open-Vocabulary Video Instance Segmentation

    B. Yan, M. Sundermeyer, D. J. Tan, H. Lu, and F. Tombari, “To- wards real-time open-vocabulary video instance segmentation,” arXiv preprint arXiv:2412.04434, 2024

  3. [3]

    Segment anything,

    A. Kirillov, E. Mintun, N. Ravi, H. Mao, C. Rolland, L. Gustafson, T. Xiao, S. Whitehead, A. C. Berg, W.-Y . Lo et al. , “Segment anything,” in Proceedings of the IEEE/CVF International Conference on Computer Vision , 2023, pp. 4015–4026

  4. [4]

    Open-fusion: Real-time open-vocabulary 3d mapping and queryable scene representation,

    K. Yamazaki, T. Hanyu, K. V o, T. Pham, M. Tran, G. Doretto, A. Nguyen, and N. Le, “Open-fusion: Real-time open-vocabulary 3d mapping and queryable scene representation,” in 2024 IEEE Interna- tional Conference on Robotics and Automation (ICRA) . IEEE, 2024, pp. 9411–9417

  5. [5]

    Segment everything everywhere all at once,

    X. Zou, J. Yang, H. Zhang, F. Li, L. Li, J. Wang, L. Wang, J. Gao, and Y . J. Lee, “Segment everything everywhere all at once,”Advances in Neural Information Processing Systems , vol. 36, 2024

  6. [6]

    Emerging properties in self-supervised vision trans- formers,

    M. Caron, H. Touvron, I. Misra, H. J ´egou, J. Mairal, P. Bojanowski, and A. Joulin, “Emerging properties in self-supervised vision trans- formers,” in Proceedings of the IEEE/CVF international conference on computer vision , 2021, pp. 9650–9660

  7. [7]

    Dinov2: Learning robust visual features without supervision,

    M. Oquab, T. Darcet, T. Moutakanni, H. V o, M. Szafraniec, V . Khali- dov, P. Fernandez, D. Haziza, F. Massa, A. El-Nouby et al., “Dinov2: Learning robust visual features without supervision,” arXiv preprint arXiv:2304.07193, 2023

  8. [8]

    Masked autoencoders are scalable vision learners,

    K. He, X. Chen, S. Xie, Y . Li, P. Doll ´ar, and R. Girshick, “Masked autoencoders are scalable vision learners,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , 2022, pp. 16 000–16 009

Show all 28 references
  1. [9]

    Groupvit: Semantic segmentation emerges from text su- pervision,

    J. Xu, S. De Mello, S. Liu, W. Byeon, T. Breuel, J. Kautz, and X. Wang, “Groupvit: Semantic segmentation emerges from text su- pervision,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2022, pp. 18 134–18 144

  2. [10]

    Segclip: Patch aggregation with learnable centers for open-vocabulary semantic segmentation,

    H. Luo, J. Bao, Y . Wu, X. He, and T. Li, “Segclip: Patch aggregation with learnable centers for open-vocabulary semantic segmentation,” in International Conference on Machine Learning . PMLR, 2023, pp. 23 033–23 044

  3. [11]

    Conceptfusion: Open-set multimodal 3d mapping,

    K. M. Jatavallabhula, A. Kuwajerwala, Q. Gu, M. Omama, T. Chen, A. Maalouf, S. Li, G. Iyer, S. Saryazdi, N. Keetha et al. , “Conceptfusion: Open-set multimodal 3d mapping,” arXiv preprint arXiv:2302.07241, 2023

  4. [12]

    Openmask3d: Open-vocabulary 3d instance segmen- tation,

    A. Takmaz, E. Fedele, R. W. Sumner, M. Pollefeys, F. Tombari, and F. Engelmann, “Openmask3d: Open-vocabulary 3d instance segmen- tation,” arXiv preprint arXiv:2306.13631 , 2023

  5. [13]

    Opensu3d: Open world 3d scene understanding using foundation models,

    R. Mohiuddin, S. M. Prakhya, F. Collins, Z. Liu, and A. Borrmann, “Opensu3d: Open world 3d scene understanding using foundation models,” arXiv preprint arXiv:2407.14279 , 2024

  6. [14]

    Open3dis: Open-vocabulary 3d instance segmentation with 2d mask guidance,

    P. Nguyen, T. D. Ngo, E. Kalogerakis, C. Gan, A. Tran, C. Pham, and K. Nguyen, “Open3dis: Open-vocabulary 3d instance segmentation with 2d mask guidance,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2024, pp. 4018–4028

  7. [15]

    Openins3d: Snap and lookup for 3d open-vocabulary instance seg- mentation,

    Z. Huang, X. Wu, X. Chen, H. Zhao, L. Zhu, and J. Lasenby, “Openins3d: Snap and lookup for 3d open-vocabulary instance seg- mentation,” in European Conference on Computer Vision . Springer, 2024, pp. 169–185

  8. [16]

    Openscene: 3d scene understanding with open vocabularies,

    S. Peng, K. Genova, C. Jiang, A. Tagliasacchi, M. Pollefeys, T. Funkhouser et al. , “Openscene: 3d scene understanding with open vocabularies,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , 2023, pp. 815–824

  9. [17]

    Sam3d: Segment anything in 3d scenes,

    Y . Yang, X. Wu, T. He, H. Zhao, and X. Liu, “Sam3d: Segment anything in 3d scenes,” arXiv preprint arXiv:2306.03908 , 2023

  10. [18]

    Maskclustering: View consensus based mask graph clustering for open-vocabulary 3d in- stance segmentation,

    M. Yan, J. Zhang, Y . Zhu, and H. Wang, “Maskclustering: View consensus based mask graph clustering for open-vocabulary 3d in- stance segmentation,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2024, pp. 28 274–28 284

  11. [19]

    Embod- iedsam: Online segment any 3d thing in real time,

    X. Xu, H. Chen, L. Zhao, Z. Wang, J. Zhou, and J. Lu, “Embod- iedsam: Online segment any 3d thing in real time,” arXiv preprint arXiv:2408.11811, 2024

  12. [20]

    Fast segment anything,

    X. Zhao, W. Ding, Y . An, Y . Du, T. Yu, M. Li, M. Tang, and J. Wang, “Fast segment anything,” arXiv preprint arXiv:2306.12156 , 2023

  13. [21]

    Panoslam: Panoptic 3d scene reconstruction via gaussian slam,

    R. Chen, Z. Wang, J. Wang, Y . Ma, M. Gong, W. Wang, and T. Liu, “Panoslam: Panoptic 3d scene reconstruction via gaussian slam,” arXiv preprint arXiv:2501.00352, 2024

  14. [22]

    3d gaussian splatting for real-time radiance field rendering

    B. Kerbl, G. Kopanas, T. Leimk ¨uhler, and G. Drettakis, “3d gaussian splatting for real-time radiance field rendering.” ACM Trans. Graph., vol. 42, no. 4, pp. 139–1, 2023

  15. [23]

    Ovo-slam: Open- vocabulary online simultaneous localization and mapping,

    T. B. Martins, M. R. Oswald, and J. Civera, “Ovo-slam: Open- vocabulary online simultaneous localization and mapping,” arXiv preprint arXiv:2411.15043, 2024

  16. [24]

    Alpha-clip: A clip model focusing on wherever you want,

    Z. Sun, Y . Fang, T. Wu, P. Zhang, Y . Zang, S. Kong, Y . Xiong, D. Lin, and J. Wang, “Alpha-clip: A clip model focusing on wherever you want,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2024, pp. 13 019–13 029

  17. [25]

    A benchmark for rgb-d visual odometry, 3d reconstruction and slam,

    A. Handa, T. Whelan, J. McDonald, and A. J. Davison, “A benchmark for rgb-d visual odometry, 3d reconstruction and slam,” in 2014 IEEE international conference on Robotics and automation (ICRA) . IEEE, 2014, pp. 1524–1531

  18. [26]

    Scannet: Richly-annotated 3d reconstructions of indoor scenes,

    A. Dai, A. X. Chang, M. Savva, M. Halber, T. Funkhouser, and M. Nießner, “Scannet: Richly-annotated 3d reconstructions of indoor scenes,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2017, pp. 5828–5839

  19. [27]

    Scannet++: A high- fidelity dataset of 3d indoor scenes,

    C. Yeshwanth, Y .-C. Liu, M. Nießner, and A. Dai, “Scannet++: A high- fidelity dataset of 3d indoor scenes,” in Proceedings of the IEEE/CVF International Conference on Computer Vision , 2023, pp. 12–22

  20. [28]

    The replica dataset: A digital replica of indoor spaces,

    J. Straub, T. Whelan, L. Ma, Y . Chen, E. Wijmans, S. Green, J. J. Engel, R. Mur-Artal, C. Ren, S. Verma et al. , “The replica dataset: A digital replica of indoor spaces,” arXiv preprint arXiv:1906.05797 , 2019

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.