Pith. sign in

REVIEW 3 major objections 5 minor 2 cited by

Volumetric Mapping with Panoptic Refinement via Kernel Density Estimation for Mobile Robots

T0 review · 3 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 mask-refinement step for panoptic volumetric mapping that cleans up RGB-based segmentation before 3D reconstruction, using kernel density estimation on depth values to cut away over-covered outliers without extra…

desk verdict A simple KDE-based mask refinement idea with a real but confounded evaluation and a broken algorithm listing. read the letter →

arxiv 2412.11241 v1 pith:MUZAZNBS submitted 2024-12-15 cs.RO cs.CV

Khang Nguyen , Tuan Dang , Manfred Huber This is my paper · ORCID
classification cs.ROcs.CV
keywords panopticmappingkerneldensityestimationdepthoutlierrejectionsegmentationmaskrefinementsigneddistancefunctionsvolumetricmobilerobotsRGB-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

This paper proposes a mask-refinement step for panoptic volumetric mapping that cleans up RGB-based segmentation before 3D reconstruction. The idea is to take each predicted object mask, look at the distribution of depth values it covers, and cut off the low- and high-depth tails of that distribution using kernel density estimation, treating them as segmentation outliers. Because the cutoff is found from the density itself, the method needs no new trained parameters and adapts to out-of-distribution scenes. On a synthetic indoor dataset the refinement improved mask intersection-over-union from 79.8860 to 90.6077 (about ten percent) for a retrained segmenter, and from 16.5150 to 26.2283 for the prior PanMap pipeline. The same pipeline was demonstrated on a real Baxter robot with an Intel RealSense camera, producing cleaner object instances in the resulting SDF map.

What carries the argument

The engine of the method is a one-dimensional kernel density estimate of the depth values covered by each predicted object mask, computed in $O(M \log M)$ time via FFT-based convolution of grid counts with a Gaussian kernel whose bandwidth is set by the ISJ algorithm. Algorithm 1 takes the density's maximum peak as the object's dominant depth, then scans outward on both sides for the first index where the density drops below $10^{-6}$; those indices become the low and high depth cutoffs. Only depth pixels between the cutoffs survive, and the binary mask is set to zero wherever depth was discarded. This single mechanism does all the work of outlier rejection, and it is what the paper claims makes the refinement adaptive without extra parameters.

What would settle it

Run Algorithm 1 on a sequence where a chair is viewed from an angle so its seat and back produce two depth modes and a background wall sits at a similar distance as one mode; if the density between modes never falls below $10^{-6}$, the method will either delete the chair's valid pixels or fail to produce cutoffs, while a manual trim of the same mask would keep the object intact.

Watch

Extended reading notes

Core claim

The central claim is that per-instance depth statistics, rather than learned RGB-D fusion, can repair the over-coverage errors that lightweight segmentation networks make. For each binary mask the method computes a kernel density estimate of the depths underneath it, locates the dominant density peak, and sets low and high cutoffs where the density falls below $10^{-6}$; depth pixels outside these cutoffs are removed and the mask is updated accordingly. This is parametric-free in the sense that the bandwidth comes from the ISJ rule and no threshold is tuned per scene. The refined masks then feed a projective signed-distance-function mapper that updates voxels with per-point semantic labels. The paper reports that this refinement raises mask IOU from 79.8860 to 90.6077 on the flat dataset when combined with a retrained YOLO segmenter, and also lifts the prior PanMap system from 16.5150 to 26.2283, indicating the refinement contributes roughly a ten-percent gain on top of whatever segmenter is used.

Load-bearing premise

The refinement works only when the object's depth distribution has a single dominant peak and drops to near zero on both sides, so if background depth overlaps the object or the object spans two clear depth bands, the algorithm can discard valid object pixels or find no cutoffs at all.

Editorial extensions

