edge_aware_plane_comparator.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-2012, 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: extract_clusters.h 5027 2012-03-12 03:10:45Z rusu $
00037  *
00038  */
00039 
00040 #ifndef PCL_SEGMENTATION_EDGE_AWARE_PLANE_COMPARATOR_H_
00041 #define PCL_SEGMENTATION_EDGE_AWARE_PLANE_COMPARATOR_H_
00042 
00043 #include <pcl/segmentation/plane_coefficient_comparator.h>
00044 #include <boost/make_shared.hpp>
00045 
00046 namespace pcl
00047 {
00054   template<typename PointT, typename PointNT>
00055   class EdgeAwarePlaneComparator: public PlaneCoefficientComparator<PointT, PointNT>
00056   {
00057     public:
00058       typedef typename Comparator<PointT>::PointCloud PointCloud;
00059       typedef typename Comparator<PointT>::PointCloudConstPtr PointCloudConstPtr;
00060       
00061       typedef typename pcl::PointCloud<PointNT> PointCloudN;
00062       typedef typename PointCloudN::Ptr PointCloudNPtr;
00063       typedef typename PointCloudN::ConstPtr PointCloudNConstPtr;
00064       
00065       typedef boost::shared_ptr<EdgeAwarePlaneComparator<PointT, PointNT> > Ptr;
00066       typedef boost::shared_ptr<const EdgeAwarePlaneComparator<PointT, PointNT> > ConstPtr;
00067 
00068       using pcl::PlaneCoefficientComparator<PointT, PointNT>::input_;
00069       using pcl::PlaneCoefficientComparator<PointT, PointNT>::normals_;
00070       using pcl::PlaneCoefficientComparator<PointT, PointNT>::plane_coeff_d_;
00071       using pcl::PlaneCoefficientComparator<PointT, PointNT>::angular_threshold_;
00072       using pcl::PlaneCoefficientComparator<PointT, PointNT>::distance_threshold_;
00073 
00075       EdgeAwarePlaneComparator ()
00076       {
00077       }
00078 
00082       EdgeAwarePlaneComparator (const float *distance_map) : 
00083         distance_map_ (distance_map)
00084       {
00085       }
00086 
00088       virtual
00089       ~EdgeAwarePlaneComparator ()
00090       {
00091       }
00092 
00097       inline void
00098       setDistanceMap (const float *distance_map)
00099       {
00100         distance_map_ = distance_map;
00101       }
00102 
00104       const float*
00105       getDistanceMap () const
00106       {
00107         return (distance_map_);
00108       }
00109       
00110     protected:
00115       bool
00116       compare (int idx1, int idx2) const
00117       {
00118         float dx = input_->points[idx1].x - input_->points[idx2].x;
00119         float dy = input_->points[idx1].y - input_->points[idx2].y;
00120         float dz = input_->points[idx1].z - input_->points[idx2].z;
00121         float dist = sqrtf (dx*dx + dy*dy + dz*dz);
00122 
00123         bool normal_ok = (normals_->points[idx1].getNormalVector3fMap ().dot (normals_->points[idx2].getNormalVector3fMap () ) > angular_threshold_ );
00124         bool dist_ok = (dist < distance_threshold_);
00125 
00126         bool curvature_ok = normals_->points[idx1].curvature < 0.04;
00127         bool plane_d_ok = fabs ((*plane_coeff_d_)[idx1] - (*plane_coeff_d_)[idx2]) < 0.04;
00128         
00129         if (distance_map_[idx1] < 5)    // 5 pixels
00130           curvature_ok = false;
00131         
00132         return (dist_ok && normal_ok && curvature_ok && plane_d_ok);
00133       }
00134 
00135     protected:
00136       const float* distance_map_;
00137   };
00138 }
00139 
00140 #endif // PCL_SEGMENTATION_PLANE_COEFFICIENT_COMPARATOR_H_


pcl
Author(s): Open Perception
autogenerated on Mon Oct 6 2014 03:14:49