RE-TRIP : Reflectivity Instance Augmented Triangle Descriptor for 3D Place Recognition

Euntai Kim; Gyuhyeon Pak; Yechan Park

REVIEW 5 major objections 4 minor 36 references

RE-TRIP : Reflectivity Instance Augmented Triangle Descriptor for 3D Place Recognition

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

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

Pith's one-line read Reflective landmarks beat geometry-only LiDAR place recognition.

desk verdict A credible empirical integration of reflectivity-based key instances with triangle descriptors; the gains over SC/ISC/STD are real on the tested datasets, but the mechanism's repeatability is under-evidenced and the baseline set is narrow. read the letter →

arxiv 2505.16165 v1 pith:7ZT66LVB submitted 2025-05-22 cs.CV cs.RO

Yechan Park , Gyuhyeon Pak , Euntai Kim This is my paper · ORCID

classification cs.CVcs.RO

keywords 3DplacerecognitionLiDARreflectivitytriangledescriptorkeyinstancesegmentationloopclosureHELIPRFusionPortableverification

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

RE-TRIP is a LiDAR place-recognition descriptor that claims that reflectivity, an underused LiDAR channel, can solve cases where geometry alone is ambiguous. The paper argues that two types of reflectivity keypoints, absolute and relative, cluster into stable instances that serve as triangle vertices; matching instances plus side lengths makes retrieval reliable in corridors, bridges, roundabouts, and dynamic environments. Evaluated on HELIPR and FusionPortable, it reports higher AUC and maximum F1 than Scan Context, Intensity Scan Context, and the STD triangle descriptor. A sympathetic reading is that reflectivity should be treated as a first-class structural signal, not a texture add-on.

What carries the argument

The central object is the RE-TRIP descriptor, a triangle whose three vertices are key instances: clusters of Absolute Reflectivity Points (ARP, points whose reflectivity exceeds the scan mean by a set number of standard deviations) or Relative Reflectivity Points (RRP, points whose reflectivity deviates strongly from neighbors). The descriptor stores the centroid, cluster size, and source label (ARI/RRI) of each vertex, plus the three side lengths, triangle centroid, and frame index. Sorted side lengths serve as the hash key for candidate retrieval, instance label and size matching filters candidates, and a reflectivity-layered plane-overlap check verifies loops.

What would settle it

Take a sequence where the same reflective object is seen head-on at close range and at a grazing angle from far away, and measure the shift in the centroid of its ARP cluster. If the shift is large enough to alter the sorted side lengths beyond the hash tolerance on a substantial fraction of frames, the true-positive retrieval rate should drop toward that of geometry-only baselines, contradicting the stability assumption.

Watch

Extended reading notes

Core claim

The paper's central claim is that augmenting triangles with reflectivity instances yields a descriptor that is both translation and rotation invariant and material-distinctive, overcoming the local ambiguity of pure triangle descriptors. Concretely, the method keeps AUC above 0.9 even with a single loop candidate on the tested sequences, whereas STD's AUC degrades sharply as the candidate set shrinks. On public benchmarks covering geometrically degenerate and highly dynamic scenarios, the proposed pipeline outperforms the compared baselines on the reported outdoor and indoor sequences.

Load-bearing premise

The load-bearing premise is that high-reflectivity objects are detected consistently across revisits regardless of viewpoint, occlusion, and surface wear, so that their centroids and clusters remain stable enough to serve as triangle vertices.

Editorial extensions

If this is right

If RE-TRIP's results hold, reflectivity should be treated as a structural cue rather than a texture extra, since instance-level reflectivity anchors outperform geometry-only and intensity-image baselines.
Loop-closure detection in geometrically repetitive environments such as long corridors, bridges, and roundabouts becomes reliable with a small candidate set, cutting search time.
Combining ARP and RRP keypoints outperforms either alone, so the two reflectivity cues are complementary and should be kept together.
Because RE-TRIP keeps AUC above 0.9 with a single candidate on tested sequences, it can feed downstream SLAM systems that want very few loop hypotheses.

