Point Cloud Library (PCL)  1.6.0
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
correspondence_rejection_var_trimmed.hpp
Go to the documentation of this file.
1 /*
2  * Software License Agreement (BSD License)
3  *
4  * Point Cloud Library (PCL) - www.pointclouds.org
5  * Copyright (c) 2012, Open Perception, Inc.
6  *
7  * All rights reserved.
8  *
9  * Redistribution and use in source and binary forms, with or without
10  * modification, are permitted provided that the following conditions
11  * are met:
12  *
13  * * Redistributions of source code must retain the above copyright
14  * notice, this list of conditions and the following disclaimer.
15  * * Redistributions in binary form must reproduce the above
16  * copyright notice, this list of conditions and the following
17  * disclaimer in the documentation and/or other materials provided
18  * with the distribution.
19  * * Neither the name of Open Perception, Inc. nor the names of its
20  * contributors may be used to endorse or promote products derived
21  * from this software without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
26  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
27  * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
28  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
29  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
30  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
31  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
33  * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34  * POSSIBILITY OF SUCH DAMAGE.
35  *
36  *
37  */
38 #ifndef PCL_REGISTRATION_IMPL_CORRESPONDENCE_REJECTION_VAR_TRIMMED_HPP_
39 #define PCL_REGISTRATION_IMPL_CORRESPONDENCE_REJECTION_VAR_TRIMMED_HPP_
40 
41 #include <vector>
42 #include <algorithm>
43 
45 void
47  const pcl::Correspondences& original_correspondences,
48  pcl::Correspondences& remaining_correspondences)
49 {
50  std::vector <double> dists;
51  dists.resize (original_correspondences.size ());
52 
53  for (size_t i = 0; i < original_correspondences.size (); ++i)
54  {
55  if (data_container_)
56  {
57  dists[i] = data_container_->getCorrespondenceScore (original_correspondences[i]);
58  }
59  else
60  {
61  dists[i] = original_correspondences[i].distance;
62  }
63  }
64  factor_ = optimizeInlierRatio (dists);
65  nth_element (dists.begin (), dists.begin () + int (dists.size () * factor_), dists.end ());
66  trimmed_distance_ = dists [int (dists.size () * factor_)];
67 
68  unsigned int number_valid_correspondences = 0;
69  remaining_correspondences.resize (original_correspondences.size ());
70 
71  for (size_t i = 0; i < original_correspondences.size (); ++i)
72  {
73  if ( dists[i] < trimmed_distance_)
74  {
75  remaining_correspondences[number_valid_correspondences] = original_correspondences[i];
76  ++number_valid_correspondences;
77  }
78  }
79  remaining_correspondences.resize (number_valid_correspondences);
80 }
81 
83 float
84 pcl::registration::CorrespondenceRejectorVarTrimmed::optimizeInlierRatio (std::vector <double>& dists)
85 {
86  unsigned int points_nbr = dists.size ();
87  std::sort (dists.begin (), dists.end ());
88 
89  const int min_el = int (floor (min_ratio_ * points_nbr));
90  const int max_el = int (floor (max_ratio_ * points_nbr));
91 
92  typedef Eigen::Array <double, Eigen::Dynamic, 1> LineArray;
93  Eigen::Map<LineArray> sorted_dist (&dists[0], points_nbr);
94 
95  const LineArray trunk_sorted_dist = sorted_dist.segment (min_el, max_el-min_el);
96  const double lower_sum = sorted_dist.head (min_el).sum ();
97  const LineArray ids = LineArray::LinSpaced (trunk_sorted_dist.rows (), min_el+1, max_el);
98  const LineArray ratio = ids / points_nbr;
99  const LineArray deno = ratio.pow (lambda_);
100  const LineArray FRMS = deno.inverse ().square () * ids.inverse () * (lower_sum + trunk_sorted_dist);
101  int min_index (0);
102  FRMS.minCoeff (&min_index);
103 
104  const float opt_ratio = float (min_index + min_el) / float (points_nbr);
105  return opt_ratio;
106 }
107 
108 #endif /* PCL_REGISTRATION_IMPL_CORRESPONDENCE_REJECTION_VAR_TRIMMED_HPP_ */