If this is right

  • Adding the KDE refinement to an existing RGB segmenter improves final mask IOU by roughly ten percent, independent of whether the base segmenter is weak or strong.
  • Volumetric maps built with projective SDFs inherit the cleaner masks, so object instances appear with fewer stray point-cloud outliers and sharper boundaries.
  • Because the refinement step is parametric-free, it can be dropped into a robot's perception stack without retraining or scene-specific threshold tuning.
  • The same pipeline runs on a real mobile robot (Baxter with an Intel RealSense D435i), so the gains are not limited to synthetic evaluation.
  • The method is designed to handle out-of-distribution scenes where learned RGB-D fusion degrades, since it relies on the observed depth distribution rather than training-data priors.

Reading between the lines

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

  • Beyond the paper's claims: the same density-tail criterion could be applied to per-instance color or normal statistics, not just depth, potentially refining masks in settings where depth is noisy or missing.
  • Beyond the paper's claims: the roughly ten-point IOU gain at both base levels suggests the refinement step is somewhat orthogonal to segmenter quality; a direct test would be to run Alg. 1 with several off-the-shelf panoptic segmenters on the same sequence.
  • Beyond the paper's claims: the $10^{-6}$ density floor is the one residual magic number; a data-driven or per-object adaptive floor would make the method fully parameter-free and could be tested against the current fixed value.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 5 minor

Summary. The paper proposes a non-parametric depth-outlier rejection step for panoptic segmentation masks used in RGB-D volumetric mapping. For each predicted object mask, the depth values under the mask are converted to a 1D kernel density estimate, and depth pixels lying outside the estimated support are removed; the refined masks are then integrated into a projective signed-distance-function (SDF) volume. The method is evaluated on a synthetic 'flat' dataset against the PanMap baseline and demonstrated qualitatively on a Baxter robot with an Intel RealSense camera. The central claim is that this refinement, together with projective SDF mapping, produces more accurate panoptic volumetric maps than the prior PanMap system.

Significance. If the reported gain were properly isolated, the method would be a lightweight and useful addition to RGB-D panoptic mapping: it avoids point-cloud processing, uses a data-driven bandwidth selection, and is accompanied by a public code release. The controlled within-model comparison (rows c vs d of Table II) indicates that the KDE refinement alone improves mask IOU by about 10.7 points on the synthetic sequence, which is a meaningful signal. However, the paper's comparative claim against PanMap is not supported by the experiments as presented, because the segmentation model is changed between conditions, and the only quantitative metric is 2D mask IOU rather than any volumetric reconstruction score.

major comments (3)
  1. [Sec. V-B, Table II] The central comparison against PanMap is confounded. Rows (a) and (b) use the original PanMap segmentation model (Detectron), while rows (c) and (d) use a retrained YOLO model, as stated in Sec. V-B. The 53.6577-point difference between rows (a) and (c) is therefore attributable primarily to the segmentation-model swap, not to the proposed KDE refinement. The only controlled comparison is rows (c) versus (d), which shows a real 10.7217-point IOU gain from the refinement, but this does not establish superiority over PanMap because no condition runs PanMap with the same YOLO masks. To support the paper's claim, please add a same-segmenter comparison against PanMap (e.g., PanMap with YOLO masks, with and without the proposed refinement) or otherwise isolate the refinement contribution from the segmentation-model change.
  2. [Algorithm 1, lines 6-10] The algorithm assumes that the KDE of each object's depth distribution has one dominant peak and falls below a fixed threshold of 1e-6 on both sides. When the object depth overlaps with background depth, or when the object contains multiple depth modes, the density may never reach that threshold, so the find_id operations either return an empty index or pick an index at the boundary. In that case the algorithm either discards valid object pixels or fails because no cutoff exists. This failure mode is not discussed in the paper, even though it is central to the claimed adaptivity of the method. In addition, the threshold 1e-6 is a manually fixed hyperparameter, which contradicts the abstract's 'without the need for additional parameters' and Sec. IV-C's 'without requiring predefined thresholds'.
  3. [Sec. V, Table II] The only quantitative metric reported is 2D mask IOU between the predicted masks and ground-truth annotations. This metric measures the quality of the input masks, not the quality of the resulting volumetric map. The title and abstract claim improvements in volumetric mapping, but the volumetric evidence is qualitative (Figs. 4 and 5) and the real-robot experiments (Sec. VI) are also qualitative. Please either report a volumetric reconstruction metric (e.g., voxel precision/recall, map IOU, or per-object F-score) or restrict the quantitative claim to the mask-refinement stage.