Reading between the lines

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

The same ARP/RRP extraction could be reused as a front-end for global localization or relocalization, not just loop closure, since instances are viewpoint-stable landmarks.
The method as described assumes sensor reflectivity is available and comparable; extending to LiDARs without calibrated reflectivity would need a learned or calibrated mapping from raw intensity.
Seasonal or infrastructure changes such as new signs or replaced road markings would stress the stability assumption; a stress test with temporally separated revisits would bound the real-world gain.
Instance matching could be pushed further by hashing on instance labels or sizes alongside side lengths, which might prune candidates even earlier; the paper only ablates with and without instance matching.

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.

Desk Editor's Note

read the letter

You should know this paper is a credible empirical contribution, not a breakthrough. It combines reflectivity-based keypoint extraction (ARP/RRP) with instance-level triangle descriptors and a reflectivity-layer verification step, and it reports clear AUC/F1 gains over SC, ISC, and STD on HELIPR and FusionPortable. The integration is new relative to those baselines; each ingredient is known, but the specific pipeline is not in the literature. The ablations (ARP vs RRP vs both, loop candidate count, instance matching) are well chosen and support the design choices.

Where it's soft: the comparison set is only SC, ISC, and STD. STD is from 2023, SC and ISC older. No modern learned descriptor (e.g., PointNetVLAD variants, OverlapTransformer, etc.) is included, so the claim of 'state-of-the-art' overreaches. Second, the ARP definition in Eq. (1) is scan-relative: the same retroreflective pole can fall above or below zA depending on the reflectivity distribution of the current scan. The stress-test note is right that no repeatability or centroid-stability statistics are reported; Fig. 1 is anecdotal. That is a real gap, but not a fatal one: on the evaluated sequences the method still works, which suggests the assumption holds often enough in practice. Still, the paper should report repeatability across revisits and specify delta_r, which is never given. Third, hyperparameters like zA are set differently indoor (3.5) and outdoor (4.5), and there is no described validation/training separation; the concern about mild fitting to the evaluation data is fair.

The paper is honest in scope: it targets robustness in geometrically degenerate and dynamic environments, and the datasets include corridors, bridges, and dynamic areas. The code release is a positive step. The lack of learned baselines and repeatability analysis makes it a conditional accept, not a strong accept, but the central mechanism is coherent and the empirical evidence, within its chosen comparison, is credible.

Who it's for: robotics researchers working on LiDAR loop closure in structured outdoor/indoor environments. A serious referee should engage; the paper deserves a revision request rather than a desk reject. I'd send it to review, asking for delta_r, a validation protocol, at least one learned baseline, and repeatability statistics.

Referee Report

5 major / 4 minor

Summary. The paper proposes RE-TRIP, a LiDAR place-recognition descriptor that augments a triangle descriptor with reflectivity-based keypoint instances. The pipeline extracts Absolute Reflectivity Points (ARP) and Relative Reflectivity Points (RRP), segments them into instances, selects the largest instances as triangle vertices, and retrieves candidate loop closures through a hash table keyed by sorted triangle side lengths, followed by a reflectivity-aware geometric verification. The authors evaluate on HELIPR and FusionPortable sequences, reporting higher AUC and max F1 than Scan Context, Intensity Scan Context, and STD in most tested scenarios, with ablations for keypoint type, instance matching, and loop-candidate count.

Significance. If the claimed performance holds, RE-TRIP is a useful addition to LiDAR place recognition, particularly for geometrically ambiguous and dynamic environments where geometry-only descriptors struggle. The paper's open-source release, inclusion of challenging public sequences, and ablations of keypoint type, loop-candidate count, and instance matching are strengths. However, the central claim depends on the repeatability and centroid stability of reflectivity keypoints, which is asserted rather than quantified, and the evaluation is limited by narrow baseline selection and apparently tuned thresholds. The contribution is therefore promising but not yet fully established.

major comments (5)

