# Implicit Shape Model

In this tutorial we will learn how to use the implicit shape model algorithm implemented in the pcl::ism::ImplicitShapeModel class. This algorithm was described in the article “Hough Transforms and 3D SURF for robust three dimensional classification” by Jan Knopp, Mukta Prasad, Geert Willems, Radu Timofte, and Luc Van Gool. This algorithm is a combination of generalized Hough transform and the Bag of Features approach and its purpose is as follows. Having some training set - point clouds of different objects of the known class - the algorithm computes a certain model which will be later used to predict an object center in the given cloud that wasn’t a part of the training set.

# Theoretical Primer

The algorithm consists of two steps, the first one is training, and the second is recognition of the objects in the clouds that weren’t in the training set. Let’s take a look at how the training is done. It consists of six steps:
1. First of all the keypoint detection is made. In the given implementation it’s just a simplification of the training clouds. At this step all the point clouds are simplified by the means of the voxel grid approach; remaining points are declared as keypoints.

2. For every keypoint features are estimated. In the example below the FPFH estimation is used.

3. All features are clustered with the help of k-means algorithm to construct a dictionary of visual (or geometric) words. Obtained clusters represent visual words. Every feature in the cluster is the instance of this visual word.

4. For every single instance the direction to center is computed - a direction from the keypoint (from which the feature was obtained) to the center of mass of the given cloud.

5. For each visual word the statistical weight is calculated by the formula:

The statistical weight weights all the votes cast by visual word for class . Here is the total number of votes from visual word , is the number of votes for class from , is the number of visual words that vote for class , is the number of features from which was learned. is the set of all classes.

6. For every keypoint (point for which feature was estimated) the learned weight is calculated by the formula:

Authors of the article define as the vote cast by a particular instance of visual word on a particular training shape of class ; that is, records the distance of the particular instance of visual word to the center of the training shape on which it was found. Here is the set of all features associated with word on a shape of class . The recommend value for is 10% of the shape size. Function is simply a median. is the Euclidean distance between voted and actual center.

After the training process is done and the trained model (weights, directions etc.) is obtained, the process of object search (or recognition) takes place. It consists of next four steps:
1. Keypoint detection.

2. Feature estimation for every keypoint of the cloud.

3. For each feature the search for the nearest visual word (that is a cluster) in the dictionary is made.

4. For every feature

• For every instance(which casts a vote for the class of interest) of every visual word from the trained model

• Add vote with the corresponding direction and vote power computed by the formula

5. Previous step gives us a set of directions to the expected center and the power for each vote. In order to get single point that corresponds to center these votes need to be analysed. For this purpose algorithm uses the non maxima suppression approach. User just needs to pass the radius of the object of interest and the rest will be done by the ISMVoteList::findStrongestPeaks () method.

For more comprehensive information please refer to the article “Hough Transforms and 3D SURF for robust three dimensional classification”.

# The code

First of all you will need the set of point clouds for this tutorial - training set and set of clouds for recognition. Below is the list of clouds that are well suited for this tutorial (they were borrowed from the Ohio dataset).

Clouds for training:
Clouds for testing:

