uniform_sampling.h

Go to the documentation of this file.

/*
 * Software License Agreement (BSD License)
 *
 *  Point Cloud Library (PCL) - www.pointclouds.org
 *  Copyright (c) 2010-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.
 *
 * $Id$
 *
 */

#ifndef PCL_KEYPOINTS_UNIFORM_SAMPLING_H_
#define PCL_KEYPOINTS_UNIFORM_SAMPLING_H_

#include <pcl/keypoints/keypoint.h>
#include <boost/unordered_map.hpp>

namespace pcl
{
  template <typename PointInT>
  class UniformSampling: public Keypoint<PointInT, int>
  {
    typedef typename Keypoint<PointInT, int>::PointCloudIn PointCloudIn;
    typedef typename Keypoint<PointInT, int>::PointCloudOut PointCloudOut;

    using Keypoint<PointInT, int>::name_;
    using Keypoint<PointInT, int>::input_;
    using Keypoint<PointInT, int>::indices_;
    using Keypoint<PointInT, int>::search_radius_;
    using Keypoint<PointInT, int>::getClassName;

    public:
      typedef boost::shared_ptr<UniformSampling<PointInT> > Ptr;
      typedef boost::shared_ptr<const UniformSampling<PointInT> > ConstPtr;

      UniformSampling () :
        leaves_ (),
        leaf_size_ (Eigen::Vector4f::Zero ()),
        inverse_leaf_size_ (Eigen::Vector4f::Zero ()),
        min_b_ (Eigen::Vector4i::Zero ()),
        max_b_ (Eigen::Vector4i::Zero ()),
        div_b_ (Eigen::Vector4i::Zero ()),
        divb_mul_ (Eigen::Vector4i::Zero ())
      {
        name_ = "UniformSampling";
      }

      virtual ~UniformSampling ()
      {
        leaves_.clear();
      }

      virtual inline void 
      setRadiusSearch (double radius) 
      { 
        leaf_size_[0] = leaf_size_[1] = leaf_size_[2] = static_cast<float> (radius);
        // Avoid division errors
        if (leaf_size_[3] == 0)
          leaf_size_[3] = 1;
        // Use multiplications instead of divisions
        inverse_leaf_size_ = Eigen::Array4f::Ones () / leaf_size_.array ();
        search_radius_ = radius;
      }

    protected:
      struct Leaf
      {
        Leaf () : idx (-1) { }
        int idx;
      };

      boost::unordered_map<size_t, Leaf> leaves_;

      Eigen::Vector4f leaf_size_;

      Eigen::Array4f inverse_leaf_size_;

      Eigen::Vector4i min_b_, max_b_, div_b_, divb_mul_;

      void 
      detectKeypoints (PointCloudOut &output);
  };
}

#ifdef PCL_NO_PRECOMPILE
#include <pcl/keypoints/impl/uniform_sampling.hpp>
#endif

#endif  //#ifndef PCL_KEYPOINTS_UNIFORM_SAMPLING_H_