IterativeClosestPointNonLinear is an ICP variant that uses Levenberg-Marquardt optimization backend. The resultant transformation is optimized as a quaternion. More...
#include <icp_nl.h>
Public Types | |
typedef boost::shared_ptr < const IterativeClosestPointNonLinear < PointSource, PointTarget, Scalar > > | ConstPtr |
typedef Registration < PointSource, PointTarget, Scalar >::Matrix4 | Matrix4 |
typedef boost::shared_ptr < IterativeClosestPointNonLinear < PointSource, PointTarget, Scalar > > | Ptr |
Public Member Functions | |
IterativeClosestPointNonLinear () | |
Empty constructor. |
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:
typedef boost::shared_ptr< const IterativeClosestPointNonLinear<PointSource, PointTarget, Scalar> > pcl::IterativeClosestPointNonLinear< PointSource, PointTarget, Scalar >::ConstPtr |
Reimplemented from pcl::IterativeClosestPoint< PointSource, PointTarget, Scalar >.
typedef Registration<PointSource, PointTarget, Scalar>::Matrix4 pcl::IterativeClosestPointNonLinear< PointSource, PointTarget, Scalar >::Matrix4 |
Reimplemented from pcl::IterativeClosestPoint< PointSource, PointTarget, Scalar >.
typedef boost::shared_ptr< IterativeClosestPointNonLinear<PointSource, PointTarget, Scalar> > pcl::IterativeClosestPointNonLinear< PointSource, PointTarget, Scalar >::Ptr |
Reimplemented from pcl::IterativeClosestPoint< PointSource, PointTarget, Scalar >.
pcl::IterativeClosestPointNonLinear< PointSource, PointTarget, Scalar >::IterativeClosestPointNonLinear | ( | ) | [inline] |