cluster_point_indices_decomposer_z_axis_nodelet.cpp
Go to the documentation of this file.
00001 /*********************************************************************
00002  * Software License Agreement (BSD License)
00003  *
00004  *  Copyright (c) 2013, Ryohei Ueda and JSK Lab
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/o2r other materials provided
00016  *     with the distribution.
00017  *   * Neither the name of the JSK Lab 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 #include "jsk_pcl_ros/cluster_point_indices_decomposer_z_axis.h"
00036 #include <pluginlib/class_list_macros.h>
00037 #include <pcl/filters/extract_indices.h>
00038 
00039 #include <pcl/common/centroid.h>
00040 
00041 namespace jsk_pcl_ros
00042 {
00043   void ClusterPointIndicesDecomposerZAxis::sortIndicesOrder
00044   (pcl::PointCloud<pcl::PointXYZ>::Ptr input,
00045    std::vector<pcl::IndicesPtr> indices_array,
00046    std::vector<pcl::IndicesPtr> &output_array)
00047   {
00048     output_array.resize(indices_array.size());
00049     std::vector<double> z_values;
00050     pcl::ExtractIndices<pcl::PointXYZ> ex;
00051     ex.setInputCloud(input);
00052     for (size_t i = 0; i < indices_array.size(); i++)
00053     {
00054       Eigen::Vector4f center;
00055       ex.setIndices(indices_array[i]);
00056       pcl::PointCloud<pcl::PointXYZ>::Ptr tmp(new pcl::PointCloud<pcl::PointXYZ>);
00057       ex.filter(*tmp);
00058       pcl::compute3DCentroid(*tmp, center);
00059       z_values.push_back(center[2]); // only focus on z value
00060     }
00061     
00062     // sort centroids
00063     for (size_t i = 0; i < indices_array.size(); i++)
00064     {
00065       size_t minimum_index = 0;
00066       double minimum_value = DBL_MAX;
00067       for (size_t j = 0; j < indices_array.size(); j++)
00068       {
00069         if (z_values[j] < minimum_value)
00070         {
00071           minimum_value = z_values[j];
00072           minimum_index = j;
00073         }
00074       }
00075       // JSK_ROS_INFO("%lu => %lu", i, minimum_index);
00076       output_array[i] = indices_array[minimum_index];
00077       z_values[minimum_index] = DBL_MAX;
00078     }
00079   }
00080 }
00081 
00082 
00083 PLUGINLIB_EXPORT_CLASS (jsk_pcl_ros::ClusterPointIndicesDecomposerZAxis,
00084                          nodelet::Nodelet);


jsk_pcl_ros
Author(s): Yohei Kakiuchi
autogenerated on Wed Sep 16 2015 04:36:47