[Sec. III-A, Eqs. (1)-(4)] The keypoint definitions are scan-relative and their repeatability is asserted rather than demonstrated. Under Eq. (1), an object's inclusion in ARP depends on the global mean and standard deviation of reflectivity in the current scan, so the same retroreflective surface can pass the threshold in one revisit and fail in another depending on the scan's composition. Eq. (3) depends on delta_r, whose value is never specified. Since Sec. III-B.3 preferentially keeps the largest clusters, partial occlusion or viewpoint change can shift the cluster centroid that serves as a triangle vertex, changing all side lengths used for retrieval; no repeatability or centroid-stability statistics are reported (Fig. 1 is a single pair). The authors should quantify keypoint repeatability across revisits, e.g., detection rate and centroid error as a function of viewpoint difference, or run a synthetic occlusion experiment, because the matching and verification stages rely directly on this stability.
[Sec. IV-B and Table II] The comparison settings appear tuned to favor the proposed method, which weakens the general claim. The ARP threshold zA is set to 3.5 indoor and 4.5 outdoor, the ground-truth radius is 20 m outdoors and 4 m indoors, the proposed method uses 10 loop candidates while STD is given 50, and Table II shows that performance is sensitive to the number of candidates. To support the claimed advantage, report a fixed or cross-validated setting across all sequences, use the same candidate budget for all methods, and show the sensitivity of the final AUC/F1 to each threshold.
[Table I] The universal claim in the abstract that RE-TRIP outperforms existing state-of-the-art methods is contradicted by the building row of Table I, where STD-1 achieves AUC 0.89 and max F1 0.82 against 0.84 and 0.80 for RE-TRIP. This should be discussed explicitly and the claim qualified, especially because FusionPortable is one of the two datasets used to support the conclusion.
[Sec. III-B, Eq. (5)] The EuclideanClusterExtraction parameters (cluster tolerance, minimum and maximum cluster size) are not reported. These parameters directly control which keypoints form instances and therefore which triangles are generated; without them the method is not reproducible from the paper and the sensitivity of the results to clustering is unknown. Report the exact PCL parameters and an ablation or robustness check.
[Sec. IV-B] The baseline set is narrow for the claim of outperforming state-of-the-art. Only SC, ISC, and STD are compared, with no recent learned or projection-based LiDAR place-recognition methods. The abstract and introduction should either be reworded to state the comparison scope or additional baselines should be included.

minor comments (4)

[Sec. III-B.3] There is a notation error in the key instance set building: when |I A| < k, the remaining instances are filled from I R, but the set is written as {I R_1, ..., I R_{k−|IR|}}; the upper index should be k−|I A|, not k−|IR|.
[Sec. III-D] The hash key construction is not fully specified: the sorted side lengths must be quantized or binned to form a hash key, but the quantization step and bin size are not described, which prevents exact reproduction of the retrieval stage.
[Sec. III-E] The reflectivity layer count and the layer threshold zL are not specified, although the layer index lambda is used in the verification Eq. (10); the paper should state these values and how they were chosen.
[Fig. 4 / Table I] Some results are visually or numerically surprising, e.g., BR02 has SC max F1 = 0.83 despite AUC = 0.41, and the corridor row shows SC F1 = 0.75 with AUC = 0.38; a short explanation of these PR-curve shapes would aid interpretation.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: RE-TRIP is an empirical descriptor method evaluated against external baselines; keypoint definitions are operational, not derived.

full rationale

The paper makes no first-principles derivation claim; RE-TRIP is a proposed descriptor evaluated on public datasets (HELIPR, FusionPortable) against external baselines (SC, ISC, STD). The keypoint definitions in Eqs. (1)-(4) are operational definitions, not deductions: ARP are, by definition, points whose reflectivity exceeds the scan mean by zA standard deviations, and RRP are defined by a neighbor contrast. No quantity is fitted and then renamed a prediction; the reported AUC and F1 scores are measured on the evaluation sequences with fixed hyperparameters. The ablations compare variants of the method against each other, which is internal consistency checking, not circularity. The paper does not cite prior work by its own authors, so there is no self-citation chain. The only legitimate concern is that zA, sigma_n, sigma_d, sigma_lambda, k, and the loop-candidate count are set using the same datasets on which results are reported, and reflectivity repeatability is asserted rather than demonstrated; but parameter tuning on an evaluation set is an external-validity risk, not equation-level circularity. No step reduces to its input by construction.

Assumptions & free parameters 10 free parameters · 5 assumptions · 0 invented entities

The central claim rests on several unverified empirical assumptions and a number of hand-set thresholds. The reflectivity stability assumption is load-bearing. The thresholds zA, sigma_n, sigma_d, sigma_lambda, k, loop candidates, layer count, along with unspecified delta_r and clustering parameters, are free parameters that affect the reported performance. No new physical entities are introduced.

free parameters (10)

zA = 3.5 (indoor), 4.5 (outdoor)
ARP z-score threshold in Eq. (1); environment-specific tuning; affects which points become keypoints.
delta_r = not specified
Threshold for local reflectivity variance in Eq. (3); central to RRP extraction and not given a numeric value.
sigma_n = 0.2
Plane normal overlap threshold in Eq. (8); preset for loop verification.
sigma_d = 0.3
Plane distance overlap threshold in Eq. (9); preset for loop verification.
sigma_lambda = 3
Reflectivity layer match threshold in Eq. (10); preset for loop verification.
k (key instance count) = 20
Number of key instances per scan; controls triangle count and computational cost.
Loop candidates = 10
Number of retrieval candidates; ablation in Table II shows sensitivity to this value.
Reflectivity layer count = 5
Number of reflectivity layers for verification; chosen by hand, not derived.
PCL clustering parameters = not specified
Parameters for EuclideanClusterExtraction (tolerance, min/max cluster size) in Eq. (5); affect instance segmentation.
Hash key quantization = not specified
Bin width for sorting triangle side lengths in the hash table, inherited from STD; not restated.

assumptions (5)

domain assumption High-reflectivity objects are stable and consistently detected across viewpoints and time
Section III-A.1 claims reflectivity objects can be observed regardless of density or viewpoint; this underpins ARP reliability. If reflection properties vary with incidence angle or surface degradation, keypoint consistency breaks.
domain assumption Dynamic objects and noise do not form large, persistent reflectivity clusters
Section III-B assumes noisy points fail to form meaningful clusters and larger instances imply higher reliability; dynamic objects are implicitly filtered by size. False if vehicles or pedestrians with reflective surfaces persist.
domain assumption Reflectivity distributions are comparable across sequences and sensors
zA and layer thresholds are computed per scan using mu_r and sigma_r, but fixed zA values across sequences assume distributional stability; Section IV-B sets zA differently indoor/outdoor, implying sensitivity.
standard math SVD-based transformation estimation from plane correspondences converges accurately enough for overlap verification
Section III-E uses SVD and plane correspondences following STD; assumes correct correspondences and no gross outliers after candidate retrieval.
ad hoc to paper Euclidean cluster extraction from PCL with unspecified parameters yields meaningful object instances
Section III-B.1 calls PCL EC without specifying tolerance, min/max cluster size; the segmentation outcome is load-bearing for instance construction.

how reviews work

0 comments

Cite this review

Pith. "Pith review of RE-TRIP : Reflectivity Instance Augmented Triangle Descriptor for 3D Place Recognition." pith.science (2026). https://pith.science/paper/7ZT66LVB

@misc{pith2026250516165,
  author       = {Pith},
  title        = {Pith review of: RE-TRIP : Reflectivity Instance Augmented Triangle Descriptor for 3D Place Recognition},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7ZT66LVB}},
  note         = {Machine review of arXiv:2505.16165}
}

read the original abstract