Next what you need to do is to create a file implicit_shape_model.cpp in any editor you prefer and copy the following code inside of it:

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 #include #include #include #include #include #include #include #include #include int main (int argc, char** argv) { if (argc == 0 || argc % 2 == 0) return (-1); unsigned int number_of_training_clouds = (argc - 3) / 2; pcl::NormalEstimation normal_estimator; normal_estimator.setRadiusSearch (25.0); std::vector::Ptr> training_clouds; std::vector::Ptr> training_normals; std::vector training_classes; for (unsigned int i_cloud = 0; i_cloud < number_of_training_clouds - 1; i_cloud++) { pcl::PointCloud::Ptr tr_cloud(new pcl::PointCloud ()); if ( pcl::io::loadPCDFile (argv[i_cloud * 2 + 1], *tr_cloud) == -1 ) return (-1); pcl::PointCloud::Ptr tr_normals = (new pcl::PointCloud)->makeShared (); normal_estimator.setInputCloud (tr_cloud); normal_estimator.compute (*tr_normals); unsigned int tr_class = static_cast (strtol (argv[i_cloud * 2 + 2], 0, 10)); training_clouds.push_back (tr_cloud); training_normals.push_back (tr_normals); training_classes.push_back (tr_class); } pcl::FPFHEstimation >::Ptr fpfh (new pcl::FPFHEstimation >); fpfh->setRadiusSearch (30.0); pcl::Feature< pcl::PointXYZ, pcl::Histogram<153> >::Ptr feature_estimator(fpfh); pcl::ism::ImplicitShapeModelEstimation<153, pcl::PointXYZ, pcl::Normal> ism; ism.setFeatureEstimator(feature_estimator); ism.setTrainingClouds (training_clouds); ism.setTrainingNormals (training_normals); ism.setTrainingClasses (training_classes); ism.setSamplingSize (2.0f); pcl::ism::ImplicitShapeModelEstimation<153, pcl::PointXYZ, pcl::Normal>::ISMModelPtr model = boost::shared_ptr (new pcl::features::ISMModel); ism.trainISM (model); std::string file ("trained_ism_model.txt"); model->saveModelToFile (file); model->loadModelFromfile (file); unsigned int testing_class = static_cast (strtol (argv[argc - 1], 0, 10)); pcl::PointCloud::Ptr testing_cloud (new pcl::PointCloud ()); if ( pcl::io::loadPCDFile (argv[argc - 2], *testing_cloud) == -1 ) return (-1); pcl::PointCloud::Ptr testing_normals = (new pcl::PointCloud)->makeShared (); normal_estimator.setInputCloud (testing_cloud); normal_estimator.compute (*testing_normals); boost::shared_ptr > vote_list = ism.findObjects ( model, testing_cloud, testing_normals, testing_class); double radius = model->sigmas_[testing_class] * 10.0; double sigma = model->sigmas_[testing_class]; std::vector > strongest_peaks; vote_list->findStrongestPeaks (strongest_peaks, testing_class, radius, sigma); pcl::PointCloud ::Ptr colored_cloud = (new pcl::PointCloud)->makeShared (); colored_cloud->height = 0; colored_cloud->width = 1; pcl::PointXYZRGB point; point.r = 255; point.g = 255; point.b = 255; for (size_t i_point = 0; i_point < testing_cloud->points.size (); i_point++) { point.x = testing_cloud->points[i_point].x; point.y = testing_cloud->points[i_point].y; point.z = testing_cloud->points[i_point].z; colored_cloud->points.push_back (point); } colored_cloud->height += testing_cloud->points.size (); point.r = 255; point.g = 0; point.b = 0; for (size_t i_vote = 0; i_vote < strongest_peaks.size (); i_vote++) { point.x = strongest_peaks[i_vote].x; point.y = strongest_peaks[i_vote].y; point.z = strongest_peaks[i_vote].z; colored_cloud->points.push_back (point); } colored_cloud->height += strongest_peaks.size (); pcl::visualization::CloudViewer viewer ("Result viewer"); viewer.showCloud (colored_cloud); while (!viewer.wasStopped ()) { } return (0); } 

# The explanation

Now let’s study out what is the purpose of this code. The first lines of interest are these:

  for (unsigned int i_cloud = 0; i_cloud < number_of_training_clouds - 1; i_cloud++)
{
pcl::PointCloud<pcl::PointXYZ>::Ptr tr_cloud(new pcl::PointCloud<pcl::PointXYZ> ());
if ( pcl::io::loadPCDFile <pcl::PointXYZ> (argv[i_cloud * 2 + 1], *tr_cloud) == -1 )
return (-1);

pcl::PointCloud<pcl::Normal>::Ptr tr_normals = (new pcl::PointCloud<pcl::Normal>)->makeShared ();
normal_estimator.setInputCloud (tr_cloud);
normal_estimator.compute (*tr_normals);

unsigned int tr_class = static_cast<unsigned int> (strtol (argv[i_cloud * 2 + 2], 0, 10));

training_clouds.push_back (tr_cloud);
training_normals.push_back (tr_normals);
training_classes.push_back (tr_class);
}


These lines simply load the clouds that will be used for training. Algorithm requires normals so this is the place where they are computed. After the loop is passed all clouds will be inserted to the training_clouds vector. training_normals and training_classes will store normals and class index for the corresponding object.

  pcl::FPFHEstimation<pcl::PointXYZ, pcl::Normal, pcl::Histogram<153> >::Ptr fpfh
(new pcl::FPFHEstimation<pcl::PointXYZ, pcl::Normal, pcl::Histogram<153> >);
fpfh->setRadiusSearch (30.0);
pcl::Feature< pcl::PointXYZ, pcl::Histogram<153> >::Ptr feature_estimator(fpfh);


Here the instance of feature estimator is created, in our case it is the FPFH. It must be fully set up before it will be passed to the ISM algorithm. So this is the place where we define all feature estimation settings.

  pcl::ism::ImplicitShapeModelEstimation<153, pcl::PointXYZ, pcl::Normal> ism;


