Go to the documentation of this file.00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038
00039
00040 #ifndef PCL_REGISTRATION_TRANSFORMATION_VALIDATION_EUCLIDEAN_IMPL_H_
00041 #define PCL_REGISTRATION_TRANSFORMATION_VALIDATION_EUCLIDEAN_IMPL_H_
00042
00044 template <typename PointSource, typename PointTarget, typename Scalar> double
00045 pcl::registration::TransformationValidationEuclidean<PointSource, PointTarget, Scalar>::validateTransformation (
00046 const PointCloudSourceConstPtr &cloud_src,
00047 const PointCloudTargetConstPtr &cloud_tgt,
00048 const Matrix4 &transformation_matrix) const
00049 {
00050 double fitness_score = 0.0;
00051
00052
00053 pcl::PointCloud<PointSource> input_transformed;
00054
00055 input_transformed.resize (cloud_src->size ());
00056 for (size_t i = 0; i < cloud_src->size (); ++i)
00057 {
00058 const PointSource &src = cloud_src->points[i];
00059 PointTarget &tgt = input_transformed.points[i];
00060 tgt.x = static_cast<float> (transformation_matrix (0, 0) * src.x + transformation_matrix (0, 1) * src.y + transformation_matrix (0, 2) * src.z + transformation_matrix (0, 3));
00061 tgt.y = static_cast<float> (transformation_matrix (1, 0) * src.x + transformation_matrix (1, 1) * src.y + transformation_matrix (1, 2) * src.z + transformation_matrix (1, 3));
00062 tgt.z = static_cast<float> (transformation_matrix (2, 0) * src.x + transformation_matrix (2, 1) * src.y + transformation_matrix (2, 2) * src.z + transformation_matrix (2, 3));
00063 }
00064
00065 typename MyPointRepresentation::ConstPtr point_rep (new MyPointRepresentation);
00066 if (!force_no_recompute_)
00067 {
00068 tree_->setPointRepresentation (point_rep);
00069 tree_->setInputCloud (cloud_tgt);
00070 }
00071
00072 std::vector<int> nn_indices (1);
00073 std::vector<float> nn_dists (1);
00074
00075
00076 int nr = 0;
00077 for (size_t i = 0; i < input_transformed.points.size (); ++i)
00078 {
00079
00080 tree_->nearestKSearch (input_transformed.points[i], 1, nn_indices, nn_dists);
00081
00082
00083 if (nn_dists[0] > max_range_)
00084 continue;
00085
00086
00087 fitness_score += nn_dists[0];
00088 ++nr;
00089 }
00090
00091 if (nr > 0)
00092 return (fitness_score / nr);
00093 else
00094 return (std::numeric_limits<double>::max ());
00095 }
00096
00097 #endif // PCL_REGISTRATION_TRANSFORMATION_VALIDATION_EUCLIDEAN_IMPL_H_
00098