While most people associate LiDAR primarily with its ability to measure distances and provide geometric information about the environment (via point clouds), LiDAR also captures additional data, including reflectivity or intensity values. Unfortunately, when LiDAR is applied to Place Recognition (PR) in mobile robotics, most previous works on LiDAR-based PR rely only on geometric measurements, neglecting the additional reflectivity information that LiDAR provides. In this paper, we propose a novel descriptor for 3D PR, named RE-TRIP (REflectivity-instance augmented TRIangle descriPtor). This new descriptor leverages both geometric measurements and reflectivity to enhance robustness in challenging scenarios such as geometric degeneracy, high geometric similarity, and the presence of dynamic objects. To implement RE-TRIP in real-world applications, we further propose (1) a keypoint extraction method, (2) a key instance segmentation method, (3) a RE-TRIP matching method, and (4) a reflectivity-combined loop verification method. Finally, we conduct a series of experiments to demonstrate the effectiveness of RE-TRIP. Applied to public datasets (i.e., HELIPR, FusionPortable) containing diverse scenarios such as long corridors, bridges, large-scale urban areas, and highly dynamic environments -- our experimental results show that the proposed method outperforms existing state-of-the-art methods in terms of Scan Context, Intensity Scan Context, and STD.

Figures

Figures reproduced from arXiv: 2505.16165 by the authors.

