IterativeClosestPointNonLinear is an ICP variant that uses Levenberg-Marquardt optimization backend. More...
#include <pcl/registration/icp_nl.h>


Public Types | |
| typedef boost::shared_ptr < IterativeClosestPointNonLinear < PointSource, PointTarget, Scalar > > | Ptr |
| typedef boost::shared_ptr < const IterativeClosestPointNonLinear < PointSource, PointTarget, Scalar > > | ConstPtr |
| typedef Registration < PointSource, PointTarget, Scalar >::Matrix4 | Matrix4 |
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:
Definition at line 68 of file icp_nl.h.
| 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] |
Empty constructor.
Definition at line 83 of file icp_nl.h.
References pcl::Registration< PointSource, PointTarget, Scalar >::min_number_correspondences_, pcl::Registration< PointSource, PointTarget, Scalar >::reg_name_, and pcl::Registration< PointSource, PointTarget, Scalar >::transformation_estimation_.