minor comments (5)
  1. [Abstract and Sec. I] The repository link 'https://github.com/mkhangg/refined panoptic mapping' contains a space and is not a valid URL; please provide the correct encoded or actual link.
  2. [Algorithm 1] The symbol M is used for both the input list of masks and the output list; line 2 overwrites the input. Please rename one of them to avoid confusion.
  3. [Eq. (1), Sec. IV-A] The hole-filling equation does not specify the normalization of the Gaussian weights or the behavior when all neighboring depth values are zero; please clarify the exact update rule.
  4. [Table I, Sec. VI] Table I lists 'on-robot real-time performance' for all systems, but the paper reports no timing or computational cost measurements; either provide such measurements or remove/qualify this claim.
  5. [Fig. 2 caption] The caption says the outliers are 'encoded by the same colors as Fig. 3', but Fig. 3 does not appear to use the same color encoding; please check the cross-reference.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation: KDE refinement is a fixed, parameter-free filter; no equation reduces to the evaluation metric.

full rationale

The derivation chain is self-contained. Algorithm 1 takes predicted masks and a depth map and computes a kernel density estimate along the depth axis (Eqs. 2–4); cutoff indices are found by a fixed 1e-6 density threshold, and the bandwidth comes from the external ISJ rule. No parameter is fitted to the mask-IOU labels, and no equation defines the evaluation metric in terms of the method's outputs. The projective SDF update (Eq. 5) is a standard recursive integration whose inputs are the refined masks; it is not equivalent to the panoptic ground truth. The only self-citation in the paper, reference [3], appears in a background list of RGB-D segmentation methods and carries no load-bearing role in the refinement or the evaluation. The main caveat is experimental rather than circular: Table II compares the original PanMap system using Detectron masks to the proposed pipeline using a retrained YOLO model, so the large cross-row gain is confounded by the segmentation-model swap; however, the within-model comparison between rows (c) and (d) isolates the KDE refinement and constitutes a genuine, non-circular result. Algorithm 1's implicit assumption of a single dominant depth mode is an algorithmic limitation that could affect robustness, but it is not a circular step.

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

The method is not fully parametric-free: it introduces a cutoff threshold, grid size, hole-filling kernel, and a data-dependent bandwidth, and it assumes objects have unimodal depth distributions with separated outlier tails.

free parameters (4)
  • Density cutoff threshold = 1e-6
    Algorithm 1 lines 7-8 use 1e-6 as the definition of zero density for finding cutoffs. This is a hand-set constant despite the claimed absence of parameters.
  • FFT KDE grid size M
    Equation 3 discretizes the depth range into M grid points, but the paper never states how M is selected. This affects cutoff precision.
  • Gaussian hole-filling kernel size g
    Equation 1 fills depth holes with a g by g Gaussian kernel; g is not specified and changes the depth values used by KDE.
  • KDE bandwidth H via ISJ = data-dependent
    The bandwidth is chosen by the ISJ algorithm, making it adaptive, but it remains a smoothing parameter that controls the density estimate.
assumptions (4)
  • domain assumption The depth values of a correctly segmented object form one dominant mode with tails that reach near-zero density on both sides.
    Algorithm 1 finds one peak and cuts at the first near-zero density on each side; multi-modal objects or overlapping background depth break this assumption.
  • domain assumption The predicted mask contains the true object as a subset, so refinement only needs to remove outliers.
    The method only prunes depth pixels; any under-covered object pixels cannot be recovered. This is implicit in Section IV-C.
  • domain assumption Depth and RGB frames are aligned and Gaussian hole filling provides correct missing depth values.
    Equation 1 fills holes before KDE; incorrect interpolation distorts the depth distribution and the cutoffs.
  • standard math KDE with ISJ bandwidth and FFT convolution yields a faithful density estimate.
    The paper relies on standard density estimation theory without proving it; this is acceptable background.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Volumetric Mapping with Panoptic Refinement via Kernel Density Estimation for Mobile Robots." pith.science (2026). https://pith.science/paper/MUZAZNBS

