Pith. sign in

REVIEW 4 major objections 5 minor 1 cited by

Multi-robot autonomous 3D reconstruction using Gaussian splatting with Semantic guidance

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

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper proposes a centralized multi-robot 3D reconstruction framework that uses 3D Gaussian splatting (3DGS) alongside online open-vocabulary semantic segmentation, claiming the first system of its kind.

desk verdict A competent multi-robot 3DGS reconstruction system whose semantic-gating assumption is the load-bearing weakness. read the letter →

arxiv 2412.02249 v1 pith:TQVGZMBI submitted 2024-12-03 cs.RO cs.CV

Jing Zeng , Qi Ye , Tianle Liu , Yang Xu , Jin Li , Jinming Xu , Liang Li , Jiming Chen This is my paper · ORCID
classification cs.ROcs.CV
keywords 3DGaussiansplattingmulti-robotreconstructionautonomousexplorationopen-vocabularysemanticsegmentationviewplanningsurfaceuncertaintytaskassignmentindoorscene
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

The paper claims that multi-robot autonomous 3D reconstruction can be made faster and more accurate by focusing each robot's scanning on semantically identifiable objects that are still incomplete. It presents a centralized framework built around 3D Gaussian splatting, where an online open-vocabulary segmenter identifies object instances in the partial point cloud, and the surface uncertainty from 3DGS pinpoints which parts of those instances are poorly reconstructed. The claimed result is the highest reconstruction quality among the compared planning methods, with planning time reduced to a small fraction of prior multi-robot systems. The significance is that large indoor scenes, which are slow for a single robot to cover, could now be reconstructed by teams that avoid wasting views on already-finished regions or on noisy uncertainty hotspots.

What carries the argument

The load-bearing mechanism is the instance-uncertainty-guided reconstruction task generator. Surface points from occupied hash voxels carry a cached 3DGS loss as their uncertainty; an open-vocabulary segmenter (OVIR-3D) clusters those points into instances; a softmax over ScanNet200 similarity scores with temperature $\lambda_e=50$ produces an objectness score, and thresholds $C_{\min}=0.2$ and $C_{\max}=0.6$ discard instances that are either too noisy or already well reconstructed. For each remaining instance, points of interest are selected greedily by uncertainty with a minimum spacing of $d_{\mathrm{POI}}=1.2\,\mathrm{m}$, candidate viewpoints are sampled in empty space, and the view maximizing information gain $g(v)=\sum_k \sigma_k e^{-0.5 d_{v,k}}$ (where $\sigma_k$ is the surface uncertainty and $d_{v,k}$ the distance to a visible surface point) becomes a reconstruction task. This machinery converts a scattered uncertainty field into a small set of focused, semantically grounded scan targets, which is what the paper argues avoids local optima and redundant views.

What would settle it

Run the pipeline in an indoor scene containing object categories not covered by ScanNet200, and record which instances pass the objectness filter during the first few reconstruction rounds. If many incomplete objects receive top-1 softmax scores below $C_{\min}=0.2$, or many already-complete objects score above $C_{\max}=0.6$, then the generated reconstruction tasks are misdirected. A threshold sweep on a held-out scene that changes final reconstruction quality by more than the reported margins would demonstrate that the claim is scene-specific rather than general.

Watch

Extended reading notes

Core claim

The central claim is that coupling 3DGS surface uncertainty with open-vocabulary instance segmentation yields a better next-view signal than surface uncertainty alone, and that separating mode assignment from task assignment makes the NP-hard multi-robot planning problem tractable. Concretely, the method projects per-frame color and depth losses into occupied voxels to get a surface uncertainty field, feeds the surface points to an online open-vocabulary 3D instance segmenter, computes an objectness score for each instance against the ScanNet200 vocabulary, keeps only instances with intermediate scores, and samples viewpoints around the highest-uncertainty points of those instances. Robots are then split into exploration and reconstruction modes by a global task ratio plus local task counts, and tasks within each mode are clustered with a modified K-means that balances both the number of tasks and the internal travel distance per robot. In experiments across three indoor scenes, the paper reports higher PSNR, lower accuracy and completion error, and higher recall than the compared single- and multi-robot planners, while cutting per-round planning time from tens of seconds to a few seconds.

Load-bearing premise

The whole approach depends on the open-vocabulary segmenter returning trustworthy objectness scores for partially scanned objects in real time; if the top-category probability is unreliable or the fixed thresholds are scene-dependent, reconstruction tasks get aimed at the wrong regions and the claimed quality and efficiency gains disappear.

Editorial extensions

If this is right

  • If the central claim holds, robotic teams can reconstruct large indoor scenes with fewer total views, because scans are concentrated on incomplete objects rather than spread across all high-uncertainty noise.
  • The separation of mode assignment from task assignment removes the repeated TSP solving that dominates planning time in prior multi-robot planners, making the approach scale better as the number of tasks grows.
  • The improved K-means objective, which balances both task count and internal travel distance, should prevent the long single-robot paths that cause energy-limited robots to truncate their tours and leave parts of the scene unscanned.
  • The method is demonstrated on real robots, suggesting that the combination of 3DGS uncertainty, ASH geometry, and semantic guidance can run online in a centralized multi-robot setting.
  • The fixed objectness thresholds and the use of the ScanNet200 vocabulary imply a direct dependence on the segmenter's open-vocabulary quality, so improvements in that segmenter would translate directly into better reconstruction task generation.

Reading between the lines

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

  • A natural extension would be to make the objectness thresholds adaptive per scene or per object category, since fixed $C_{\min}$ and $C_{\max}$ values are the most scene-sensitive part of the pipeline.
  • The same instance-uncertainty signal could be used in single-robot exploration, replacing frontier-only coverage objectives with a semantic-completeness objective that explicitly prioritizes incomplete objects.
  • For known environments, swapping the open-vocabulary segmenter for a faster closed-set detector could reduce latency while retaining the semantic guidance, at the cost of generality.
  • The centralized design's communication load is acknowledged by the authors as future work; a distributed variant would need to share only task centroids and instance labels rather than the full map and uncertainty field.
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 paper proposes a centralized multi-robot autonomous 3D reconstruction framework based on 3D Gaussian splatting (3DGS), with three main components: perception (3DGS, ASH geometry, OVIR-3D open-vocabulary segmentation), semantic-guided reconstruction task generation, and hierarchical planning with global-local mode assignment and an improved K-means task clustering. The central claims are that integrating online open-vocabulary semantic segmentation with 3DGS surface uncertainty focuses view sampling on incomplete objects, and that the proposed mode/task assignment achieves both high reconstruction quality and low planning time. Experiments are conducted in three simulated indoor scenes (QaLdn, Nicut, Oyens) with four robots, comparing against two multi-robot baselines (ACAMS and MS3DSR) and several ablations (V1-V6), plus a qualitative real-robot deployment.

Significance. If the results hold, the paper makes a useful contribution by demonstrating that semantic segmentation can be combined with 3DGS uncertainty in a multi-robot planning loop to avoid local minima and improve reconstruction quality without expensive point-cloud completion or model databases. The systematic ablation (V1-V6) is a strength, and the comparison against two existing multi-robot methods is informative. The real-robot demonstration, while qualitative, adds credibility. The main caveat is that the semantic completeness signal (the objectness score) is used as a load-bearing gating mechanism without calibration or sensitivity analysis, so the validity of the reported gains depends on an unvalidated proxy. If that issue is resolved, the paper would likely be of interest to the robotics and reconstruction communities.

