The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Super 4PCS Fast Global Pointcloud Registration via Smart Indexing
Abstract
Data acquisition in large‐scale scenes regularly involves accumulating information across multiple scans. A common approach is to locally align scan pairs using Iterative Closest Point (ICP) algorithm (or its variants), but requires static scenes and small motion between scan pairs. This prevents accumulating data across multiple scan sessions and/or different acquisition modalities (e.g., stereo, depth scans). Alternatively, one can use a global registration algorithm allowing scans to be in arbitrary initial poses. The state‐of‐the‐art global registration algorithm, 4PCS, however has a quadratic time complexity in the number of data points. This vastly limits its applicability to acquisition of large environments. We present S uper 4PCS for global pointcloud registration that is optimal, i.e., runs in linear time (in the number of data points) and is also output sensitive in the complexity of the alignment problem based on the (unknown) overlap across scan pairs. Technically, we map the algorithm as an ‘instance problem’ and solve it efficiently using a smart indexing data organization. The algorithm is simple, memory‐efficient, and fast. We demonstrate that S uper 4PCS results in significant speedup over alternative approaches and allows unstructured efficient acquisition of scenes at scales previously not possible. Complete source code and datasets are available for research use at http://geometry.cs.ucl.ac.uk/projects/2014/super4PCS/.
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
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
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
Gorski, K. M., Hivon, E., Banday, A. J., Wandelt, B. D., Hansen, F. K., Reinecke, M., & Bartelmann, M. (2005) · The Astrophysical Journal · doi:10.1086/427976 · Cited by 5,958
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
Object modelling by registration of multiple range images
Chen, Y., & Medioni, G. (1992) · Image and Vision Computing · doi:10.1016/0262-8856(92)90066-c · Cited by 3,154
KinectFusion: real-time 3D reconstruction and interaction using a moving depth camera
Izadi, S., Kim, D., Hilliges, O., Molyneaux, D., Newcombe, R., Kohli, P., Shotton, J., Hodges, S., Freeman, D., Davison, A., et al. (2011) · Proceedings of the 24th annual ACM symposium on User interface software and technology · doi:10.1145/2047196.2047270 · Cited by 2,110
Quad trees a data structure for retrieval on composite keys
Finkel, R. A., & Bentley, J. L. (1974) · Acta Informatica · doi:10.1007/bf00288933 · Cited by 2,041
Local Invariant Feature Detectors: A Survey
Tuytelaars, T., & Mikolajczyk, K. (2007) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000017 · Cited by 1,186
Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid
Tam, G. K. L., Cheng, Z.-Q., Lai, Y.-K., Langbein, F. C., Liu, Y., Marshall, D., Martin, R. R., Sun, X.-F., & Rosin, P. L. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.310 · Cited by 679
4-points congruent sets for robust pairwise surface registration
Aiger, D., Mitra, N. J., & Cohen-Or, D. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360684 · Cited by 677
Self-citationReal-time 3D model acquisition
Rusinkiewicz, S., Hall-Holt, O., & Levoy, M. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566600 · Cited by 576
Sparse Iterative Closest Point
Bouaziz, S., Tagliasacchi, A., & Pauly, M. (2013) · Computer Graphics Forum · doi:10.1111/cgf.12178 · Cited by 534
Gelfand, N., Mitra, N. J., Guibas, L., & Pottmann, H. (2005) · doi:10.2312/sgp/sgp05/197-206 · Cited by 514
Self-citationChen, C.-S., Hung, Y.-P., & Cheng, J.-B. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.809117 · Cited by 356
Real-time 3D model acquisition
Rusinkiewicz, S., Hall-Holt, O., & Levoy, M. (2002) · ACM Transactions on Graphics · doi:10.1145/566654.566600 · Cited by 319
Cutting hyperplanes for divide-and-conquer
Chazelle, B. (1993) · Discrete & Computational Geometry · doi:10.1007/bf02189314 · Cited by 270
Registration of point cloud data from a geometric optimization perspective
Mitra, N. J., Gelfand, N., Pottmann, H., & Guibas, L. (2004) · Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing · doi:10.1145/1057432.1057435 · Cited by 262
Self-citationIntegral invariants for robust geometry processing
Pottmann, H., Wallner, J., Huang, Q.-X., & Yang, Y.-L. (2009) · Computer Aided Geometric Design · doi:10.1016/j.cagd.2008.01.002 · Cited by 207
Multi-scale features for approximate alignment of point-based surfaces
Li, X., & Guskov, I. (2005) · doi:10.5555/1281920.1281955 · Cited by 167
A Scale Independent Selection Process for 3D Object Recognition in Cluttered Scenes
Rodolà, E., Albarelli, A., Bergamasco, F., & Andrea Torsello, A. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-012-0568-x · Cited by 112
Local shape descriptor selection for object recognition in range data
Taati, B., & Greenspan, M. (2010) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2010.11.021 · Cited by 103
Fully Automatic Registration of Image Sets on Approximate Geometry
Corsini, M., Dellepiane, M., Ganovelli, F., Gherardi, R., Fusiello, A., & Scopigno, R. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-012-0552-5 · Cited by 75
Combinatorial and experimental results for randomized point matching algorithms
Irani, S., & Raghavan, P. (1996) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/237218.237240 · Cited by 58
Stochastic global optimization for robust point set registration
Papazov, C., & Burschka, D. (2011) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2011.05.008 · Cited by 58
SuperMatching: Feature Matching Using Supersymmetric Geometric Constraints
Cheng, Z., Chen, Y., Martin, R. R., Lai, Y., & Wang, A. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2013.15 · Cited by 39
Growing Least Squares for the Analysis of Manifolds in Scale‐Space
Mellado, N., Guennebaud, G., Barla, P., et al. (2012) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2012.03174.x · Cited by 37
Self-citationHierarchical Normal Space Sampling to speed up point cloud coarse matching
Díez, Y., Martı́, J., & Salví, J. (2012) · Pattern Recognition Letters · doi:10.1016/j.patrec.2012.07.006 · Cited by 31
Loosely Distinctive Features for Robust Surface Alignment
Albarelli, A., Rodolà, E., & Torsello, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15555-0_38 · Cited by 26
Stochastic Optimization for Rigid Point Set Registration
Papazov, C., & Burschka, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10331-5_97 · Cited by 18
Cited by
3DMatch: Learning Local Geometric Descriptors from RGB-D Reconstructions
Zeng, A., Song, S., Niessner, M., Fisher, M., Xiao, J., & Funkhouser, T. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.29 · Cited by 1,128
Zhou, Q.-Y., Park, J., & Koltun, V. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46475-6_47 · Cited by 1,028
DeepIM: Deep Iterative Matching for 6D Pose Estimation
Li, Y., Wang, G., Ji, X., Xiang, Y., & Fox, D. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01231-1_42 · Cited by 576
Robust reconstruction of indoor scenes
Choi, S., Zhou, Q.-Y., & Koltun, V. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7299195 · Cited by 555
Choy, C., Dong, W., & Koltun, V. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00259 · Cited by 548
Metadata
- Authors
- Mellado, N., Aiger, D., & Mitra, N. J.
- Venue
- Computer Graphics Forum
- Publisher
- Wiley
- Published
- 2014-08
- Volume
- 33
- Issue
- 5
- Pages
- 205-215
- ISSN
- 0167-7055 (ISSN-L)
- 1467-8659
- OpenAlex
- W2034950486
- Cited by
- 624
- References
- 29
- FWCI
- 25.15
- Type
- journal article
- 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.