@misc{pith2026241211241,
  author       = {Pith},
  title        = {Pith review of: Volumetric Mapping with Panoptic Refinement via Kernel Density Estimation for Mobile Robots},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MUZAZNBS}},
  note         = {Machine review of arXiv:2412.11241}
}
read the original abstract

Reconstructing three-dimensional (3D) scenes with semantic understanding is vital in many robotic applications. Robots need to identify which objects, along with their positions and shapes, to manipulate them precisely with given tasks. Mobile robots, especially, usually use lightweight networks to segment objects on RGB images and then localize them via depth maps; however, they often encounter out-of-distribution scenarios where masks over-cover the objects. In this paper, we address the problem of panoptic segmentation quality in 3D scene reconstruction by refining segmentation errors using non-parametric statistical methods. To enhance mask precision, we map the predicted masks into a depth frame to estimate their distribution via kernel densities. The outliers in depth perception are then rejected without the need for additional parameters in an adaptive manner to out-of-distribution scenarios, followed by 3D reconstruction using projective signed distance functions (SDFs). We validate our method on a synthetic dataset, which shows improvements in both quantitative and qualitative results for panoptic mapping. Through real-world testing, the results furthermore show our method's capability to be deployed on a real-robot system. Our source code is available at: https://github.com/mkhangg/refined panoptic mapping.

Figures

Figures reproduced from arXiv: 2412.11241 by the authors.

Figure 1
Figure 1. (a) Indoor mobile robots operating in an environment with multiple objects (b) refines RGB-based segmentation masks using kernel density estimation via depth perception, and (c) rebuilds panoptic map with object instances using projective signed distance functions. Abstract— Reconstructing three-dimensional (3D) scenes with semantic understanding is vital in many robotic applications. Robots need to identify which o… view at source ↗
Figure 2
Figure 2. Depth maps of object instances containing depth outliers (top row) due to the imperfection of segmentation models and their density estimations along depth perception (middle row), and refined depth maps (bottom row). The shaded depth values on the density lines in between vertical red cutoff lines are considered inliers; otherwise, Alg. 1 rejects them as they appear to be outliers. The outliers are encoded by the s… view at source ↗
Figure 3
Figure 3. The scene of multiple objects with outliers boxed in red (left) and the scene without outliers after applying Alg. 1 (right). their g 2 neighbors are empty, as follows: D(i, j) =    0, if D(i ± k, j ± l) = 0 uX +k i=u−k vX +k j=v−k D(i, j) · G(u, v) (1) where 0 ≤ k, l ≤ g, (u, v) represents the image coordinates of pixels, G(u, v) is the 2D Gaussian kernel, size of g × g, centered on the (u, v) pixel. B. Depth … view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Qualitative results on the flat dataset of (a) the original panoptic mapping approach, (b) the original approach coupled with mask refinement, (c) our approach without mask refinement, and (d) our approach with mask refinement. The room texture and its panoptic segment…
Figure 5
Figure 5. Figure 5: Comparisons of object detail reconstruction quality between (a) our approach with mask refinement and (b) from ground truth. the original and our approaches, as shown in [PITH_FULL_IMAGE:figures/full_fig_p005_5.png]
Figure 6
Figure 6. Figure 6: The refined volumetric mapping process on the Baxter robot: (a) starts to observe a part of the scene, (b) iteratively updating the scene by moving in the lab’s free space, including translations and rotations, and (c) finishing building the observed scene. VI. REAL-RO…

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Bio-Inspired Hybrid Map: Spatial Implicit Local Frames and Topological Map for Mobile Cobot Navigation

    cs.RO 2025-07 conditional novelty 5.0 of 10

    A mobile robot navigation system that builds local neural signed-distance maps with learned features and links them into a topological factor graph, reporting lower per-local-frame error than iMAP, NICE-SLAM, and ESLA...

  2. Distortion-Aware Adversarial Attacks on Bounding Boxes of Object Detectors

    cs.CV 2024-12 conditional novelty 4.0 of 10

    An iterative gradient-based attack, guided by predicted bounding-box masks and controlled by a normalized cross-correlation distortion threshold, causes object detectors to misdetect objects with high reported success.

Reference graph

Works this paper leans on