major comments (4)
  1. [Section IV-A.2, Section IV-B] The objectness score C_1^i, defined as the maximum softmax probability over ScanNet200 classes after scaling by lambda_e=50, is used as a direct proxy for reconstruction completeness: instances with C_1^i>Cmax=0.6 are treated as already well reconstructed, and those below Cmin=0.2 as noise. This is a key load-bearing assumption because Table I shows that switching from surface-uncertainty-only (V3) to semantic guidance (V4-V6) produces substantial quality gains. However, no calibration evidence is provided linking classification confidence to geometric completeness. A partially scanned object can have a high-confidence label, while a fully scanned low-texture object may have ambiguous, low-confidence CLIP features. The fixed thresholds are used across all three scenes without sensitivity analysis. Please provide an evaluation of how C_1^i correlates with actual completeness (e.g., using ground-truth geometry in the simulated scenes), or at least a threshold sweep (e.g., varying Cmin and Cmax) to show the results are not artifacts of the chosen values.
  2. [Section IV-B, Table I] The experimental protocol appears to involve a single run per configuration, with no reported variance, multiple seeds, or statistical testing. Since several comparisons (e.g., V5 versus V6 in QaLdn: PSNR 21.89 vs 22.75; Nicut: 22.84 vs 24.28; Oyens: 23.35 vs 24.81) are clear, but other differences (e.g., Acc values) are small, the lack of error bars makes it difficult to assess whether the improvements are significant. Please report means and standard deviations over at least three independent runs, or justify why variance is negligible.
  3. [Section III-D, Eq. (7)] The efficiency claim "superior planning efficiency compared to existing multi-robot methods" is based on TGP (total planning time), but the path length P.L. is not consistently better: in QaLdn and Nicut, Ours has longer P.L. than MS3DSR (167.77 vs 121.90 and 131.18 vs 120.16), and only marginally better than ACAMS in some scenes. Moreover, it is unclear whether ACAMS and MS3DSR were run under identical conditions (same number of robots, same maximum planned views, same trajectory execution length, same underlying 3DGS/ASH representations). Without this detail, the comparison may not be apples-to-apples. Please clarify the evaluation protocol and also discuss the trade-off between planning time and path length rather than calling both "efficiency" interchangeably.
  4. [Section IV-A.2] The improved K-means objective mixes different physical quantities without stated weights: D_r is a sum of Euclidean distances (meters), while (N^M_r - N)^2 and |D_r - D| are dimensionless counts and distances, respectively. No weighting coefficients are defined, so the relative importance of movement cost versus load balancing is unspecified. In addition, the manuscript does not explain how the optimization in (7) is performed (e.g., iterative assignment with restarts, a local search over centroids, or an exact solver). Please specify the algorithm, including how the two terms are normalized or weighted, and how the number of clusters is chosen.
minor comments (5)
  1. [Section III-D.2] The heading "Sing-robot view path planning" contains a typo; it should be "Single-robot view path planning".
  2. [Fig. 2] In Fig. 2, the label "Uncers" appears to be a fragment; it should be "Uncertainty" or "Instance uncertainty" for clarity.
  3. [Section III-C.2] The notation for reconstruction tasks is inconsistent: the text defines T_rec = {T_rec_1, T_rec_2, ..., T_rec_Nrec}, while Algorithm 1 outputs T_rec as a set of T_rec_i, but line 7 uses v_rec_i and line 8 assigns T_rec_i <- v_rec_i. Please unify the notation.
  4. [Section IV-D] The real-robot experiment reports only qualitative results and no quantitative reconstruction metrics or comparison with baselines; it would be helpful to state explicitly that this is a feasibility demonstration and to provide quantitative measures if available.
  5. [Section I] The claim of being "the first 3DGS-based centralized multi-robot autonomous 3D reconstruction framework" should be substantiated with a broader literature search; the related work only cites GS-Planner as the single-robot 3DGS method, but there may be other concurrent or recent multi-robot 3DGS systems that should be discussed.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular reduction: the semantic gating and multi-robot planning are empirical and benchmarked against external methods.

full rationale

The claimed contributions are not equivalent to their inputs by construction. Algorithm 1's reconstruction-instance generation uses OVIR-3D's max-softmax objectness score as a heuristic gate, but the downstream tasks are driven by 3DGS surface uncertainty Ugs (cached per-voxel projection loss, Eq. 2), and the reported metrics (PSNR, Accuracy, Completion, Recall) are measured on the final 3DGS/ASH reconstructions, not on the gating scores or any fitted constant. The information-gain viewpoint selection (Eq. 5) and the ATSP/K-means planning objectives are standard geometric optimization criteria, and the experimental comparison in Tables I-II includes external baselines (Fuel, ACAMS, MS3DSR) with independent implementations. The paper does reuse the authors' prior AIISRFE modules for frontier exploration and ATSP details, but these are published building blocks that are also instantiated as the V3 baseline; the central 'semantic guidance + mode/task assignment' claim is not justified by citing that prior work. No equation or fitted parameter is renamed as a prediction. The fixed thresholds Cmin/Cmax are an unvalidated robustness concern, not a circular step.

Assumptions & free parameters 11 free parameters · 6 assumptions · 0 invented entities

The central claim rests on a stack of reused components (Gaussian-SLAM, ASH, OVIR-3D, Fuel, ATSP) and a set of manually chosen thresholds. No new physical entity is introduced. The main burden is the validity of the semantic and uncertainty proxies and the heuristic MDMTSP decomposition.

free parameters (11)
  • lambda_d = 0.5
    Weight for depth loss in Lproj (Eq. 2); chosen by hand to balance color and depth.
  • N_down = 5
    Surface point downsampling ratio in reconstruction task generation (Algorithm 1 line 4); affects number of POIs and runtime.
  • d_POI = 1.2 m
    Minimum distance between selected points of interest in each instance (Algorithm 1 line 5); controls viewpoint density.
  • lambda_e = 50
    Scaling factor on CLIP similarity scores before softmax in objectness computation (Section III-C2); sharpens class probabilities.
  • C_min = 0.2
    Lower objectness threshold; instances below are excluded as CLIP-noise-affected.
  • C_max = 0.6
    Upper objectness threshold; instances above are considered already well reconstructed and excluded.
  • d_local = 6 m
    Local range for counting tasks to decide robot mode (Section III-D1); arbitrates exploration vs reconstruction mode.
  • L_exec = 6 m
    Maximum execution path length per planning round (Section III-D2); controls how many viewpoints are executed.
  • occupied voxel resolution = 0.05 m
    Resolution of Hocc used for loss caching and surface point generation (Section III-B1); also ASH pruning distance threshold is 0.05 m.
  • max planned views per scene = 600/600/500
    Per-scene caps on planned views for QaLdn, Nicut, and Oyens in IV-A.2; encodes scene-scale prior and affects coverage.
  • viewpoint sampling interval t = 0.4 s
    Time interval along B-spline trajectory to sample executed viewpoints (Section III-D2).
assumptions (6)
  • domain assumption OVIR-3D returns meaningful 3D instance segments from the online partial point cloud S in real time.
    Used in Section III-B3 and Algorithm 1; the quality of semantic guidance depends on reliable segmentation of noisy, incomplete geometry.
  • domain assumption Surface uncertainty Ugs from cached projection loss Lproj is a valid proxy for reconstruction quality.
    Section III-B1; view sampling targets high-loss regions, so the metric must correlate with actual geometric error.
  • domain assumption ScanNet200 vocabulary and CLIP similarity reliably separate object categories after softmax scaling.
    Section III-C2; objectness thresholds Cmin and Cmax rely on these scores to identify incomplete instances.
  • ad hoc to paper Hierarchical decomposition of MDMTSP into mode assignment, Euclidean K-means clustering, and per-robot ATSP loses little optimality.
    Section III-D; no guarantee is given that Euclidean-distance clustering approximates TSP-tour cost, and path length results show it does not always reduce total path length.
  • domain assumption ASH geometry prunes noisy Gaussians without removing valid surface.
    Section III-B2; the 0.05 m nearest-neighbor pruning threshold assumes ASH surface points are accurate.
  • standard math ATSP solver gives near-optimal per-robot tours.
    Section III-D2; standard assumption for TSP solvers.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Multi-robot autonomous 3D reconstruction using Gaussian splatting with Semantic guidance." pith.science (2026). https://pith.science/paper/TQVGZMBI

@misc{pith2026241202249,
  author       = {Pith},
  title        = {Pith review of: Multi-robot autonomous 3D reconstruction using Gaussian splatting with Semantic guidance},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TQVGZMBI}},
  note         = {Machine review of arXiv:2412.02249}
}
read the original abstract

