extract_labeled_clusters.h

Go to the documentation of this file.

/*
 * Software License Agreement (BSD License)
 *
 *  Copyright (c) 2011, Willow Garage, Inc.
 *  All rights reserved.
 *
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions
 *  are met:
 *
 *   * Redistributions of source code must retain the above copyright
 *     notice, this list of conditions and the following disclaimer.
 *   * Redistributions in binary form must reproduce the above
 *     copyright notice, this list of conditions and the following
 *     disclaimer in the documentation and/or other materials provided
 *     with the distribution.
 *   * Neither the name of Willow Garage, Inc. nor the names of its
 *     contributors may be used to endorse or promote products derived
 *     from this software without specific prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 *  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
 *  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
 *  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
 *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
 *  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 *  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
 *  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 *  POSSIBILITY OF SUCH DAMAGE.
 *
 */

#ifndef PCL_EXTRACT_LABELED_CLUSTERS_H_
#define PCL_EXTRACT_LABELED_CLUSTERS_H_

#include <pcl/pcl_base.h>
#include "pcl/search/pcl_search.h"

namespace pcl
{

  template <typename PointT> void 
  extractLabeledEuclideanClusters (
      const PointCloud<PointT> &cloud, const boost::shared_ptr<search::Search<PointT> > &tree, 
      float tolerance, std::vector<std::vector<PointIndices> > &labeled_clusters, 
      unsigned int min_pts_per_cluster = 1, unsigned int max_pts_per_cluster = (std::numeric_limits<int>::max) (), 
      unsigned int max_label = (std::numeric_limits<int>::max));


  template <typename PointT>
  class LabeledEuclideanClusterExtraction: public PCLBase<PointT>
  {
    typedef PCLBase<PointT> BasePCLBase;

    public:
      typedef pcl::PointCloud<PointT> PointCloud;
      typedef typename PointCloud::Ptr PointCloudPtr;
      typedef typename PointCloud::ConstPtr PointCloudConstPtr;

      typedef typename pcl::search::Search<PointT> KdTree;
      typedef typename pcl::search::Search<PointT>::Ptr KdTreePtr;

      typedef PointIndices::Ptr PointIndicesPtr;
      typedef PointIndices::ConstPtr PointIndicesConstPtr;


      LabeledEuclideanClusterExtraction () : tree_ (), min_pts_per_cluster_ (1), 
                                      max_pts_per_cluster_ (std::numeric_limits<int>::max ()),
                                      max_label_ (std::numeric_limits<int>::max ())
      {};

      inline void 
      setSearchMethod (const KdTreePtr &tree) { tree_ = tree; }

      inline KdTreePtr 
      getSearchMethod () { return (tree_); }

      inline void 
      setClusterTolerance (double tolerance) { cluster_tolerance_ = tolerance; }

      inline double 
      getClusterTolerance () { return (cluster_tolerance_); }

      inline void 
      setMinClusterSize (int min_cluster_size) { min_pts_per_cluster_ = min_cluster_size; }

      inline int 
      getMinClusterSize () { return (min_pts_per_cluster_); }

      inline void 
      setMaxClusterSize (int max_cluster_size) { max_pts_per_cluster_ = max_cluster_size; }

      inline int 
      getMaxClusterSize () { return (max_pts_per_cluster_); }

      inline void 
      setMaxLabels (unsigned int max_label) { max_label_ = max_label; }

      inline unsigned int 
      getMaxLabels () { return (max_label_); }

      void 
      extract (std::vector<std::vector<PointIndices> > &labeled_clusters);

    protected:
      // Members derived from the base class
      using BasePCLBase::input_;
      using BasePCLBase::indices_;
      using BasePCLBase::initCompute;
      using BasePCLBase::deinitCompute;

      KdTreePtr tree_;

      double cluster_tolerance_;

      int min_pts_per_cluster_;

      int max_pts_per_cluster_;

      unsigned int max_label_;

      virtual std::string getClassName () const { return ("LabeledEuclideanClusterExtraction"); }

  };

  inline bool 
    compareLabeledPointClusters (const pcl::PointIndices &a, const pcl::PointIndices &b)
  {
    return (a.indices.size () < b.indices.size ());
  }
}

#endif  //#ifndef PCL_EXTRACT_LABELED_CLUSTERS_H_