The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
An ICP variant using a point-to-line metric
Abstract
This paper describes PLICP, an ICP (iterative closest/corresponding point) variant that uses a point-to-line metric, and an exact closed-form for minimizing such metric. The resulting algorithm has some interesting properties: it converges quadratically, and in a finite number of steps. The method is validated against vanilla ICP, IDC (iterative dual correspondences), and MBICP (Metric-Based ICP) by reproducing the experiments performed in Minguez et al. (2006). The experiments suggest that PLICP is more precise, and requires less iterations. However, it is less robust to very large initial displacement errors. The last part of the paper is devoted to purely algorithmic optimization of the correspondence search; this allows for a significant speed-up of the computation. The source code is available for download.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for registration of 3-D shapes
Besl, P. J., & McKay, N. D. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.121791 · Cited by 18,103
Efficient variants of the ICP algorithm
Rusinkiewicz, S., & Levoy, M. (2002) · Proceedings Third International Conference on 3-D Digital Imaging and Modeling · doi:10.1109/im.2001.924423 · Cited by 3,945
The Player/Stage Project: Tools for Multi-Robot and Distributed Sensor Systems
Gerkey, B. P., Vaughan, R., & Howard, A. B. (2003) · Cited by 1,451
Object modeling by registration of multiple range images
Chen, Y., & Medioni, G. (2002) · Proceedings. 1991 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1991.132043 · Cited by 1,409
Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans
Lu, F., & Milios, E. (1997) · Journal of Intelligent and Robotic Systems · doi:10.1023/a:1007957421070 · Cited by 675
The Trimmed Iterative Closest Point algorithm
Chetverikov, D., Svirko, D., Stepanov, D., & Krsek, P. (2003) · Object recognition supported by user interaction for service robots · doi:10.1109/icpr.2002.1047997 · Cited by 617
Robot pose estimation in unknown environments by matching 2D range scans
Lu, F., & Milios (1994) · Proceedings of IEEE Conference on Computer Vision and Pattern Recognition CVPR-94 · doi:10.1109/cvpr.1994.323928 · Cited by 408
Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes
Pottmann, H., Huang, Q.-X., Yang, Y.-L., & Hu, S.-M. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-5167-2 · Cited by 218
Weighted range sensor matching algorithms for mobile robot displacement estimation
Pfister, S. T., Kriechbaum, K. L., Roumeliotis, S. I., & Burdick, J. W. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2002.1014782 · Cited by 130
Metric-Based Scan Matching Algorithms for Mobile Robot Displacement Estimation
Mínguez, J., Lamiraux, F., & Montesano, L. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2005.1570661 · Cited by 101
Probabilistic scan matching for motion estimation in unstructured environments
Montesano, L., Mínguez, J., & Montano, L. (2005) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2005.1545182 · Cited by 94
Scan matching in a probabilistic framework
Censi, A. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2006.1642044 · Cited by 28
Self-citationScan alignment with probabilistic distance metric
Jensen, B., & Siegwart, R. (2005) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2004.1389734 · Cited by 21
Cited by
3-D Mapping With an RGB-D Camera
Endres, F., Hess, J., Sturm, J., Cremers, D., & Burgard, W. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2013.2279412 · Cited by 820
Toward a Fully Autonomous UAV: Research Platform for Indoor and Outdoor Urban Search and Rescue
Tomic, T., Schmid, K., Lutz, P., Domel, A., Kassecker, M., Mair, E., Grixa, I., Ruess, F., Suppa, M., & Burschka, D. (2012) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2012.2206473 · Cited by 814
A Review of Point Cloud Registration Algorithms for Mobile Robotics
Pomerleau, F., Colas, F., & Siegwart, R. (2015) · Foundations and Trends® in Robotics · doi:10.1561/2300000035 · Cited by 717
Real-time correlative scan matching
Olson, E. B. (2009) · 2009 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2009.5152375 · Cited by 361
Multiple-Robot Simultaneous Localization and Mapping: A Review
Saeedi, S., Trentini, M., Seto, M., & Li, H. (2016) · Journal of Field Robotics · doi:10.1002/rob.21620 · Cited by 324
Metadata
- Authors
- Censi, A.
- Venue
- 2008 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2008-05
- Pages
- 19-25
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2130763585
- Cited by
- 626
- References
- 13
- FWCI
- 15.22
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.