Construct · 1 fields · 1 citations

iterative closest point: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computer vision

algorithm that aligns two 3D shapes or point clouds by alternately matching nearest points and solving for the best rigid transform.

In computer vision, iterative closest point refers to algorithm that aligns two 3D shapes or point clouds by alternately matching nearest points and solving for the best rigid transform. This meaning comes from Besl (1992) in IEEE Transactions on Pattern Analysis and Machine Intelligence.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how iterative closest point sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

dermoscopic pattern analysis1 fields · 1 citationsanchor · a standalone construct intelligence6 fields · 14 citationsjingle · one name, six constructs matching4 fields · 4 citationsjingle · one word, four constructs

References

Besl, P. J., & McKay, N. D. (1992). A method for registration of 3-D shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(2), 239-256. https://doi.org/10.1109/34.121791

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct