Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 191

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

The 3D-3D Registration Problem Revisited

Li, Hongdong, Hartley, Richard·2007·2007 IEEE 11th International Conference on Computer Vision

Abstract

We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in many applications. Existing methods are not fully satisfactory, mainly due to the risk of local minima. Our framework is grounded on the Lipschitz global optimization theory. It achieves a guaranteed global optimality without any initialization. By exploiting the special structure of the problem itself and of the 3D rotation space SO(3), we propose a box-and-ball algorithm, which solves the problem efficiently. The main idea of the work can be applied to many other problems as well.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/iccv.2007.4409077

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 191

Metadata

Authors
Li, H., & Hartley, R.
Venue
2007 IEEE 11th International Conference on Computer Vision
Publisher
IEEE
Published
2007
Pages
1-8
OpenAlex
W2164703480
Cited by
191
References
1
FWCI
13.61
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: The 3D-3D Registration Problem Revisited. https://app.cochat.ai/papers/10.1109/iccv.2007.4409077
The paper
Li, H., & Hartley, R. (2007). The 3D-3D Registration Problem Revisited. 2007 IEEE 11th International Conference on Computer Vision. https://doi.org/10.1109/iccv.2007.4409077

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.