Point Cloud Library (PCL)  1.5.1
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines
sac_model_circle.h
Go to the documentation of this file.
00001 /*
00002  * Software License Agreement (BSD License)
00003  *
00004  *  Point Cloud Library (PCL) - www.pointclouds.org
00005  *  Copyright (c) 2010-2011, Willow Garage, Inc.
00006  *
00007  *  All rights reserved.
00008  *
00009  *  Redistribution and use in source and binary forms, with or without
00010  *  modification, are permitted provided that the following conditions
00011  *  are met:
00012  *
00013  *   * Redistributions of source code must retain the above copyright
00014  *     notice, this list of conditions and the following disclaimer.
00015  *   * Redistributions in binary form must reproduce the above
00016  *     copyright notice, this list of conditions and the following
00017  *     disclaimer in the documentation and/or other materials provided
00018  *     with the distribution.
00019  *   * Neither the name of Willow Garage, Inc. nor the names of its
00020  *     contributors may be used to endorse or promote products derived
00021  *     from this software without specific prior written permission.
00022  *
00023  *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
00024  *  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
00025  *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
00026  *  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
00027  *  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
00028  *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
00029  *  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
00030  *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
00031  *  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00032  *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
00033  *  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
00034  *  POSSIBILITY OF SUCH DAMAGE.
00035  *
00036  * $Id: sac_model_circle.h 4702 2012-02-23 09:39:33Z gedikli $
00037  *
00038  */
00039 
00040 #ifndef PCL_SAMPLE_CONSENSUS_MODEL_CIRCLE2D_H_
00041 #define PCL_SAMPLE_CONSENSUS_MODEL_CIRCLE2D_H_
00042 
00043 #include <pcl/sample_consensus/sac_model.h>
00044 #include <pcl/sample_consensus/model_types.h>
00045 
00046 namespace pcl
00047 {
00058   template <typename PointT>
00059   class SampleConsensusModelCircle2D : public SampleConsensusModel<PointT>
00060   {
00061     using SampleConsensusModel<PointT>::input_;
00062     using SampleConsensusModel<PointT>::indices_;
00063     using SampleConsensusModel<PointT>::radius_min_;
00064     using SampleConsensusModel<PointT>::radius_max_;
00065 
00066     public:
00067       typedef typename SampleConsensusModel<PointT>::PointCloud PointCloud;
00068       typedef typename SampleConsensusModel<PointT>::PointCloudPtr PointCloudPtr;
00069       typedef typename SampleConsensusModel<PointT>::PointCloudConstPtr PointCloudConstPtr;
00070 
00071       typedef boost::shared_ptr<SampleConsensusModelCircle2D> Ptr;
00072 
00076       SampleConsensusModelCircle2D (const PointCloudConstPtr &cloud) : SampleConsensusModel<PointT> (cloud) {};
00077 
00082       SampleConsensusModelCircle2D (const PointCloudConstPtr &cloud, const std::vector<int> &indices) : SampleConsensusModel<PointT> (cloud, indices) {};
00083 
00089       void 
00090       getSamples (int &iterations, std::vector<int> &samples);
00091 
00097       bool 
00098       computeModelCoefficients (const std::vector<int> &samples, 
00099                                 Eigen::VectorXf &model_coefficients);
00100 
00105       void 
00106       getDistancesToModel (const Eigen::VectorXf &model_coefficients, 
00107                            std::vector<double> &distances);
00108 
00114       void 
00115       selectWithinDistance (const Eigen::VectorXf &model_coefficients, 
00116                             const double threshold, 
00117                             std::vector<int> &inliers);
00118 
00125       virtual int
00126       countWithinDistance (const Eigen::VectorXf &model_coefficients, 
00127                            const double threshold);
00128 
00135       void 
00136       optimizeModelCoefficients (const std::vector<int> &inliers, 
00137                                  const Eigen::VectorXf &model_coefficients, 
00138                                  Eigen::VectorXf &optimized_coefficients);
00139 
00146       void 
00147       projectPoints (const std::vector<int> &inliers, 
00148                      const Eigen::VectorXf &model_coefficients, 
00149                      PointCloud &projected_points, 
00150                      bool copy_data_fields = true);
00151 
00157       bool 
00158       doSamplesVerifyModel (const std::set<int> &indices, 
00159                             const Eigen::VectorXf &model_coefficients, 
00160                             const double threshold);
00161 
00163       inline pcl::SacModel 
00164       getModelType () const { return (SACMODEL_CIRCLE2D); }
00165 
00166     protected:
00170       bool 
00171       isModelValid (const Eigen::VectorXf &model_coefficients);
00172 
00176       bool
00177       isSampleGood(const std::vector<int> &samples) const;
00178 
00179     private:
00181       const std::vector<int> *tmp_inliers_;
00182 
00184       struct OptimizationFunctor : pcl::Functor<float>
00185       {
00191         OptimizationFunctor (int m_data_points, pcl::SampleConsensusModelCircle2D<PointT> *model) : 
00192           pcl::Functor<float>(m_data_points), model_ (model) {}
00193 
00199         int 
00200         operator() (const Eigen::VectorXf &x, Eigen::VectorXf &fvec) const
00201         {
00202           for (int i = 0; i < values (); ++i)
00203           {
00204             // Compute the difference between the center of the circle and the datapoint X_i
00205             float xt = model_->input_->points[(*model_->tmp_inliers_)[i]].x - x[0];
00206             float yt = model_->input_->points[(*model_->tmp_inliers_)[i]].y - x[1];
00207             
00208             // g = sqrt ((x-a)^2 + (y-b)^2) - R
00209             fvec[i] = sqrt (xt * xt + yt * yt) - x[2];
00210           }
00211           return (0);
00212         }
00213 
00214         pcl::SampleConsensusModelCircle2D<PointT> *model_;
00215       };
00216   };
00217 }
00218 
00219 #endif  //#ifndef PCL_SAMPLE_CONSENSUS_MODEL_CIRCLE2D_H_