pcl::IterativeClosestPointNonLinear< PointSource, PointTarget > Class Template Reference

IterativeClosestPointNonLinear is an ICP variant that uses Levenberg-Marquardt optimization backend. The resultant transformation is optimized as a quaternion. More...

#include <icp_nl.h>

Inheritance diagram for pcl::IterativeClosestPointNonLinear< PointSource, PointTarget >:

List of all members.

Public Member Functions
	IterativeClosestPointNonLinear ()
	Empty constructor.

---

Detailed Description

template<typename PointSource, typename PointTarget>
class pcl::IterativeClosestPointNonLinear< PointSource, PointTarget >

IterativeClosestPointNonLinear is an ICP variant that uses Levenberg-Marquardt optimization backend. The resultant transformation is optimized as a quaternion.

The algorithm has several termination criteria:

1. Number of iterations has reached the maximum user imposed number of iterations (via setMaximumIterations)
2. The epsilon (difference) between the previous transformation and the current estimated transformation is smaller than an user imposed value (via setTransformationEpsilon)
3. The sum of Euclidean squared errors is smaller than a user defined threshold (via setEuclideanFitnessEpsilon)

Author:

Radu Bogdan Rusu, Michael Dixon

Definition at line 67 of file icp_nl.h.

---

Constructor & Destructor Documentation

template<typename PointSource, typename PointTarget>

pcl::IterativeClosestPointNonLinear< PointSource, PointTarget >::IterativeClosestPointNonLinear

(

)

[inline]

Empty constructor.

Definition at line 76 of file icp_nl.h.

---

The documentation for this class was generated from the following file:

• icp_nl.h