Implicit neural representations and 3D Gaussian splatting (3DGS) have shown great potential for scene reconstruction. Recent studies have expanded their applications in autonomous reconstruction through task assignment methods. However, these methods are mainly limited to single robot, and rapid reconstruction of large-scale scenes remains challenging. Additionally, task-driven planning based on surface uncertainty is prone to being trapped in local optima. To this end, we propose the first 3DGS-based centralized multi-robot autonomous 3D reconstruction framework. To further reduce time cost of task generation and improve reconstruction quality, we integrate online open-vocabulary semantic segmentation with surface uncertainty of 3DGS, focusing view sampling on regions with high instance uncertainty. Finally, we develop a multi-robot collaboration strategy with mode and task assignments improving reconstruction quality while ensuring planning efficiency. Our method demonstrates the highest reconstruction quality among all planning methods and superior planning efficiency compared to existing multi-robot methods. We deploy our method on multiple robots, and results show that it can effectively plan view paths and reconstruct scenes with high quality.

Figures

Figures reproduced from arXiv: 2412.02249 by the authors.

Figure 1
Figure 1. (a) Segmented results (Top) and Surface uncertainty (Bottom) from reconstruction iterations; (b) Planned trajectories [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. The pipeline of our proposed method. (a) (b) (c) Free Occupied Unknown Frontiers Exploration tasks Exploration mode path Exploration mode clusters Reconstruction mode clusters Reconstruction mode path Reconstruction tasks Obstacles POIs Objects Robots [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Overview of our method. (a) Semantic-guided reconstruction task generation. (b) Multi-robot collaboration for mode [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Comparison with different methods. Top: novel view synthesis from 3DGS; Bottom: reconstructed meshes from ASH. [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: Comparison of trajectories with different methods. [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. FlyMeThrough: Human-AI Collaborative 3D Indoor Mapping with Commodity Drones

    cs.HC 2025-08 conditional novelty 5.0 of 10

    A commodity-drone, RGB-only pipeline with human-AI annotation produces 3D indoor maps with localized points of interest, evaluated in 11 of 12 scanned buildings.

Reference graph

Works this paper leans on

27 extracted references · 22 canonical work pages · cited by 1 Pith paper

  1. [1]

    Multi-robot collaborative dense scene reconstruction

    Siyan Dong, Kai Xu, Qiang Zhou, Andrea Tagliasacchi, Shiqing Xin, Matthias Nießner, and Baoquan Chen. Multi-robot collaborative dense scene reconstruction. ACM Transactions on Graphics, 38(4):1–16, 2019

    work page 2019

  2. [2]

    ASH: A modern framework for parallel spatial hashing in 3D perception

    Wei Dong, Yixing Lao, Michael Kaess, and Vladlen Koltun. ASH: A modern framework for parallel spatial hashing in 3D perception. IEEE Transactions on Pattern Analysis and Machine Intelligence, 45(5):5417– 5435, 2022

    work page 2022

  3. [3]

    Conceptgraphs: Open- vocabulary 3d scene graphs for perception and planning

    Qiao Gu, Alihusein Kuwajerwala, Sacha Morin, Krishna Murthy Jatavallabhula, Bipasha Sen, Aditya Agarwal, Corban Rivera, William Paul, Kirsty Ellis, Rama Chellappa, et al. Conceptgraphs: Open- vocabulary 3d scene graphs for perception and planning. arXiv preprint arXiv:2309.16650, 2023

    arXiv 2023

  4. [4]

    Asyn- chronous collaborative autoscanning with mode switching for multi- robot scene reconstruction

    Junfu Guo, Changhao Li, Xi Xia, Ruizhen Hu, and Ligang Liu. Asyn- chronous collaborative autoscanning with mode switching for multi- robot scene reconstruction. ACM Transactions on Graphics, 41(6):1–13, 2022

    work page 2022

  5. [5]

    Fiesta: Fast incremental euclidean distance fields for online motion planning of aerial robots

    Luxin Han, Fei Gao, Boyu Zhou, and Shaojie Shen. Fiesta: Fast incremental euclidean distance fields for online motion planning of aerial robots. In 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages 4423–4430. IEEE, 2019

    work page 2019

  6. [6]

    A multirobot system for 3-d surface reconstruc- tion with centralized and distributed architectures

    Guillaume Hardouin, Julien Moras, Fabio Morbidi, Julien Marzat, and El Mustapha Mouaddib. A multirobot system for 3-d surface reconstruc- tion with centralized and distributed architectures. IEEE Transactions on Robotics, 39(4):2623–2638, 2023

    work page 2023

  7. [7]

    H {2}-mapping: Real-time dense mapping using hierarchical hybrid representation

    Chenxing Jiang, Hanwen Zhang, Peize Liu, Zehuan Yu, Hui Cheng, Boyu Zhou, and Shaojie Shen. H {2}-mapping: Real-time dense mapping using hierarchical hybrid representation. IEEE Robotics and Automation Letters, 2023. 1https://azure.microsoft.com/services/kinect-dk/ 2https://www.intelrealsense.com/tracking-camera-t265/

    work page 2023

  8. [8]

    Gs-planner: A gaussian- splatting-based planning framework for active high-fidelity reconstruc- tion

    Rui Jin, Yuman Gao, Haojian Lu, and Fei Gao. Gs-planner: A gaussian- splatting-based planning framework for active high-fidelity reconstruc- tion. arXiv preprint arXiv:2405.10142 , 2024

    arXiv 2024

Show all 27 references
  1. [9]

    3d gaussian splatting for real-time radiance field rendering

    Bernhard Kerbl, Georgios Kopanas, Thomas Leimk ¨uhler, and George Drettakis. 3d gaussian splatting for real-time radiance field rendering. ACM Trans. Graph., 42(4):139–1, 2023

    2023

  2. [10]

    Segment anything

    Alexander Kirillov, Eric Mintun, Nikhila Ravi, Hanzi Mao, Chloe Rolland, Laura Gustafson, Tete Xiao, Spencer Whitehead, Alexander C Berg, Wan-Yen Lo, et al. Segment anything. In Proceedings of the IEEE/CVF International Conference on Computer Vision , pages 4015– 4026, 2023

    2023

  3. [11]

    Multi- sensor next-best-view planning as matroid-constrained submodular max- imization

    Mikko Lauri, Joni Pajarinen, Jan Peters, and Simone Frintrop. Multi- sensor next-best-view planning as matroid-constrained submodular max- imization. IEEE Robotics and Automation Letters , 5(4):5323–5330, 2020

    2020

  4. [12]

    Object-aware guidance for autonomous scene reconstruction

    Ligang Liu, Xi Xia, Han Sun, Qi Shen, Juzhan Xu, Bin Chen, Hui Huang, and Kai Xu. Object-aware guidance for autonomous scene reconstruction. ACM Transactions on Graphics , 37(4):1–12, 2018

    2018

  5. [13]

    Ovir-3D: Open-vocabulary 3D instance retrieval without training on 3D data

    Shiyang Lu, Haonan Chang, Eric Pu Jing, Abdeslam Boularias, and Kostas Bekris. Ovir-3D: Open-vocabulary 3D instance retrieval without training on 3D data. In Conference on Robot Learning , pages 1610–

  6. [14]

    Gaussian splatting slam

    Hidenobu Matsuki, Riku Murai, Paul HJ Kelly, and Andrew J Davison. Gaussian splatting slam. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages 18039–18048, 2024

    2024

  7. [15]

    Nerf: Representing scenes as neural radiance fields for view synthesis

    B Mildenhall, PP Srinivasan, M Tancik, JT Barron, R Ramamoorthi, and R Ng. Nerf: Representing scenes as neural radiance fields for view synthesis. In European conference on computer vision , 2020

    2020

  8. [16]

    Habitat-matterport 3d dataset (HM3d): 1000 large-scale 3d environments for embodied AI

    Santhosh Kumar Ramakrishnan, Aaron Gokaslan, Erik Wijmans, Olek- sandr Maksymets, Alexander Clegg, John M Turner, Eric Undersander, Wojciech Galuba, Andrew Westbury, Angel X Chang, Manolis Savva, Yili Zhao, and Dhruv Batra. Habitat-matterport 3d dataset (HM3d): 1000 large-scal...

    2021

  9. [17]

    Neurar: Neural uncertainty for au- tonomous 3d reconstruction with implicit neural representations

    Yunlong Ran, Jing Zeng, Shibo He, Jiming Chen, Lincheng Li, Yingfeng Chen, Gimhee Lee, and Qi Ye. Neurar: Neural uncertainty for au- tonomous 3d reconstruction with implicit neural representations. IEEE Robotics and Automation Letters , 8(2):1125–1132, 2023

    2023

  10. [18]

    Language-grounded indoor 3d semantic segmentation in the wild

    David Rozenberszki, Or Litany, and Angela Dai. Language-grounded indoor 3d semantic segmentation in the wild. In European Conference on Computer Vision , pages 125–141. Springer, 2022

    2022

  11. [19]

    Faster: Fast and safe trajectory planner for flights in unknown environments

    Jesus Tordesillas, Brett T Lopez, and Jonathan P How. Faster: Fast and safe trajectory planner for flights in unknown environments. In 2019 IEEE/RSJ international conference on intelligent robots and systems (IROS), pages 1934–1940. IEEE, 2019

    2019

  12. [20]

    Zamir, Zhiyang He, Alexander Sax, Jitendra Malik, and Silvio Savarese

    Fei Xia, Amir R. Zamir, Zhiyang He, Alexander Sax, Jitendra Malik, and Silvio Savarese. Gibson Env: real-world perception for embodied agents. In Computer Vision and Pattern Recognition (CVPR), 2018 IEEE Conference on. IEEE, 2018

    2018

  13. [21]

    Monosdf: Exploring monocular geometric cues for neural implicit surface reconstruction

    Zehao Yu, Songyou Peng, Michael Niemeyer, Torsten Sattler, and Andreas Geiger. Monosdf: Exploring monocular geometric cues for neural implicit surface reconstruction. Advances in neural information processing systems, 35:25018–25032, 2022

    2022

  14. [22]

    Gaussian- slam: Photo-realistic dense slam with gaussian splatting

    Vladimir Yugay, Yue Li, Theo Gevers, and Martin R Oswald. Gaussian- slam: Photo-realistic dense slam with gaussian splatting. arXiv preprint arXiv:2312.10070, 2023

    2023 arXiv

  15. [23]

    Efficient view path planning for autonomous implicit reconstruction

    Jing Zeng, Yanxu Li, Yunlong Ran, Shuo Li, Fei Gao, Lincheng Li, Shibo He, Jiming Chen, and Qi Ye. Efficient view path planning for autonomous implicit reconstruction. In 2023 IEEE International Conference on Robotics and Automation (ICRA) , pages 4063–4069. IEEE, 2023

    2023

  16. [24]

    Autonomous implicit indoor scene reconstruction with frontier exploration

    Jing Zeng, Yanxu Li, Jiahao Sun, Qi Ye, Yunlong Ran, and Jiming Chen. Autonomous implicit indoor scene reconstruction with frontier exploration. In 2024 IEEE International Conference on Robotics and Automation (ICRA), pages 18041–18047. IEEE, 2024

    2024

  17. [25]

    Active scene understanding via online semantic reconstruction

    Lintao Zheng, Chenyang Zhu, Jiazhao Zhang, Hang Zhao, Hui Huang, Matthias Niessner, and Kai Xu. Active scene understanding via online semantic reconstruction. In Computer Graphics Forum , volume 38, pages 103–114. Wiley Online Library, 2019

    2019

  18. [26]

    Fuel: Fast UA V exploration using incremental frontier structure and hierarchical planning

    Boyu Zhou, Yichen Zhang, Xinyi Chen, and Shaojie Shen. Fuel: Fast UA V exploration using incremental frontier structure and hierarchical planning. IEEE Robotics and Automation Letters , 6(2):779–786, 2021

    2021

  19. [27]

    Detecting twenty-thousand classes using image-level supervision

    Xingyi Zhou, Rohit Girdhar, Armand Joulin, Philipp Kr ¨ahenb¨uhl, and Ishan Misra. Detecting twenty-thousand classes using image-level supervision. In European Conference on Computer Vision , pages 350–

Pith tools

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