ndt_histogram.h
Go to the documentation of this file.
00001 /*
00002  * Software License Agreement (BSD License)
00003  *
00004  *  Copyright (c) 2010, AASS Research Center, Orebro University.
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 AASS Research Center 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  */
00035 #ifndef NDT_HISTOGRAM_HH
00036 #define NDT_HISTOGRAM_HH
00037 
00038 #include <ndt_map.h>
00039 #include <vector>
00040 
00041 namespace lslgeneric
00042 {
00043 
00044 template <typename PointT>
00045 class NDTHistogram
00046 {
00047 
00048 private:
00049     std::vector<int> histogramBinsFlat;
00050     std::vector<int> histogramBinsLine;
00051     std::vector<int> histogramBinsSphere;
00052 
00053     int N_LINE_BINS;
00054     int N_FLAT_BINS;
00055     int N_SPHERE_BINS;
00056     double D1, D2;
00057     bool inited;
00058 
00059     std::vector< Eigen::Transform<double,3,Eigen::Affine,Eigen::ColMajor>,
00060         Eigen::aligned_allocator<Eigen::Transform<double,3,Eigen::Affine,Eigen::ColMajor> > > topThree;
00061     double topThreeS[3];
00062 
00063     std::vector<int> dist_histogramBinsFlat[3];
00064     std::vector<int> dist_histogramBinsLine[3];
00065     std::vector<int> dist_histogramBinsSphere[3];
00066 
00067     std::vector<Eigen::Vector3d,Eigen::aligned_allocator<Eigen::Vector3d> > averageDirections;
00068     void constructHistogram(NDTMap<PointT> &map);
00069     void incrementLineBin(double d);
00070     void incrementFlatBin(Eigen::Vector3d &normal, double d);
00071     void incrementSphereBin(double d);
00072 
00073     void computeDirections();
00074     void closedFormSolution(pcl::PointCloud<PointT> &src, pcl::PointCloud<PointT> &trgt,
00075                             Eigen::Transform<double,3,Eigen::Affine,Eigen::ColMajor> &T);
00076 public:
00077     NDTHistogram();
00078     NDTHistogram (NDTMap<PointT> &map);
00079     NDTHistogram (const NDTHistogram<PointT>& other);
00080 
00081     //get the transform that brings me close to target
00082     void bestFitToHistogram(NDTHistogram<PointT> &target, Eigen::Transform<double,3,Eigen::Affine,Eigen::ColMajor> &T, bool bound_transform = true);
00083     void printHistogram(bool bMatlab=false);
00084 
00085     //call this to get the 1/2/3 best option, AFTER a call to bestFitToHistogram
00086     double getTransform(size_t FIT_NUMBER, Eigen::Transform<double,3,Eigen::Affine,Eigen::ColMajor> &T)
00087     {
00088         double ret = -1;
00089         T.setIdentity();
00090         if(FIT_NUMBER >=0 && FIT_NUMBER<3)
00091         {
00092             T = topThree[FIT_NUMBER];
00093             ret = topThreeS[FIT_NUMBER];
00094         }
00095         return ret;
00096     }
00097 
00098     pcl::PointCloud<PointT> getDominantDirections(int nDirections);
00099     double getSimilarity(NDTHistogram<PointT> &other);
00100     double getSimilarity(NDTHistogram<PointT> &other, Eigen::Transform<double,3,Eigen::Affine,Eigen::ColMajor> &T);
00101 
00102     std::vector<Eigen::Vector3d,Eigen::aligned_allocator<Eigen::Vector3d> > directions;
00103 public:
00104     EIGEN_MAKE_ALIGNED_OPERATOR_NEW
00105 
00106 };
00107 
00108 };
00109 
00110 #include <impl/ndt_histogram.hpp>
00111 #endif


ndt_map
Author(s): Todor Stoyanov, Jari Saarinen, Henrik Andreasson
autogenerated on Mon Jan 6 2014 11:31:57