This line simply creates an instance of the pcl::ism::ImplicitShapeModelEstimation. It is a template class that has three parameters:

• FeatureSize - size of the features (histograms) to compute
• PointT - type of points to work with
• NormalT - type of normals to use
  ism.setFeatureEstimator(feature_estimator);
ism.setTrainingClouds (training_clouds);
ism.setTrainingNormals (training_normals);
ism.setTrainingClasses (training_classes);
ism.setSamplingSize (2.0f);


Here the instance is provided with the training data and feature estimator. The last line provides sampling size value used for cloud simplification as mentioned before.

  pcl::ism::ImplicitShapeModelEstimation<153, pcl::PointXYZ, pcl::Normal>::ISMModelPtr model = boost::shared_ptr<pcl::features::ISMModel>
(new pcl::features::ISMModel);
ism.trainISM (model);


These lines simply launch the training process.

  std::string file ("trained_ism_model.txt");
model->saveModelToFile (file);


Here the trained model that was obtained during the training process is saved to file for possible reuse.

The remaining part of the code may be moved with a few changes to another .cpp file and be presented as a separate program that is responsible for classification.

  model->loadModelFromfile (file);


This line loads trained model from file. It is not necessary, because we already have the trained model. It is given to show how you can load the precomputed model.

  unsigned int testing_class = static_cast<unsigned int> (strtol (argv[argc - 1], 0, 10));
pcl::PointCloud<pcl::PointXYZ>::Ptr testing_cloud (new pcl::PointCloud<pcl::PointXYZ> ());
if ( pcl::io::loadPCDFile <pcl::PointXYZ> (argv[argc - 2], *testing_cloud) == -1 )
return (-1);

pcl::PointCloud<pcl::Normal>::Ptr testing_normals = (new pcl::PointCloud<pcl::Normal>)->makeShared ();
normal_estimator.setInputCloud (testing_cloud);
normal_estimator.compute (*testing_normals);


The classification process needs the cloud and its normals as well as the training process. So these lines simply load the cloud and compute normals.

  boost::shared_ptr<pcl::features::ISMVoteList<pcl::PointXYZ> > vote_list = ism.findObjects (
model,
testing_cloud,
testing_normals,
testing_class);


This line launches the classification process. It tells the algorithm to look for the objects of type testing_class in the given cloud testing_cloud. Notice that the algorithm will use any trained model that you will pass. After the classification is done, the list of votes for center will be returned. pcl::ism::ISMVoteList is the separate class, which purpose is to help you to analyze the votes.

  double radius = model->sigmas_[testing_class] * 10.0;
double sigma = model->sigmas_[testing_class];
std::vector<pcl::ISMPeak, Eigen::aligned_allocator<pcl::ISMPeak> > strongest_peaks;
vote_list->findStrongestPeaks (strongest_peaks, testing_class, radius, sigma);


These lines are responsible for finding strongest peaks among the votes. This search is based on the non-maximum suppression idea, that’s why the non-maximum radius is equal to the object radius that is taken from the trained model.

The rest of the code is simple enough. It is responsible for visualizing the cloud and computed strongest peaks which represent the estimated centers of the object of type testing_class.

# Compiling and running the program

Add the following lines to your CMakeLists.txt file:

  1 2 3 4 5 6 7 8 9 10 11 12 13 cmake_minimum_required(VERSION 2.8 FATAL_ERROR) project(implicit_shape_model) find_package(PCL 1.5 REQUIRED) set(CMAKE_BUILD_TYPE Release) include_directories(${PCL_INCLUDE_DIRS}) link_directories(${PCL_LIBRARY_DIRS}) add_definitions(${PCL_DEFINITIONS}) add_executable (implicit_shape_model implicit_shape_model.cpp) target_link_libraries (implicit_shape_model${PCL_LIBRARIES}) 

Note that here we tell the compiler that we want a release version of the binaries, because the process of training is too slow. After you have made the executable, you can run it. Simply do:

\$ ./implicit_shape_model
ism_train_cat.pcd      0
ism_train_horse.pcd    1
ism_train_lioness.pcd  2
ism_train_michael.pcd  3
ism_train_wolf.pcd     4
ism_test_cat.pcd       0


Here you must pass the training clouds and the class of the object that it contains. The last two parameters are the cloud for testing and the class of interest that you are looking for in the testing cloud.

After the segmentation the cloud viewer window will be opened and you will see something similar to those images:

Here the red point represents the predicted center of the object that corresponds to the class of interest. If you will try to visualize the votes you will see something similar to this image where blue points are votes: