The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Fast Point Feature Histograms (FPFH) for 3D registration
Abstract
In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point cloud datasets. In this paper, we modify their mathematical expressions and perform a rigorous analysis on their robustness and complexity for the problem of 3D registration for overlapping point cloud views. More concretely, we present several optimizations that reduce their computation times drastically by either caching previously computed values or by revising their theoretical formulations. The latter results in a new type of local features, called Fast Point Feature Histograms (FPFH), which retain most of the discriminative power of the PFH. Moreover, we propose an algorithm for the online computation of FPFH features for realtime applications. To validate our results we demonstrate their efficiency for 3D registration and propose a new sample consensus based method for bringing two datasets into the convergence basin of a local non-linear optimizer: SAC-IA (SAmple Consensus Initial Alignment).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Using spin images for efficient object recognition in cluttered 3D scenes
Johnson, A. E., & Hebert, M. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.765655 · Cited by 2,599
Iterative point matching for registration of free-form curves and surfaces
Zhang, Z. (1994) · International Journal of Computer Vision · doi:10.1007/bf01427149 · Cited by 2,402
Towards 3D Point cloud based object maps for household environments
Rusu, R. B., Marton, Z. C., Blodow, N., Dolha, M., & Beetz, M. (2008) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2008.08.005 · Cited by 1,084
Self-citationAligning point cloud views using persistent feature histograms
Rusu, R. B., Blodow, N., Marton, Z. C., & Beetz, M. (2008) · 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2008.4650967 · Cited by 1,034
Self-citationRobust registration of 2D and 3D point sets
Fitzgibbon, A. W. (2003) · Image and Vision Computing · doi:10.1016/j.imavis.2003.09.004 · Cited by 925
ICP registration using invariant features
Sharp, G. C., Lee, S. W., & Wehe, D. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.982886 · Cited by 614
Least squares 3D surface and curve matching
Gruen, A., & Akca, D. (2005) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2005.02.006 · Cited by 536
Gelfand, N., Mitra, N. J., Guibas, L., & Pottmann, H. (2005) · doi:10.2312/sgp/sgp05/197-206 · Cited by 514
Geometrically stable sampling for the ICP algorithm
Gelfand, N., Ikemoto, L., Rusinkiewicz, S., & Levoy, M. (2004) · Fourth International Conference on 3-D Digital Imaging and Modeling, 2003. 3DIM 2003. Proceedings. · doi:10.1109/im.2003.1240258 · Cited by 350
Fully Automatic Registration of 3D Point Clouds
Makadia, A., Patterson, A. I., & Daniilidis, K. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.122 · Cited by 306
Histogram intersection kernel for image classification
Barla, A., Odone, F., & Verri, A. (2004) · Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429) · doi:10.1109/icip.2003.1247294 · Cited by 281
Iterative point matching for registration of free-form curves
Zhang, Z. (1992) · Cited by 277
Learning informative point classes for the acquisition of object model maps
Rusu, R. B., Marton, Z. C., Blodow, N., & Beetz, M. (2008) · 2008 10th International Conference on Control, Automation, Robotics and Vision · doi:10.1109/icarcv.2008.4795593 · Cited by 234
Self-citationSilva, L., Bellon, O. R. P., & Boyer, K. L. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.108 · Cited by 222
Persistent Point Feature Histograms for 3D Point Clouds
Bogdan, R. R., Csaba, M. Z., Nico, B., & Michael, B. (2008) · Intelligent Autonomous Systems 10 · doi:10.3233/978-1-58603-887-8-119 · Cited by 219
Cached k-d tree search for ICP algorithms
Nuchter, A., Lingemann, K., & Hertzberg, J. (2007) · Sixth International Conference on 3-D Digital Imaging and Modeling (3DIM 2007) · doi:10.1109/3dim.2007.15 · Cited by 174
Robust Registration of 2D and 3D Point Sets
Fitzgibbon, A. W. (2001) · British Machine Vision Conference (BMVC) · doi:10.5244/c.15.43 · Cited by 157
Cordón, Ó., Damas, S., & Santamaría, J. (2006) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.07.017 · Cited by 71
Cited by
PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation
Charles, R. Q., Su, H., Kaichun, M., & Guibas, L. J. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.16 · Cited by 9,237
Dynamic Graph CNN for Learning on Point Clouds
Wang, Y., Sun, Y., Liu, Z., Sarma, S. E., Bronstein, M. M., & Solomon, J. M. (2019) · ACM Transactions on Graphics · doi:10.1145/3326362 · Cited by 7,199
3D is here: Point Cloud Library (PCL)
Rusu, R. B., & Cousins, S. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980567 · Cited by 4,885
Self-citationVoxelNet: End-to-End Learning for Point Cloud Based 3D Object Detection
Zhou, Y., & Tuzel, O. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00472 · Cited by 4,813
PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation
Qi, C. R., Su, H., Mo, K., & Guibas, L. J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.00593 · Cited by 2,817
Metadata
- Authors
- Rusu, R. B., Blodow, N., & Beetz, M.
- Venue
- 2009 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2009-05
- Pages
- 3212-3217
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2160821342
- Cited by
- 3,878
- References
- 20
- FWCI
- 66.38
- 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.