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 () const |
| | 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.
|
template<typename PointT>
class pcl::MaximumLikelihoodSampleConsensus< PointT >
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.
- Note:
- MLESAC is useful in situations where most of the data samples belong to the model, and a fast outlier rejection algorithm is needed.
- Author:
- Radu Bogdan Rusu
Definition at line 55 of file mlesac.h.