Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Iterative closest point

Known as: ICP, Iterative closest points, Surface registration 
Iterative Closest Point (ICP) is an algorithm employed to minimize the difference between two clouds of points. ICP is often used to reconstruct 2D… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Point cloud registration is a key problem for computer vision applied to robotics, medical imaging, and other applications. This… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Abstract This paper proposes probability iterative closest point (ICP) method based on expectation maximization (EM) estimation… Expand
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Rigid registration of two geometric data sets is essential in many applications, including robot navigation, surface… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
In RGB-D sensor based visual odometry the goal is to estimate a sequence of camera movements using image and/or range… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The traditional iterative closest point (ICP) algorithm is accurate and fast for rigid point set registration but it is unable to… Expand
  • figure 1
  • figure 2
  • table 2
  • table 1
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Point set registration is important for calibration of multiple cameras, 3D reconstruction and recognition, etc. The iterative… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We propose a novel technique for the registration of 3D point clouds which makes very few assumptions: we avoid any manual rough… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Abstract The problem of geometric alignment of two roughly pre-registered, partially overlapping, rigid, noisy 3D point sets is… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered… Expand
  • figure 1
  • table 2
  • table 3
Is this relevant?
2001
2001
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?