The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
4-points congruent sets for robust pairwise surface registration
Abstract
We introduce 4PCS, a fast and robust alignment scheme for 3D point sets that uses wide bases, which are known to be resilient to noise and outliers. The algorithm allows registering raw noisy data, possibly contaminated with outliers, without pre-filtering or denoising the data. Further, the method significantly reduces the number of trials required to establish a reliable registration between the underlying surfaces in the presence of noise, without any assumptions about starting alignment. Our method is based on a novel technique to extract all coplanar 4-points sets from a 3D point set that are approximately congruent, under rigid transformation, to a given set of coplanar 4-points. This extraction procedure runs in roughly O(n2 + k) time, where n is the number of candidate points and k is the number of reported 4-points sets. In practice, when noise level is low and there is sufficient overlap, using local descriptors the time complexity reduces to O(n + k). We also propose an extension to handle similarity and affine transforms. Our technique achieves an order of magnitude asymptotic acceleration compared to common randomized alignment techniques. We demonstrate the robustness of our algorithm on several sets of multiple range scans with varying degree of noise, outliers, and extent of overlap.
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
Closed-form solution of absolute orientation using unit quaternions
Horn, B. K. P. (1987) · Journal of the Optical Society of America A · doi:10.1364/josaa.4.000629 · Cited by 4,116
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
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1998) · Journal of the ACM · doi:10.1145/293347.293348 · Cited by 2,300
Geometric hashing: an overview
Wolfson, H. J., & Rigoutsos, I. (1997) · IEEE Computational Science and Engineering · doi:10.1109/99.641604 · Cited by 557
Recognizing solid objects by alignment with an image
Huttenlocher, D. P., & Ullman, S. (1990) · International Journal of Computer Vision · doi:10.1007/bf00054921 · Cited by 529
Salient geometric features for partial shape matching and similarity
Gal, R., & Cohen-Or, D. (2006) · ACM Transactions on Graphics · doi:10.1145/1122501.1122507 · Cited by 497
Self-citationEfficient shape matching using shape contexts
Mori, G., Belongie, S., & Malik, J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.220 · Cited by 458
Chen, 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
Cited by
Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registration
Yang, J., Li, H., Campbell, D., & Jia, Y. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2513405 · Cited by 1,170
Go-ICP: Solving 3D Registration Efficiently and Globally Optimally
Yang, J., Li, H., & Jia, Y. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.184 · Cited by 486
Unsupervised Learning of Probabilistic Diffeomorphic Registration for Images and Surfaces
Dalca, A. V., Balakrishnan, G., Guttag, J., & Sabuncu, M. R. (2019) · Medical Image Analysis · doi:10.1016/j.media.2019.07.006 · Cited by 467
M2DP: A novel 3D point cloud descriptor and its application in loop closure detection
He, L., Wang, X., & Zhang, H. (2016) · 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2016.7759060 · Cited by 395
Fast and Robust Iterative Closest Point
Zhang, J., Yao, Y., & Deng, B. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3054619 · Cited by 343
Metadata
- Authors
- Aiger, D., Mitra, N. J., & Cohen-Or, D.
- Venue
- ACM SIGGRAPH 2008 papers
- Publisher
- ACM
- Published
- 2008-08
- Pages
- 1-10
- OpenAlex
- W4237162356
- Cited by
- 285
- References
- 20
- FWCI
- 9.26
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: 4-points congruent sets for robust pairwise surface registration. https://app.cochat.ai/papers/10.1145/1399504.1360684
- The paper
- Aiger, D., Mitra, N. J., & Cohen-Or, D. (2008). 4-points congruent sets for robust pairwise surface registration. ACM SIGGRAPH 2008 papers. https://doi.org/10.1145/1399504.1360684
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.