|
Point Cloud Library (PCL)
1.5.1
|
MaximumLikelihoodSampleConsensus represents an implementation of the MLESAC (Maximum Likelihood Estimator SAmple Consensus) algorithm, as described in: "MLESAC: A new robust estimator with application to estimating image geometry", P.H.S. More...
#include <pcl/sample_consensus/mlesac.h>


Public Types | |
| typedef boost::shared_ptr < SampleConsensus > | Ptr |
| typedef boost::shared_ptr < const SampleConsensus > | ConstPtr |
Public Member Functions | |
| MaximumLikelihoodSampleConsensus (const SampleConsensusModelPtr &model) | |
| MLESAC (Maximum Likelihood Estimator SAmple Consensus) main constructor. | |
| MaximumLikelihoodSampleConsensus (const SampleConsensusModelPtr &model, double threshold) | |
| MLESAC (Maximum Likelihood Estimator SAmple Consensus) main constructor. | |
| bool | computeModel (int debug_verbosity_level=0) |
| Compute the actual model and find the inliers. | |
| void | setEMIterations (int iterations) |
| Set the number of EM iterations. | |
| int | getEMIterations () |
| Get the number of EM iterations. | |
| void | setDistanceThreshold (double threshold) |
| Set the distance to model threshold. | |
| double | getDistanceThreshold () |
| Get the distance to model threshold, as set by the user. | |
| void | setMaxIterations (int max_iterations) |
| Set the maximum number of iterations. | |
| int | getMaxIterations () |
| Get the maximum number of iterations, as set by the user. | |
| void | setProbability (double probability) |
| Set the desired probability of choosing at least one sample free from outliers. | |
| double | getProbability () |
| Obtain the probability of choosing at least one sample free from outliers, as set by the user. | |
| void | getRandomSamples (const boost::shared_ptr< std::vector< int > > &indices, size_t nr_samples, std::set< int > &indices_subset) |
| Get a set of randomly selected indices. | |
| void | getModel (std::vector< int > &model) |
| Return the best model found so far. | |
| void | getInliers (std::vector< int > &inliers) |
| Return the best set of inliers found so far for this model. | |
| void | getModelCoefficients (Eigen::VectorXf &model_coefficients) |
| Return the model coefficients of the best model found so far. | |
MaximumLikelihoodSampleConsensus represents an implementation of the MLESAC (Maximum Likelihood Estimator SAmple Consensus) algorithm, as described in: "MLESAC: A new robust estimator with application to estimating image geometry", P.H.S.
Torr and A. Zisserman, Computer Vision and Image Understanding, vol 78, 2000.
typedef boost::shared_ptr<const SampleConsensus> pcl::SampleConsensus< PointT >::ConstPtr [inherited] |
typedef boost::shared_ptr<SampleConsensus> pcl::SampleConsensus< PointT >::Ptr [inherited] |
| pcl::MaximumLikelihoodSampleConsensus< PointT >::MaximumLikelihoodSampleConsensus | ( | const SampleConsensusModelPtr & | model | ) | [inline] |
| pcl::MaximumLikelihoodSampleConsensus< PointT >::MaximumLikelihoodSampleConsensus | ( | const SampleConsensusModelPtr & | model, |
| double | threshold | ||
| ) | [inline] |
| bool pcl::MaximumLikelihoodSampleConsensus< PointT >::computeModel | ( | int | debug_verbosity_level = 0 | ) | [virtual] |
Compute the actual model and find the inliers.
| debug_verbosity_level | enable/disable on-screen debug information and set the verbosity level |
Implements pcl::SampleConsensus< PointT >.
Definition at line 45 of file mlesac.hpp.
| double pcl::SampleConsensus< PointT >::getDistanceThreshold | ( | ) | [inline, inherited] |
| int pcl::MaximumLikelihoodSampleConsensus< PointT >::getEMIterations | ( | ) | [inline] |
| void pcl::SampleConsensus< PointT >::getInliers | ( | std::vector< int > & | inliers | ) | [inline, inherited] |
| int pcl::SampleConsensus< PointT >::getMaxIterations | ( | ) | [inline, inherited] |
| void pcl::SampleConsensus< PointT >::getModel | ( | std::vector< int > & | model | ) | [inline, inherited] |
| void pcl::SampleConsensus< PointT >::getModelCoefficients | ( | Eigen::VectorXf & | model_coefficients | ) | [inline, inherited] |
| double pcl::SampleConsensus< PointT >::getProbability | ( | ) | [inline, inherited] |
| void pcl::SampleConsensus< PointT >::getRandomSamples | ( | const boost::shared_ptr< std::vector< int > > & | indices, |
| size_t | nr_samples, | ||
| std::set< int > & | indices_subset | ||
| ) | [inline, inherited] |
Get a set of randomly selected indices.
| [in] | indices | the input indices vector |
| [in] | nr_samples | the desired number of point indices to randomly select |
| [out] | indices_subset | the resultant output set of randomly selected indices |
Reimplemented in pcl::ProgressiveSampleConsensus< PointT >.
| void pcl::SampleConsensus< PointT >::setDistanceThreshold | ( | double | threshold | ) | [inline, inherited] |
| void pcl::MaximumLikelihoodSampleConsensus< PointT >::setEMIterations | ( | int | iterations | ) | [inline] |
| void pcl::SampleConsensus< PointT >::setMaxIterations | ( | int | max_iterations | ) | [inline, inherited] |
| void pcl::SampleConsensus< PointT >::setProbability | ( | double | probability | ) | [inline, inherited] |
1.8.0