mlesac.h
Go to the documentation of this file.
00001 /*
00002  * Software License Agreement (BSD License)
00003  *
00004  *  Copyright (c) 2009, Willow Garage, Inc.
00005  *  All rights reserved.
00006  *
00007  *  Redistribution and use in source and binary forms, with or without
00008  *  modification, are permitted provided that the following conditions
00009  *  are met:
00010  *
00011  *   * Redistributions of source code must retain the above copyright
00012  *     notice, this list of conditions and the following disclaimer.
00013  *   * Redistributions in binary form must reproduce the above
00014  *     copyright notice, this list of conditions and the following
00015  *     disclaimer in the documentation and/or other materials provided
00016  *     with the distribution.
00017  *   * Neither the name of Willow Garage, Inc. nor the names of its
00018  *     contributors may be used to endorse or promote products derived
00019  *     from this software without specific prior written permission.
00020  *
00021  *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
00022  *  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
00023  *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
00024  *  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
00025  *  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
00026  *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
00027  *  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
00028  *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
00029  *  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00030  *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
00031  *  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
00032  *  POSSIBILITY OF SUCH DAMAGE.
00033  *
00034  * $Id: mlesac.h 4710 2012-02-23 17:51:24Z rusu $
00035  *
00036  */
00037 
00038 #ifndef PCL_SAMPLE_CONSENSUS_MLESAC_H_
00039 #define PCL_SAMPLE_CONSENSUS_MLESAC_H_
00040 
00041 #include <pcl/sample_consensus/sac.h>
00042 #include <pcl/sample_consensus/sac_model.h>
00043 
00044 namespace pcl
00045 {
00047 
00054   template <typename PointT>
00055   class MaximumLikelihoodSampleConsensus : public SampleConsensus<PointT>
00056   {
00057     using SampleConsensus<PointT>::max_iterations_;
00058     using SampleConsensus<PointT>::threshold_;
00059     using SampleConsensus<PointT>::iterations_;
00060     using SampleConsensus<PointT>::sac_model_;
00061     using SampleConsensus<PointT>::model_;
00062     using SampleConsensus<PointT>::model_coefficients_;
00063     using SampleConsensus<PointT>::inliers_;
00064     using SampleConsensus<PointT>::probability_;
00065 
00066     typedef typename SampleConsensusModel<PointT>::Ptr SampleConsensusModelPtr;
00067     typedef typename SampleConsensusModel<PointT>::PointCloudConstPtr PointCloudConstPtr; 
00068 
00069     public:
00073       MaximumLikelihoodSampleConsensus (const SampleConsensusModelPtr &model) : 
00074         SampleConsensus<PointT> (model),
00075         iterations_EM_ (3),      // Max number of EM (Expectation Maximization) iterations
00076         sigma_ (0)
00077       {
00078         max_iterations_ = 10000; // Maximum number of trials before we give up.
00079       }
00080 
00085       MaximumLikelihoodSampleConsensus (const SampleConsensusModelPtr &model, double threshold) : 
00086         SampleConsensus<PointT> (model, threshold),
00087         iterations_EM_ (3),      // Max number of EM (Expectation Maximization) iterations
00088         sigma_ (0)
00089       {
00090         max_iterations_ = 10000; // Maximum number of trials before we give up.
00091       }
00092 
00096       bool 
00097       computeModel (int debug_verbosity_level = 0);
00098 
00102       inline void 
00103       setEMIterations (int iterations) { iterations_EM_ = iterations; }
00104 
00106       inline int 
00107       getEMIterations () const { return (iterations_EM_); }
00108 
00109 
00110     protected:
00120       double 
00121       computeMedianAbsoluteDeviation (const PointCloudConstPtr &cloud, 
00122                                       const boost::shared_ptr <std::vector<int> > &indices, 
00123                                       double sigma);
00124 
00131       void 
00132       getMinMax (const PointCloudConstPtr &cloud, 
00133                  const boost::shared_ptr <std::vector<int> > &indices, 
00134                  Eigen::Vector4f &min_p, 
00135                  Eigen::Vector4f &max_p);
00136 
00142       void 
00143       computeMedian (const PointCloudConstPtr &cloud, 
00144                      const boost::shared_ptr <std::vector<int> > &indices, 
00145                      Eigen::Vector4f &median);
00146 
00147     private:
00149       int iterations_EM_;
00151       double sigma_;
00152   };
00153 }
00154 
00155 #endif  //#ifndef PCL_SAMPLE_CONSENSUS_MLESAC_H_


pcl
Author(s): Open Perception
autogenerated on Mon Oct 6 2014 03:15:39