**Figure 2.** The overall framework of our proposed method consists of four steps. First, keypoints are extracted based on reflectivity measurement, identifying [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗

**Figure 3.** Description of RE-TRIP matching between DQ and DR. It consists of three steps: (1) side length matching, (2) label matching, and (3) instance size comparison. offer more reliable detection across varying conditions. The selection of S is performed as follow, if |IA| ≥ k, we select the top k instances from I A, i.e., S = {I A 1 , I A 2 , . . . , I A k }. However, if |IA| < k, all instances from I A are selected, and … view at source ↗

Figures from the paper (2 more)

**Figure 4.** Figure 4: Precision-Recall curves (top two rows) and F1 Score-Recall curves (bottom two rows) for HELIPR and FusionPortable. [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]

**Figure 5.** Figure 5: Keypoint ablation results. (a) and (b) compare the performance of ARP, RRP, and the combined approach across all sequences of HELIPR. The [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 29 canonical work pages

[1]

Lio-sam: Tightly-coupled lidar inertial odometry via smoothing and mapping,

T. Shan, B. Englot, D. Meyers, W. Wang, C. Ratti, and D. Rus, “Lio-sam: Tightly-coupled lidar inertial odometry via smoothing and mapping,” in 2020 IEEE/RSJ international conference on intelligent robots and systems (IROS) . IEEE, 2020, pp. 5135–5142

2020
[2]

Orb-slam: a versatile and accurate monocular slam system,

R. Mur-Artal, J. M. M. Montiel, and J. D. Tardos, “Orb-slam: a versatile and accurate monocular slam system,” IEEE transactions on robotics, vol. 31, no. 5, pp. 1147–1163, 2015

2015
[3]

Lta- om: Long-term association lidar–imu odometry and mapping,

Z. Zou, C. Yuan, W. Xu, H. Li, S. Zhou, K. Xue, and F. Zhang, “Lta- om: Long-term association lidar–imu odometry and mapping,” Journal of Field Robotics , 2024

work page 2024
[4]

Intensity-slam: Intensity assisted localization and mapping for large scale environment,

H. Wang, C. Wang, and L. Xie, “Intensity-slam: Intensity assisted localization and mapping for large scale environment,” IEEE Robotics and Automation Letters , vol. 6, no. 2, pp. 1715–1721, 2021

2021
[5]

1-day learning, 1-year localization: Long-term lidar localization using scan context image,

G. Kim, B. Park, and A. Kim, “1-day learning, 1-year localization: Long-term lidar localization using scan context image,” IEEE Robotics and Automation Letters , vol. 4, no. 2, pp. 1948–1955, 2019

work page 1948
[6]

Tightly Coupled Range Inertial Localization on a 3D Prior Map Based on Sliding Window Factor Graph Optimization

K. Koide, S. Oishi, M. Yokozuka, and A. Banno, “Tightly coupled range inertial localization on a 3d prior map based on sliding window factor graph optimization,” arXiv preprint arXiv:2402.05540 , 2024

work page Pith review arXiv 2024
[7]

Speeded-up robust features (surf),

H. Bay, A. Ess, T. Tuytelaars, and L. Van Gool, “Speeded-up robust features (surf),” Computer vision and image understanding , vol. 110, no. 3, pp. 346–359, 2008

work page 2008
[8]

Visual place recognition: A survey,

S. Lowry, N. S ¨underhauf, P. Newman, J. J. Leonard, D. Cox, P. Corke, and M. J. Milford, “Visual place recognition: A survey,” ieee trans- actions on robotics , vol. 32, no. 1, pp. 1–19, 2015

work page 2015

Show all 36 references

[9]

Orb: An efficient alternative to sift or surf,

E. Rublee, V . Rabaud, K. Konolige, and G. Bradski, “Orb: An efficient alternative to sift or surf,” in 2011 International conference on computer vision . Ieee, 2011, pp. 2564–2571

2011
[10]

Bags of binary words for fast place recognition in image sequences,

D. G ´alvez-L´opez and J. D. Tardos, “Bags of binary words for fast place recognition in image sequences,” IEEE Transactions on robotics, vol. 28, no. 5, pp. 1188–1197, 2012

2012
[11]

Robust place recognition for 3d range data based on point features,

B. Steder, G. Grisetti, and W. Burgard, “Robust place recognition for 3d range data based on point features,” in 2010 IEEE International Conference on Robotics and Automation. IEEE, 2010, pp. 1400–1405

2010
[12]

Fast 3d recognition and pose using the viewpoint feature histogram,

R. B. Rusu, G. Bradski, R. Thibaux, and J. Hsu, “Fast 3d recognition and pose using the viewpoint feature histogram,” in 2010 IEEE/RSJ international conference on intelligent robots and systems . IEEE, 2010, pp. 2155–2162

2010
[13]

Effectively detecting loop closures using point cloud density maps,

S. Gupta, T. Guadagnino, B. Mersch, I. Vizzo, and C. Stachniss, “Effectively detecting loop closures using point cloud density maps,” in Proc. of the IEEE Intl. Conf. on Robotics & Automation (ICRA) , 2024

2024
[14]

Scan context++: Structural place recog- nition robust to rotation and lateral variations in urban environments,

G. Kim, S. Choi, and A. Kim, “Scan context++: Structural place recog- nition robust to rotation and lateral variations in urban environments,” IEEE Transactions on Robotics , vol. 38, no. 3, pp. 1856–1874, 2021

2021
[15]

M2dp: A novel 3d point cloud descriptor and its application in loop closure detection,

L. He, X. Wang, and H. Zhang, “M2dp: A novel 3d point cloud descriptor and its application in loop closure detection,” in 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2016, pp. 231–237

2016
[16]

Btc: A binary and triangle combined descriptor for 3d place recognition,

C. Yuan, J. Lin, Z. Liu, H. Wei, X. Hong, and F. Zhang, “Btc: A binary and triangle combined descriptor for 3d place recognition,” IEEE Transactions on Robotics , 2024

2024
[17]

Std: Stable triangle descriptor for 3d place recognition,

C. Yuan, J. Lin, Z. Zou, X. Hong, and F. Zhang, “Std: Stable triangle descriptor for 3d place recognition,” in 2023 IEEE international conference on robotics and automation (ICRA) . IEEE, 2023, pp. 1897–1903

2023
[18]

A triangle feature based map-to- map matching and loop closure for 2d graph slam,

B. Jiang, Y . Zhu, and M. Liu, “A triangle feature based map-to- map matching and loop closure for 2d graph slam,” in 2019 IEEE International Conference on Robotics and Biomimetics (ROBIO) . IEEE, 2019, pp. 2719–2725

2019
[19]

Coin-lio: Complementary intensity-augmented lidar inertial odometry,

P. Pfreundschuh, H. Oleynikova, C. Cadena, R. Siegwart, and O. An- dersson, “Coin-lio: Complementary intensity-augmented lidar inertial odometry,” in 2024 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2024, pp. 1730–1737

2024
[20]

Real-time simultaneous localization and mapping with lidar intensity,

W. Du and G. Beltrame, “Real-time simultaneous localization and mapping with lidar intensity,” in 2023 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2023, pp. 4164–4170

2023
[21]

Fmcw-lio: A doppler lidar-inertial odometry,

M. Zhao, J. Wang, T. Gao, C. Xu, and H. Kong, “Fmcw-lio: A doppler lidar-inertial odometry,” IEEE Robotics and Automation Letters, 2024

2024
[22]

Ri- lio: reflectivity image assisted tightly-coupled lidar-inertial odometry,

Y . Zhang, Y . Tian, W. Wang, G. Yang, Z. Li, F. Jing, and M. Tan, “Ri- lio: reflectivity image assisted tightly-coupled lidar-inertial odometry,” IEEE Robotics and Automation Letters , vol. 8, no. 3, pp. 1802–1809, 2023

2023
[23]

Intensity scan context: Coding intensity and geometry relations for loop closure detection,

H. Wang, C. Wang, and L. Xie, “Intensity scan context: Coding intensity and geometry relations for loop closure detection,” in 2020 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2020, pp. 2095–2101

2020
[24]

Distinctive image features from scale-invariant key- points,

D. G. Lowe, “Distinctive image features from scale-invariant key- points,” International journal of computer vision , vol. 60, pp. 91–110, 2004

2004
[25]

Brief: Binary robust independent elementary features,

M. Calonder, V . Lepetit, C. Strecha, and P. Fua, “Brief: Binary robust independent elementary features,” in Computer Vision–ECCV 2010: 11th European Conference on Computer Vision, Heraklion, Crete, Greece, September 5-11, 2010, Proceedings, Part IV 11 . Springer, 2010, pp. 778–792

2010
[26]

A 3-dimensional sift descriptor and its application to action recognition,

P. Scovanner, S. Ali, and M. Shah, “A 3-dimensional sift descriptor and its application to action recognition,” in Proceedings of the 15th ACM international conference on Multimedia , 2007, pp. 357–360

2007
[27]

Shot: Unique signatures of histograms for surface and texture description,

S. Salti, F. Tombari, and L. Di Stefano, “Shot: Unique signatures of histograms for surface and texture description,” Computer Vision and Image Understanding, vol. 125, pp. 251–264, 2014

2014
[28]

Hough transform and 3d surf for robust three dimensional classifi- cation,

J. Knopp, M. Prasad, G. Willems, R. Timofte, and L. Van Gool, “Hough transform and 3d surf for robust three dimensional classifi- cation,” in Computer Vision–ECCV 2010: 11th European Conference on Computer Vision, Heraklion, Crete, Greece, September 5-11, 2010, Proceedings, Pa...

2010
[29]

Scan context: Egocentric spatial descriptor for place recognition within 3d point cloud map,

G. Kim and A. Kim, “Scan context: Egocentric spatial descriptor for place recognition within 3d point cloud map,” in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2018, pp. 4802–4809

2018
[30]

Visual place recognition using lidar intensity information,

L. Di Giammarino, I. Aloise, C. Stachniss, and G. Grisetti, “Visual place recognition using lidar intensity information,” in 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2021, pp. 4382–4389

2021
[31]

Robust place recognition using an imaging lidar,

T. Shan, B. Englot, F. Duarte, C. Ratti, and D. Rus, “Robust place recognition using an imaging lidar,” in 2021 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2021, pp. 5469–5475

2021
[32]

3d is here: Point cloud library (pcl),

R. B. Rusu and S. Cousins, “3d is here: Point cloud library (pcl),” in 2011 IEEE international conference on robotics and automation . IEEE, 2011, pp. 1–4

2011
[33]

Outram: One-shot global localization via triangulated scene graph and global outlier pruning,

P. Yin, H. Cao, T.-M. Nguyen, S. Yuan, S. Zhang, K. Liu, and L. Xie, “Outram: One-shot global localization via triangulated scene graph and global outlier pruning,” in 2024 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2024, pp. 13 717–13 723

2024
[34]

Helipr: Heterogeneous lidar dataset for inter-lidar place recognition under spatiotemporal variations,

M. Jung, W. Yang, D. Lee, H. Gil, G. Kim, and A. Kim, “Helipr: Heterogeneous lidar dataset for inter-lidar place recognition under spatiotemporal variations,” The International Journal of Robotics Research, p. 02783649241242136, 2023

2023
[35]

Mulran: Multimodal range dataset for urban place recognition,

G. Kim, Y . S. Park, Y . Cho, J. Jeong, and A. Kim, “Mulran: Multimodal range dataset for urban place recognition,” in 2020 IEEE international conference on robotics and automation (ICRA) . IEEE, 2020, pp. 6246–6253

2020
[36]

Fusionportable: A multi-sensor campus- scene dataset for evaluation of localization and mapping accuracy on diverse platforms,

J. Jiao, H. Wei, T. Hu, X. Hu, Y . Zhu, Z. He, J. Wu, J. Yu, X. Xie, H. Huang et al. , “Fusionportable: A multi-sensor campus- scene dataset for evaluation of localization and mapping accuracy on diverse platforms,” in 2022 IEEE/RSJ International Conference on Intelligent Robo...

2022

Pith tools

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

[1] [1]

Lio-sam: Tightly-coupled lidar inertial odometry via smoothing and mapping,

T. Shan, B. Englot, D. Meyers, W. Wang, C. Ratti, and D. Rus, “Lio-sam: Tightly-coupled lidar inertial odometry via smoothing and mapping,” in 2020 IEEE/RSJ international conference on intelligent robots and systems (IROS) . IEEE, 2020, pp. 5135–5142

2020

[2] [2]

Orb-slam: a versatile and accurate monocular slam system,

R. Mur-Artal, J. M. M. Montiel, and J. D. Tardos, “Orb-slam: a versatile and accurate monocular slam system,” IEEE transactions on robotics, vol. 31, no. 5, pp. 1147–1163, 2015

2015

[3] [3]

Lta- om: Long-term association lidar–imu odometry and mapping,

Z. Zou, C. Yuan, W. Xu, H. Li, S. Zhou, K. Xue, and F. Zhang, “Lta- om: Long-term association lidar–imu odometry and mapping,” Journal of Field Robotics , 2024

work page 2024

[4] [4]

Intensity-slam: Intensity assisted localization and mapping for large scale environment,

H. Wang, C. Wang, and L. Xie, “Intensity-slam: Intensity assisted localization and mapping for large scale environment,” IEEE Robotics and Automation Letters , vol. 6, no. 2, pp. 1715–1721, 2021

2021

[5] [5]

1-day learning, 1-year localization: Long-term lidar localization using scan context image,

G. Kim, B. Park, and A. Kim, “1-day learning, 1-year localization: Long-term lidar localization using scan context image,” IEEE Robotics and Automation Letters , vol. 4, no. 2, pp. 1948–1955, 2019

work page 1948

[6] [6]

Tightly Coupled Range Inertial Localization on a 3D Prior Map Based on Sliding Window Factor Graph Optimization

K. Koide, S. Oishi, M. Yokozuka, and A. Banno, “Tightly coupled range inertial localization on a 3d prior map based on sliding window factor graph optimization,” arXiv preprint arXiv:2402.05540 , 2024

work page Pith review arXiv 2024

[7] [7]

Speeded-up robust features (surf),

H. Bay, A. Ess, T. Tuytelaars, and L. Van Gool, “Speeded-up robust features (surf),” Computer vision and image understanding , vol. 110, no. 3, pp. 346–359, 2008

work page 2008

[8] [8]

Visual place recognition: A survey,

S. Lowry, N. S ¨underhauf, P. Newman, J. J. Leonard, D. Cox, P. Corke, and M. J. Milford, “Visual place recognition: A survey,” ieee trans- actions on robotics , vol. 32, no. 1, pp. 1–19, 2015

work page 2015