The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A symmetric objective function for ICP
Open accessAbstract
The Iterative Closest Point (ICP) algorithm, commonly used for alignment of 3D models, has previously been defined using either a point-to-point or point-to-plane objective. Alternatively, researchers have proposed computationally-expensive methods that directly minimize the distance function between surfaces. We introduce a new symmetrized objective function that achieves the simplicity and computational efficiency of point-to-plane optimization, while yielding improved convergence speed and a wider convergence basin. In addition, we present a linearization of the objective that is exact in the case of exact correspondences. We experimentally demonstrate the improved speed and convergence basin of the symmetric objective, on both smooth models and challenging cases involving noise and partial overlap.
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
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 · cited 2×
“This is exploited by work such as the normal-space sampling of Rusinkiewicz and Levoy [2001], the covariance-eigenvector-directed sampling of Gelfand et al. [2003], and the stable sampling of Brown and Rusinkiewicz [2007], all of which bias the sampling to regions that are most necessary to…”
BackgroundMethodSelf-citationA volumetric method for building complex models from range images
Curless, B., & Levoy, M. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237269 · Cited by 3,124 · cited 1×
“Figure 4, left, shows the result of this experiment on the dragon model [Curless and Levoy 1996].”
Background4-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
Cited by
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
DeepGMR: Learning Latent Gaussian Mixture Models for Registration
Yuan, W., Eckart, B., Kim, K., Jampani, V., Fox, D., & Kautz, J. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58558-7_43 · Cited by 259
Metadata
- Authors
- Rusinkiewicz, S.
- Venue
- ACM Transactions on Graphics
- Published
- 2019-07-12
- Volume
- 38
- Issue
- 4
- Pages
- 1-7
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2961443823
- Cited by
- 178
- References
- 3
- FWCI
- 10.76
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A symmetric objective function for ICP. https://app.cochat.ai/papers/10.1145/3306346.3323037
- The paper
- Rusinkiewicz, S. (2019). A symmetric objective function for ICP. ACM Transactions on Graphics. https://doi.org/10.1145/3306346.3323037
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.