REVIEW 4 major objections 4 minor 3 cited by
GauSS-MI: Gaussian Splatting Shannon Mutual Information for Active 3D Reconstruction
T0 review · 4 major / 4 minor · reviewed 2026-08-16 · deepseek-v4-flash
Pith's one-line read This paper claims that the visual information a new viewpoint would contribute to a 3D Gaussian Splatting map can be computed in real time as a Shannon mutual information, and that an active reconstruction system selecting views by this…
desk verdict A useful active-reconstruction heuristic whose Shannon-MI framing is not supported by the math; the system and experiments are worth a look, but the central derivation needs substantial correction. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing mechanism is the Gaussian Splatting Shannon Mutual Information identity, Eq. (20): for a candidate viewpoint the expected information gain is obtained by rasterizing $-\log P(r[i])$, the per-Gaussian surprise that the current model is reliable, weighted by the cumulative transmittance $T[i]$ along each ray and by a per-pixel measurement prior derived from rendered luminance. The update side is carried by a Bayesian log-odds recursion $l_{1:k}=l_{1:k-1}-\lambda_T T[i]\log(\lambda_L L_k)$, which folds the latest render loss into each Gaussian's reliability without storing past images. Because evaluation is one rasterization pass, the score's cost is $O(N_p N_g N_c)$ per decision step and does not grow with the number of already seen views.
What would settle it
Run the same active reconstruction pipeline on a fixed set of scenes with $\lambda_L$ and $\lambda_T$ swept over a grid (for example 0.5 to 5.0 and 1 to 15) while keeping everything else constant, and record both the rank order of candidate viewpoints and the final PSNR; if the chosen views and final quality change strongly across the grid, the reliability model is not carrying the claimed information.
Extended reading notes
Core claim
The central discovery is an explicit, closed-form mutual-information score for 3D Gaussian Splatting maps. For each Gaussian the paper maintains the log odds of the event that it renders correctly, updated by a binary Bayesian filter whose inverse sensor model maps a per-pixel color-depth loss $L_k$ and the Gaussian's transmittance $T[i]$ into a reliability probability $P(r[i]|Z_k)=1/((\lambda_L L_k)^{\lambda_T T[i]}+1)$. For an unobserved viewpoint, the expected Shannon mutual information between the map and the observation then collapses to Eq. (20), $I(r;z)=\sum_j P(z[j]|M[j])\sum_{i\in N[j]}-T[i]\log P(r[i])$, where $P(z[j]|M[j])$ is a sensor prior from the rendered luminance and the sum runs over Gaussians along each pixel ray. The paper argues that maximizing this quantity selects the next best view that most reduces expected map entropy, and that the same quantity provides a principled termination criterion.
Load-bearing premise
The load-bearing premise is Eq. (7), a hand-chosen inverse sensor model with fixed hyperparameters $\lambda_L=1.7$ and $\lambda_T=7.0$: if this function does not actually describe how likely a Gaussian is to be reliable for rendering, the whole uncertainty model and the mutual-information score built on it are not measuring what they claim.
Editorial extensions
If this is right
- Next-best-view selection can target visual fidelity directly: views are ranked by expected reduction of rendering uncertainty, not by how much unseen geometry they reveal.
- The per-step computation stays nearly constant as the map grows, since GauSS-MI evaluates only candidate views and folds prior observations into per-Gaussian probabilities during the map update.
- A simple, transparent termination rule becomes possible: stop when a threshold fraction (75% in the paper) of Gaussians reaches average reliability above 0.7; the reported PSNR saturates near that point.
- On fixed frame budgets the metric picks views that give higher PSNR than a random policy and is competitive with or better than a Fisher-information baseline, while running at roughly 182 fps in the reported setup.
- In full active reconstruction, the system reaches visual quality comparable to a NeRF-based active method with far fewer captured frames and shorter paths.
Reading between the lines
- The inverse sensor model in Eq. (7) is a hand-chosen function whose hyperparameters $\lambda_L=1.7$, $\lambda_T=7.0$ are tuned constants; fitting them to the actual Poisson-Gaussian noise statistics of the camera would turn the reliability probability into a calibrated sensor model instead of a heuristic.
- The independence assumption on Gaussian reliabilities ignores correlation between overlapping splats; extending the Bernoulli prior to a spatial Markov or covariance model could improve uncertainty ranking in texture-rich regions without changing the rasterization logic.
- The same derivation maps onto other differentiable scene representations: any renderer that can produce a per-primitive transmittance and a per-pixel loss gives an analogous rasterized mutual-information score, so the criterion is not specific to Gaussian splatting.
- Because the metric directly reports residual visual uncertainty, its value could serve as an online stopping signal or a confidence map for downstream tasks such as robotic inspection, not just as a view-ranking score.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper presents GauSS-MI, a metric intended to quantify the Shannon mutual information between a 3D Gaussian Splatting (3DGS) map and a candidate viewpoint, for use in active 3D reconstruction. The authors introduce a probabilistic reliability model for each Gaussian, update it with an inverse sensor model based on rendering loss, and derive a mutual information expression that is then used to select next best views in an active reconstruction system. The system is evaluated in simulation (three Flightmare scenes) and in real-world experiments with a robotic arm, comparing against FisherRF, FUEL, NARUTO, and random selection. The reported results show improved PSNR and efficiency, and the implementation is open-sourced.
Significance. If the central theoretical claim were correct, GauSS-MI would be a valuable real-time uncertainty metric for active 3DGS reconstruction, bridging information-theoretic view planning and high-fidelity visual reconstruction. The paper has notable strengths: it ships open-source code, presents extensive experiments including real-world validation, reports fast runtime (5.55 ms per evaluation), and includes uncertainty quantification comparisons (sparsification plots and AUSE) against FisherRF. However, the derivation of the mutual information contains a serious mathematical gap: Eq. (14) omits the unreliable-state term of the binary reliability variable, and Appendix A inverts the posterior odds. Consequently, the quantity computed in Eq. (20) is not Shannon mutual information as claimed, but a weighted heuristic. The core contribution of the paper is therefore not established by the supplied mathematics, despite the suggestive empirical results.
major comments (4)
- [§IV-C, Eq. (14)] The mutual information between a binary reliability variable r[i] and an observation z[j] is defined as a sum over both outcomes s=0 and s=1. Equation (14) computes only the s=1 term, P(z[j]=Z)P(r[i]|z[j]=Z) log(P(r[i]|z[j]=Z)/P(r[i])), omitting the s=0 term P(z[j]=Z)P(¬r[i]|z[j]=Z) log(P(¬r[i]|z[j]=Z)/P(¬r[i])). This omitted term is generically nonzero; for instance, with prior odds o=1, inverse sensor odds δ=3, and P(Z)=0.5, the included term is 0.152 while the exact conditional MI contribution is 0.066. Therefore the quantity in Eqs. (14)-(15) and ultimately Eq. (20) is not the Shannon mutual information of the described probabilistic model. This invalidates the paper's central claim that GauSS-MI measures Shannon mutual information.
- [Appendix A, Eqs. (26)-(27)] The derivation of the information gain function contains an algebraic error. With the definition o = P/(1-P), the correct inversion is P = o/(1+o). Equation (26) states P(r|Z1:k-1) = (1+o)/o, which is the reciprocal of the correct probability. Equation (27) similarly inverts the posterior odds. Although the final expression f(δ,o) in Eq. (28) may be consistent with the one-sided term if one starts from this inverted definition, the derivation as written is incorrect and the error is not acknowledged. A correct derivation starting from the proper posterior probability would produce a different expression unless the omitted binary outcome is also included.
- [§IV-C, Eq. (13)] The cumulative transmittance T[i] is inserted as a multiplicative weight inside the summation for mutual information. In information theory, mutual information is a sum of terms each involving a probability mass or density; T[i] is a rendering weight, not a probability of a map state. No step in the derivation justifies replacing the contribution of Gaussian i by T[i] times a per-Gaussian information gain. This is a heuristic weighting rather than a consequence of ShannNMI. The paper provides no argument for why a rendering weight should act as a probability weight in an information-theoretic sum, and the independence assumptions in the model do not yield this structure.
- [§IV-D, Eq. (19) and §V-C / §VIII] The expected GauSS-MI assumes L=0 for novel viewpoints, i.e., perfect future rendering, so that δ^{-1}=0 and the information gain reduces to -log(P(r[i])). This assumption removes any dependence on the candidate observation's predicted error and reduces the metric to a self-information of the current reliability estimate, which is not a predictive mutual information. Additionally, the sensor model P(z[j]|M[j]) in Eq. (18) is referenced to [10] but never specified, so the metric is not fully defined. Finally, the termination threshold φ=75% in Eq. (24) is set after observing the PSNR curve in §VI-F, as the authors themselves state in §VIII; this post hoc selection limits the claims about autonomous termination. These issues together mean that the empirical results, while suggestive of a useful heuristic, do not validate the stated theoretical contribution.
minor comments (4)
- [Table II] The row labeled 'hyperparameter on cumulative transmittance' lists 'λL 7.0' but the notation in the text and Eqs. (7)-(10) uses λT for this hyperparameter; the table should read λT = 7.0.
- [Eq. (22)] The notation σ(n)_f = 0 for n = 1,2,3 is unclear; it would be clearer to state that the higher derivatives of the viewpoint state are constrained to zero, the same for all components.
- [Figure 2] The figure caption says 'the hyperparameters λ are omitted for simplicity,' but the axis and curves would be easier to interpret if the chosen λ values (λL=1.7, λT=7.0) were stated in the caption or legend.
- [§IV-B, Eq. (7)] The inverse sensor model is introduced as P(r[i]|Zk) = 1 / ((λ_L L_k)^{λ_T T[i]} + 1), but the derivation from sensor noise characteristics is not given. The paper would benefit from either a justification from a physical noise model or an explicit statement that this is a heuristic choice.
Circularity Check
GauSS-MI is labelled 'Shannon mutual information' by a one-sided definition in Eq. (14), the T[i] weighting is inserted into the MI sum without derivation, and the termination threshold is tuned to the PSNR curve—so the central theoretical claim is partly definitional and the reported termination efficiency is post hoc.
-
self definitional
[Section IV-C, Eq. (14); Section IV-B definition of binary r; Appendix A Eq. (25)-(28)]
"From information theory [6, 18], the mutual information between two random variables is defined and can be organized as I(r[i];z[j]) := P(r[i], z[j] = Z) log( P(r[i], z[j] = Z) / (P(r[i])P(z[j] = Z)) ) = P(z[j] = Z) P(r[i]|z[j] = Z) log(P(r[i]|z[j] = Z)/P(r[i])) = P(z[j] = Z) f(δ[i](Z), o[i]_{1:k−1})"
In Sec. IV-B, r[i] is binary: P(r[i]) ∈ (0,1) and P(¯r[i]) = 1 − P(r[i]). The Shannon MI of a binary variable with an observation outcome Z is a sum over both outcomes, Σ_{s∈{r,¯r}} P(s,z[j]=Z) log(P(s,z[j]=Z)/(P(s)P(z[j]=Z))). Eq. (14) keeps only the s=r reliable term and then defines GauSS-MI from it; Eqs. (19)-(20) substitute f = −log P(r) into this same one-sided expression. The conclusion 'GauSS-MI is Shannon MI' is therefore true only under the paper's own re-definition of MI: the defining equation already omits the binary complement, so the claimed first-principles result is built into the construction rather than derived.
-
other
[Section IV-C, Eq. (13)]
"As z is a random variable with independence among elements, the total MI can be expressed as the summation of I(r;z[j]) between z[j] over all measurement beams j ∈ {1,··· ,nz} [18]. I(r;z) = nzX j=1 X i∈N [j] I(r[i];z[j])T [i]"
The cited independence property gives I(r;z) = Σ_j I(r;z[j]); it does not introduce a Gaussian transmittance T[i] inside the sum. Inserting the rendering weight T[i] into the 'total MI' equation makes the final GauSS-MI in Eq. (20) a loss-weighted rendering heuristic from the start. When Eq. (20) is later read back as the Shannon MI of a viewpoint, the T[i] factor is already part of the definition, so the metric's information-theoretic meaning is assumed rather than established.
1 more flagged steps
-
fitted input called prediction
[Section V-C, Table II; Section VI-F; Section VIII Limitations]
"The figure shows that once 75% of the Gaussians in the map are fully reconstructed, the PSNR reaches 29.44, with minimal further improvement even as the reconstruction process continues. ... the determination of the termination threshold φ for achieving high visual quality was made heuristically in our study, without a systematic investigation."
The termination threshold φ = 75% is justified by inspecting the PSNR-versus-done-percentage curve of the active runs; the same threshold then produces the Nf and PSNR numbers reported in Table III and Figure 9. Thus the claimed 'efficient termination at high visual quality' is not an independent prediction: it is a knob set after seeing the evaluation curve. The paper's own limitation admits that the threshold was heuristic and not systematically investigated.
full rationale
The empirical comparison against FisherRF/random with a fixed frame budget and external PSNR/SSIM/LPIPS metrics is not circular; those results stand or fall independently of the Eq. (14) labeling. The hand-set λL=1.7 and λT=7.0 and reward weights are arbitrary but not fitted to the reported PSNR values, so they contribute to correctness risk rather than circularity. However, the central theoretical claim 'GauSS-MI is Shannon mutual information' is self-definitional: Eq. (14) is a one-sided redefinition of MI, Eq. (13) inserts T[i] without derivation, and Eq. (20) is exactly that construction. Additionally, the termination threshold is selected from the same PSNR curve used to report termination performance. These couplings make the paper partially circular; no self-citation chain is load-bearing here.
Assumptions & free parameters
free parameters (5)
- λL =
1.7
- λT =
7.0
- Reward weights wI, wJ =
0.03, 0.01
- Termination thresholds τ, φ =
τ=0.7, φ=75%
- Sensor model P(z|M) =
unspecified
assumptions (6)
- domain assumption Each Gaussian's reliability probability is independent of the others.
- domain assumption Initial reliability is uninformative, P0(r)=P0(not r)=0.5.
- ad hoc to paper The inverse sensor model P(r[i]|Zk) = 1/((λL Lk)^{λT T[i]}+1) is a valid probabilistic description of rendering reliability.
- domain assumption For future novel viewpoints, the expected loss is zero, so δ^{-1}=0 and information gain collapses to -log P(r).
- domain assumption The measurement prior P(z[j]) equals P(z[j]|M[j]) with M[j] the expected luminance.
- standard math 3DGS rendering equations (1)-(3) from [19] and [24] are valid.
invented entities (1)
-
Reliability probability P(r[i]) for each 3D Gaussian
Cite this review
Pith. "Pith review of GauSS-MI: Gaussian Splatting Shannon Mutual Information for Active 3D Reconstruction." pith.science (2026). https://pith.science/paper/OT45SFNA
@misc{pith2026250421067,
author = {Pith},
title = {Pith review of: GauSS-MI: Gaussian Splatting Shannon Mutual Information for Active 3D Reconstruction},
year = {2026},
howpublished = {\url{https://pith.science/paper/OT45SFNA}},
note = {Machine review of arXiv:2504.21067}
}
read the original abstract
This research tackles the challenge of real-time active view selection and uncertainty quantification on visual quality for active 3D reconstruction. Visual quality is a critical aspect of 3D reconstruction. Recent advancements such as Neural Radiance Fields (NeRF) and 3D Gaussian Splatting (3DGS) have notably enhanced the image rendering quality of reconstruction models. Nonetheless, the efficient and effective acquisition of input images for reconstruction-specifically, the selection of the most informative viewpoint-remains an open challenge, which is crucial for active reconstruction. Existing studies have primarily focused on evaluating geometric completeness and exploring unobserved or unknown regions, without direct evaluation of the visual uncertainty within the reconstruction model. To address this gap, this paper introduces a probabilistic model that quantifies visual uncertainty for each Gaussian. Leveraging Shannon Mutual Information, we formulate a criterion, Gaussian Splatting Shannon Mutual Information (GauSS-MI), for real-time assessment of visual mutual information from novel viewpoints, facilitating the selection of next best view. GauSS-MI is implemented within an active reconstruction system integrated with a view and motion planner. Extensive experiments across various simulated and real-world scenes showcase the superior visual quality and reconstruction efficiency performance of the proposed system.
Figures
Figures from the paper (8 more)
Forward citations
Cited by 3 Pith papers
-
GO-PRE: Goal-Oriented Next-Best-View Selection via Predictive Rendering Entropy for Active 3D Reconstruction
GO-PRE proposes a next-best-view selection score that minimizes an upper bound on predictive rendering entropy over a user-specified target view manifold for 3D Gaussian Splatting.
-
DAV-GSWT: Diffusion-Active-View Sampling for Data-Efficient Gaussian Splatting Wang Tiles
DAV-GSWT uses diffusion priors and active view sampling to synthesize high-fidelity Gaussian Splatting Wang Tiles from minimal observations while preserving visual quality and tile transitions.
-
ObjSplat: Geometry-Aware Gaussian Surfels for Active Object Reconstruction
Coupling Gaussian-surfel reconstruction with back-face-aware uncertainty and next-best-path lookahead yields object scans that are more complete and photorealistic while reducing path length about 4–5× versus greedy planners.
Reference graph
Works this paper leans on
-
[10]
Practical poissonian-gaussian noise modeling and fitting for single-image raw-data
Alessandro Foi, Mejdi Trimeche, Vladimir Katkovnik, and Karen Egiazarian. Practical poissonian-gaussian noise modeling and fitting for single-image raw-data. IEEE transactions on image processing , 17(10):1737– 1754, 2008
work page 2008
-
[1]
Hierarchical coverage path planning in complex 3d en- vironments
Chao Cao, Ji Zhang, Matt Travers, and Howie Choset. Hierarchical coverage path planning in complex 3d en- vironments. In 2020 IEEE International Conference on Robotics and Automation (ICRA) , pages 3206–3212. IEEE, 2020
work page 2020
-
[2]
Information-theoretic planning with tra- jectory optimization for dense 3d mapping
Benjamin Charrow, Gregory Kahn, Sachin Patil, Sikang Liu, Ken Goldberg, Pieter Abbeel, Nathan Michael, and Vijay Kumar. Information-theoretic planning with tra- jectory optimization for dense 3d mapping. In Robotics: Science and Systems , volume 11, pages 3–12, 2015
work page 2015
-
[3]
Information-theoretic mapping using cauchy-schwarz quadratic mutual information
Benjamin Charrow, Sikang Liu, Vijay Kumar, and Nathan Michael. Information-theoretic mapping using cauchy-schwarz quadratic mutual information. In 2015 IEEE International Conference on Robotics and Automa- tion (ICRA), pages 4791–4798. IEEE, 2015
work page 2015
-
[4]
Activegamer: Active gaussian mapping through efficient rendering
Liyan Chen, Huangying Zhan, Kevin Chen, Xiangyu Xu, Qingan Yan, Changjiang Cai, and Yi Xu. Activegamer: Active gaussian mapping through efficient rendering. arXiv preprint arXiv:2501.06897 , 2025
arXiv 2025
-
[5]
Rapid exploration with multi-rotors: A frontier selection method for high speed flight
Titus Cieslewski, Elia Kaufmann, and Davide Scara- muzza. Rapid exploration with multi-rotors: A frontier selection method for high speed flight. In 2017 IEEE/RSJ International Conference on Intelligent Robots and Sys- tems (IROS), pages 2135–2142. IEEE, 2017
work page 2017
-
[6]
Information theory and the stock market
Thomas M Cover and Joy A Thomas. Information theory and the stock market. Elements of Information Theory. Wiley Inc., New York, pages 543–556, 1991
work page 1991
-
[7]
Chen Feng, Haojia Li, Fei Gao, Boyu Zhou, and Shao- jie Shen. Predrecon: A prediction-boosted planning framework for fast and high-quality autonomous aerial reconstruction. In 2023 IEEE International Conference on Robotics and Automation (ICRA) , pages 1207–1213. IEEE, 2023
work page 2023
Show all 43 references
-
[8]
Fc-planner: A skeleton-guided planning framework for fast aerial coverage of complex 3d scenes
Chen Feng, Haojia Li, Mingjie Zhang, Xinyi Chen, Boyu Zhou, and Shaojie Shen. Fc-planner: A skeleton-guided planning framework for fast aerial coverage of complex 3d scenes. In 2024 IEEE International Conference on Robotics and Automation (ICRA) , pages 8686–8692. IEEE, 2024
2024
-
[9]
Naruto: Neural active reconstruction from uncer- tain target observations
Ziyue Feng, Huangying Zhan, Zheng Chen, Qingan Yan, Xiangyu Xu, Changjiang Cai, Bing Li, Qilun Zhu, and Yi Xu. Naruto: Neural active reconstruction from uncer- tain target observations. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages...
2024
-
[11]
Bayes’ rays: Uncertainty quan- tification for neural radiance fields
Lily Goli, Cody Reading, Silvia Sell ´an, Alec Jacobson, and Andrea Tagliasacchi. Bayes’ rays: Uncertainty quan- tification for neural radiance fields. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 20061–20070, 2024
2024
-
[12]
Octomap: An efficient probabilistic 3d mapping framework based on octrees
Armin Hornung, Kai M Wurm, Maren Bennewitz, Cyrill Stachniss, and Wolfram Burgard. Octomap: An efficient probabilistic 3d mapping framework based on octrees. Autonomous robots, 34:189–206, 2013
2013
-
[13]
Un- certainty estimates and multi-hypotheses networks for optical flow
Eddy Ilg, Ozgun Cicek, Silvio Galesso, Aaron Klein, Osama Makansi, Frank Hutter, and Thomas Brox. Un- certainty estimates and multi-hypotheses networks for optical flow. In Proceedings of the European Conference on Computer Vision (ECCV) , pages 652–667, 2018
2018
-
[14]
An information gain formulation for active volumetric 3d reconstruction
Stefan Isler, Reza Sabzevari, Jeffrey Delmerico, and Davide Scaramuzza. An information gain formulation for active volumetric 3d reconstruction. In 2016 IEEE International Conference on Robotics and Automation (ICRA), pages 3477–3484. IEEE, 2016
2016
-
[15]
Fisherrf: Active view selection and mapping with radiance fields using fisher information
Wen Jiang, Boshu Lei, and Kostas Daniilidis. Fisherrf: Active view selection and mapping with radiance fields using fisher information. In European Conference on Computer Vision, pages 422–440. Springer, 2025
2025
-
[16]
Activegs: Active scene reconstruction using gaussian splatting
Liren Jin, Xingguang Zhong, Yue Pan, Jens Behley, Cyrill Stachniss, and Marija Popovi ´c. Activegs: Active scene reconstruction using gaussian splatting. IEEE Robotics and Automation Letters , 2025
2025
-
[17]
Gs-planner: A gaussian- splatting-based planning framework for active high- fidelity reconstruction
Rui Jin, Yuman Gao, Yingjian Wang, Yuze Wu, Haojian Lu, Chao Xu, and Fei Gao. Gs-planner: A gaussian- splatting-based planning framework for active high- fidelity reconstruction. In 2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages 11202–1...
2024
-
[18]
On mutual information-based control of range sensing robots for mapping applications
Brian J Julian, Sertac Karaman, and Daniela Rus. On mutual information-based control of range sensing robots for mapping applications. The International Journal of Robotics Research, 33(10):1375–1392, 2014
2014
-
[19]
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 Transactions on Graphics, 42(4), July 2023. URL https://repo-sam.inria.fr/fungraph/ 3d-gaussian-splatting/
2023
-
[20]
So-nerf: Active view planning for nerf using surrogate objectives
Keifer Lee, Shubham Gupta, Sunglyoung Kim, Bhargav Makwana, Chao Chen, and Chen Feng. So-nerf: Active view planning for nerf using surrogate objectives. arXiv preprint arXiv:2312.03266, 2023
2023 arXiv
-
[21]
Activesplat: High-fidelity scene reconstruction through active gaussian splatting
Yuetao Li, Zijia Kuang, Ting Li, Guyue Zhou, Shaohui Zhang, and Zike Yan. Activesplat: High-fidelity scene reconstruction through active gaussian splatting. arXiv preprint arXiv:2410.21955, 2024
2024 arXiv
-
[22]
Semantics- aware receding horizon planner for object-centric active mapping
Liang Lu, Yinqiang Zhang, Peng Zhou, Jiaming Qi, Yipeng Pan, Changhong Fu, and Jia Pan. Semantics- aware receding horizon planner for object-centric active mapping. IEEE Robotics and Automation Letters , 2024
2024
-
[23]
A review on viewpoints and path plan- ning for uav-based 3-d reconstruction
Mehdi Maboudi, MohammadReza Homaei, Soohwan Song, Shirin Malihi, Mohammad Saadatseresht, and Markus Gerke. A review on viewpoints and path plan- ning for uav-based 3-d reconstruction. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 16:5026–5048, 2023
2023
-
[24]
Hidenobu Matsuki, Riku Murai, Paul H. J. Kelly, and Andrew J. Davison. Gaussian Splatting SLAM. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2024
2024
-
[25]
Minimum snap trajectory generation and control for quadrotors
Daniel Mellinger and Vijay Kumar. Minimum snap trajectory generation and control for quadrotors. In 2011 IEEE international conference on robotics and automation, pages 2520–2525. IEEE, 2011
2011
-
[26]
Nerf: Representing scenes as neural radiance fields for view synthesis
Ben Mildenhall, Pratul P Srinivasan, Matthew Tancik, Jonathan T Barron, Ravi Ramamoorthi, and Ren Ng. Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM , 65(1):99– 106, 2021
2021
-
[27]
A computationally efficient motion primitive for quadro- copter trajectory generation
Mark W Mueller, Markus Hehn, and Raffaello D’Andrea. A computationally efficient motion primitive for quadro- copter trajectory generation. IEEE transactions on robotics, 31(6):1294–1310, 2015
2015
-
[28]
Information-theoretic occupancy grid compression for high-speed information- based exploration
Erik Nelson and Nathan Michael. Information-theoretic occupancy grid compression for high-speed information- based exploration. In 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages 4976–4982. IEEE, 2015
2015
-
[29]
Activenerf: Learning where to see with uncertainty es- timation
Xuran Pan, Zihang Lai, Shiji Song, and Gao Huang. Activenerf: Learning where to see with uncertainty es- timation. In European Conference on Computer Vision , pages 230–246. Springer, 2022
2022
-
[30]
Neurar: Neural uncertainty for autonomous 3d recon- struction 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 autonomous 3d recon- struction with implicit neural representations. IEEE Robotics and Automation Letters, 8(2):1125–1132, 2023
2023
-
[31]
Stochastic neural radiance fields: Quantifying uncertainty in implicit 3d represen- tations
Jianxiong Shen, Adria Ruiz, Antonio Agudo, and Francesc Moreno-Noguer. Stochastic neural radiance fields: Quantifying uncertainty in implicit 3d represen- tations. In 2021 International Conference on 3D Vision (3DV), pages 972–981. IEEE, 2021
2021
-
[32]
Flightmare: A flexible quadrotor simulator
Yunlong Song, Selim Naji, Elia Kaufmann, Antonio Loquercio, and Davide Scaramuzza. Flightmare: A flexible quadrotor simulator. In Proceedings of the 2020 Conference on Robot Learning , pages 1147–1157, 2021
2020
-
[33]
Computationally efficient information- theoretic exploration of pits and caves
Wennie Tabib, Micah Corah, Nathan Michael, and Red Whittaker. Computationally efficient information- theoretic exploration of pits and caves. In 2016 IEEE/RSJ International Conference on Intelligent Robots and Sys- tems (IROS), pages 3722–3727. IEEE, 2016
2016
-
[34]
Autonomous cave surveying with an aerial robot
Wennie Tabib, Kshitij Goel, John Yao, Curtis Boirum, and Nathan Michael. Autonomous cave surveying with an aerial robot. IEEE Transactions on Robotics , 38(2): 1016–1032, 2021
2021
-
[35]
Hgs-planner: Hierarchical planning framework for active scene reconstruction using 3d gaussian splatting
Zijun Xu, Rui Jin, Ke Wu, Yi Zhao, Zhiwei Zhang, Jieru Zhao, Fei Gao, Zhongxue Gan, and Wenchao Ding. Hgs-planner: Hierarchical planning framework for active scene reconstruction using 3d gaussian splatting. arXiv preprint arXiv:2409.17624, 2024
2024 arXiv
-
[36]
A frontier-based approach for au- tonomous exploration
Brian Yamauchi. A frontier-based approach for au- tonomous exploration. In Proceedings 1997 IEEE In- ternational Symposium on Computational Intelligence in Robotics and Automation CIRA’97. ’Towards New Com- putational Principles for Robotics and Automation’ , pages 146–151. IEEE, 1997
1997
-
[37]
Active implicit object reconstruc- tion using uncertainty-guided next-best-view optimiza- tion
Dongyu Yan, Jianheng Liu, Fengyu Quan, Haoyao Chen, and Mengmeng Fu. Active implicit object reconstruc- tion using uncertainty-guided next-best-view optimiza- tion. IEEE Robotics and Automation Letters , 2023
2023
-
[38]
One fling to goal: Environment-aware dynamics for goal-conditioned fabric flinging
Linhan Yang, Lei Yang, Haoran Sun, Zeqing Zhang, Haibin He, Fang Wan, Chaoyang Song, and Jia Pan. One fling to goal: Environment-aware dynamics for goal-conditioned fabric flinging. arXiv preprint arXiv:2406.14136, 2024
2024 arXiv
-
[39]
A framework for efficient teleoperation via online adapta- tion
Xuning Yang, Koushil Sreenath, and Nathan Michael. A framework for efficient teleoperation via online adapta- tion. In 2017 IEEE International Conference on Robotics and Automation (ICRA) , pages 5948–5953. IEEE, 2017
2017
-
[40]
Falcon: Fast autonomous aerial exploration using coverage path guidance
Yichen Zhang, Xinyi Chen, Chen Feng, Boyu Zhou, and Shaojie Shen. Falcon: Fast autonomous aerial exploration using coverage path guidance. IEEE Transactions on Robotics, 2024
2024
-
[41]
Global bim-point cloud registration and association for construction progress monitoring
Yinqiang Zhang, Liang Lu, Xiaowei Luo, and Jia Pan. Global bim-point cloud registration and association for construction progress monitoring. Automation in Con- struction, 168:105796, 2024
2024
-
[42]
FSMI: Fast computation of shannon mutual information for information-theoretic mapping
Zhengdong Zhang, Theia Henderson, Sertac Karaman, and Vivienne Sze. FSMI: Fast computation of shannon mutual information for information-theoretic mapping. The International Journal of Robotics Research , 39(9): 1155–1177, 2020
2020
-
[43]
FUEL: Fast uav exploration using incremen- tal frontier structure and hierarchical planning
Boyu Zhou, Yichen Zhang, Xinyi Chen, and Shaojie Shen. FUEL: Fast uav exploration using incremen- tal frontier structure and hierarchical planning. IEEE Robotics and Automation Letters , 6(2):779–786, 2021. APPENDIX A. Information Gain Function Derivation The information gain ...
2021
Reviewed August 16, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.