38 extracted references · 28 canonical work pages · cited by 2 Pith papers

  1. [1]

    Rgb-(d) scene labeling: Features and algorithms,

    X. Ren, L. Bo, and D. Fox, “Rgb-(d) scene labeling: Features and algorithms,” in 2012 IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 2012, pp. 2759–2766

    work page 2012

  2. [2]

    Perceptual organization and recognition of indoor scenes from rgb-d images,

    S. Gupta, P. Arbelaez, and J. Malik, “Perceptual organization and recognition of indoor scenes from rgb-d images,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2013, pp. 564–571

    work page 2013

  3. [3]

    Real-time 3d semantic scene perception for egocentric robots with binocular vision,

    K. Nguyen, T. Dang, and M. Huber, “Real-time 3d semantic scene perception for egocentric robots with binocular vision,” arXiv preprint arXiv:2402.11872, 2024

    arXiv 2024

  4. [4]

    Refining image segmentation by integration of edge and region data,

    J. Le Moigne and J. C. Tilton, “Refining image segmentation by integration of edge and region data,” IEEE transactions on geoscience and remote sensing , vol. 33, no. 3, pp. 605–615, 1995

    work page 1995

  5. [5]

    Interactive graph cut based segmentation with shape priors,

    D. Freedman and T. Zhang, “Interactive graph cut based segmentation with shape priors,” in 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05) , vol. 1. IEEE, 2005, pp. 755–762

    work page 2005

  6. [6]

    Graph cut based image segmentation with connectivity priors,

    S. Vicente, V . Kolmogorov, and C. Rother, “Graph cut based image segmentation with connectivity priors,” in 2008 IEEE conference on computer vision and pattern recognition . IEEE, 2008, pp. 1–8

    work page 2008

  7. [7]

    A segmentation based robust deep learning framework for multimodal retinal image registration,

    Y . Wang, J. Zhang, C. An, M. Cavichini, M. Jhingan, M. J. Amador- Patarroyo, C. P. Long, D.-U. G. Bartsch, W. R. Freeman, and T. Q. Nguyen, “A segmentation based robust deep learning framework for multimodal retinal image registration,” in ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2020, pp. ...

    work page 2020

  8. [8]

    On advantages of mask-level recognition for outlier-aware segmentation,

    M. Grci ´c, J. ˇSari´c, and S. ˇSegvi´c, “On advantages of mask-level recognition for outlier-aware segmentation,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2023, pp. 2936–2946

    work page 2023

Show all 38 references
  1. [9]

    Lstm-cf: Unifying context modeling and fusion with lstms for rgb-d scene la- beling,

    Z. Li, Y . Gan, X. Liang, Y . Yu, H. Cheng, and L. Lin, “Lstm-cf: Unifying context modeling and fusion with lstms for rgb-d scene la- beling,” in Computer Vision–ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part II 14. Spri...

    2016

  2. [10]

    Learning com- mon and specific features for rgb-d semantic segmentation with deconvolutional networks,

    J. Wang, Z. Wang, D. Tao, S. See, and G. Wang, “Learning com- mon and specific features for rgb-d semantic segmentation with deconvolutional networks,” in Computer Vision–ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part V ...

    2016

  3. [11]

    Rdfnet: Rgb-d multi-level residual feature fusion for indoor semantic segmentation,

    S.-J. Park, K.-S. Hong, and S. Lee, “Rdfnet: Rgb-d multi-level residual feature fusion for indoor semantic segmentation,” inProceedings of the IEEE international conference on computer vision , 2017, pp. 4980– 4989

    2017

  4. [12]

    Fusenet: In- corporating depth into semantic segmentation via fusion-based cnn architecture,

    C. Hazirbas, L. Ma, C. Domokos, and D. Cremers, “Fusenet: In- corporating depth into semantic segmentation via fusion-based cnn architecture,” in Computer Vision–ACCV 2016: 13th Asian Conference on Computer Vision, Taipei, Taiwan, November 20-24, 2016, Revised Selected Papers,...

    2016

  5. [13]

    Depth-aware cnn for rgb-d segmenta- tion,

    W. Wang and U. Neumann, “Depth-aware cnn for rgb-d segmenta- tion,” in Proceedings of the European conference on computer vision (ECCV), 2018, pp. 135–150

    2018

  6. [14]

    Two-stage cascaded decoder for semantic segmentation of rgb-d images,

    Y . Yue, W. Zhou, J. Lei, and L. Yu, “Two-stage cascaded decoder for semantic segmentation of rgb-d images,” IEEE Signal Processing Letters, vol. 28, pp. 1115–1119, 2021

    2021

  7. [15]

    Indoor seg- mentation and support inference from rgbd images,

    N. Silberman, D. Hoiem, P. Kohli, and R. Fergus, “Indoor seg- mentation and support inference from rgbd images,” in Computer Vision–ECCV 2012: 12th European Conference on Computer Vision, Florence, Italy, October 7-13, 2012, Proceedings, Part V 12. Springer, 2012, pp. 746–760

    2012

  8. [16]

    Indoor semantic segmentation using depth information,

    C. Couprie, C. Farabet, L. Najman, and Y . LeCun, “Indoor semantic segmentation using depth information,” arXiv preprint arXiv:1301.3572, 2013

    2013 arXiv

  9. [17]

    Learning rich features from rgb-d images for object detection and segmenta- tion,

    S. Gupta, R. Girshick, P. Arbel ´aez, and J. Malik, “Learning rich features from rgb-d images for object detection and segmenta- tion,” in Computer Vision–ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part VII 13 . Springer, 2014,...

    2014

  10. [18]

    Kinectfusion: Real-time dense surface mapping and tracking,

    R. A. Newcombe, S. Izadi, O. Hilliges, D. Molyneaux, D. Kim, A. J. Davison, P. Kohi, J. Shotton, S. Hodges, and A. Fitzgibbon, “Kinectfusion: Real-time dense surface mapping and tracking,” in 2011 10th IEEE international symposium on mixed and augmented reality. Ieee, 2011, pp...

    2011

  11. [19]

    Chisel: Real time large scale 3d reconstruction onboard a mobile device using spatially hashed signed distance fields

    M. Klingensmith, I. Dryanovski, S. S. Srinivasa, and J. Xiao, “Chisel: Real time large scale 3d reconstruction onboard a mobile device using spatially hashed signed distance fields.” in Robotics: science and systems, vol. 4, no. 1. Citeseer, 2015

    2015

  12. [20]

    V oxblox: Incremental 3d euclidean signed distance fields for on- board mav planning,

    H. Oleynikova, Z. Taylor, M. Fehr, R. Siegwart, and J. Nieto, “V oxblox: Incremental 3d euclidean signed distance fields for on- board mav planning,” in 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2017, pp. 1366–1373

    2017

  13. [21]

    V olumetric instance-aware semantic mapping and 3d object discovery,

    M. Grinvald, F. Furrer, T. Novkovic, J. J. Chung, C. Cadena, R. Sieg- wart, and J. Nieto, “V olumetric instance-aware semantic mapping and 3d object discovery,” IEEE Robotics and Automation Letters , vol. 4, no. 3, pp. 3037–3044, 2019

    2019

  14. [22]

    V oxfield: Non-projective signed distance fields for online planning and 3d reconstruction,

    Y . Pan, Y . Kompis, L. Bartolomei, R. Mascaro, C. Stachniss, and M. Chli, “V oxfield: Non-projective signed distance fields for online planning and 3d reconstruction,” in 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2022, pp. 5331–5338

    2022

  15. [23]

    Panoptic multi-tsdfs: a flexible repre- sentation for online multi-resolution volumetric mapping and long- term dynamic scene consistency,

    L. Schmid, J. Delmerico, J. L. Sch ¨onberger, J. Nieto, M. Pollefeys, R. Siegwart, and C. Cadena, “Panoptic multi-tsdfs: a flexible repre- sentation for online multi-resolution volumetric mapping and long- term dynamic scene consistency,” in 2022 International Conference on Ro...

    2022

  16. [24]

    Se- manticfusion: Dense 3d semantic mapping with convolutional neural networks,

    J. McCormac, A. Handa, A. Davison, and S. Leutenegger, “Se- manticfusion: Dense 3d semantic mapping with convolutional neural networks,” in 2017 IEEE International Conference on Robotics and automation (ICRA). IEEE, 2017, pp. 4628–4635

    2017

  17. [25]

    Co-fusion: Real-time segmentation, tracking and fusion of multiple objects,

    M. R ¨unz and L. Agapito, “Co-fusion: Real-time segmentation, tracking and fusion of multiple objects,” in 2017 IEEE International Confer- ence on Robotics and Automation (ICRA) . IEEE, 2017, pp. 4471– 4478

    2017

  18. [26]

    Maskfusion: Real-time recog- nition, tracking and reconstruction of multiple moving objects,

    M. Runz, M. Buffier, and L. Agapito, “Maskfusion: Real-time recog- nition, tracking and reconstruction of multiple moving objects,” in 2018 IEEE International Symposium on Mixed and Augmented Reality (ISMAR). IEEE, 2018, pp. 10–20

    2018

  19. [27]

    Panoptic segmentation,

    A. Kirillov, K. He, R. Girshick, C. Rother, and P. Doll ´ar, “Panoptic segmentation,” in Proceedings of the IEEE/CVF conference on com- puter vision and pattern recognition , 2019, pp. 9404–9413

    2019

  20. [28]

    Fast and ac- curate semantic mapping through geometric-based incremental seg- mentation,

    Y . Nakajima, K. Tateno, F. Tombari, and H. Saito, “Fast and ac- curate semantic mapping through geometric-based incremental seg- mentation,” in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2018, pp. 385–392

    2018

  21. [29]

    Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography,

    M. A. Fischler and R. C. Bolles, “Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography,” Communications of the ACM , vol. 24, no. 6, pp. 381–395, 1981

    1981

  22. [30]

    Robust statistical estimation and segmentation of multiple subspaces,

    A. Y . Yang, S. R. Rao, and Y . Ma, “Robust statistical estimation and segmentation of multiple subspaces,” in 2006 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW’06). IEEE, 2006, pp. 99–99

    2006

  23. [31]

    A density-based spatial clustering of application with noise,

    H. B ¨acklund, A. Hedblom, and N. Neijman, “A density-based spatial clustering of application with noise,” Data Mining TNM033 , vol. 33, pp. 11–30, 2011

    2011

  24. [32]

    A volumetric method for building complex models from range images,

    B. Curless and M. Levoy, “A volumetric method for building complex models from range images,” in Proceedings of the 23rd annual conference on Computer graphics and interactive techniques , 1996, pp. 303–312

    1996

  25. [33]

    Dart: Dense articulated real-time tracking

    T. Schmidt, R. A. Newcombe, and D. Fox, “Dart: Dense articulated real-time tracking.” in Robotics: Science and systems , vol. 2, no. 1. Berkeley, CA, 2014, pp. 1–9

    2014

  26. [34]

    Dynamicfusion: Recon- struction and tracking of non-rigid scenes in real-time,

    R. A. Newcombe, D. Fox, and S. M. Seitz, “Dynamicfusion: Recon- struction and tracking of non-rigid scenes in real-time,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2015, pp. 343–352

    2015

  27. [35]

    Dynamic high resolution deformable articulated tracking,

    A. Walsman, W. Wan, T. Schmidt, and D. Fox, “Dynamic high resolution deformable articulated tracking,” in 2017 International Conference on 3D Vision (3DV) . IEEE, 2017, pp. 38–47

    2017

  28. [36]

    Signed distance fields: A natural representation for both mapping and planning,

    H. Oleynikova, A. Millane, Z. Taylor, E. Galceran, J. Nieto, and R. Siegwart, “Signed distance fields: A natural representation for both mapping and planning,” in RSS 2016 workshop: geometry and beyond-representations, physics, and scene understanding for robotics. University ...

    2016

  29. [37]

    YOLO by Ultralytics,

    G. Jocher, A. Chaurasia, and J. Qiu, “YOLO by Ultralytics,” Jan

  30. [2023]

    Available: https://github.com/ultralytics/ultralytics

    [Online]. Available: https://github.com/ultralytics/ultralytics

Pith tools

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