DataPointsFilter.cpp
Go to the documentation of this file.
00001 // kate: replace-tabs off; indent-width 4; indent-mode normal
00002 // vim: ts=4:sw=4:noexpandtab
00003 /*
00004 
00005 Copyright (c) 2010--2012,
00006 François Pomerleau and Stephane Magnenat, ASL, ETHZ, Switzerland
00007 You can contact the authors at <f dot pomerleau at gmail dot com> and
00008 <stephane at magnenat dot net>
00009 
00010 All rights reserved.
00011 
00012 Redistribution and use in source and binary forms, with or without
00013 modification, are permitted provided that the following conditions are met:
00014     * Redistributions of source code must retain the above copyright
00015       notice, this list of conditions and the following disclaimer.
00016     * Redistributions in binary form must reproduce the above copyright
00017       notice, this list of conditions and the following disclaimer in the
00018       documentation and/or other materials provided with the distribution.
00019     * Neither the name of the <organization> nor the
00020       names of its contributors may be used to endorse or promote products
00021       derived from this software without specific prior written permission.
00022 
00023 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
00024 ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
00025 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
00026 DISCLAIMED. IN NO EVENT SHALL ETH-ASL BE LIABLE FOR ANY
00027 DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
00028 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
00029 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
00030 ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
00031 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00032 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00033 
00034 */
00035 
00036 #include "PointMatcher.h"
00037 #include "PointMatcherPrivate.h"
00038 
00040 template<typename T>
00041 PointMatcher<T>::DataPointsFilter::DataPointsFilter()
00042 {} 
00043 
00045 template<typename T>
00046 PointMatcher<T>::DataPointsFilter::DataPointsFilter(const std::string& className, const ParametersDoc paramsDoc, const Parameters& params):
00047     Parametrizable(className,paramsDoc,params)
00048 {}
00049 
00051 template<typename T>
00052 PointMatcher<T>::DataPointsFilter::~DataPointsFilter()
00053 {} 
00054 
00056 template<typename T>
00057 void PointMatcher<T>::DataPointsFilter::init()
00058 {}
00059 
00060 template struct PointMatcher<float>::DataPointsFilter;
00061 template struct PointMatcher<double>::DataPointsFilter;
00062 
00063 
00065 template<typename T>
00066 PointMatcher<T>::DataPointsFilters::DataPointsFilters()
00067 {}
00068 
00070 template<typename T>
00071 PointMatcher<T>::DataPointsFilters::DataPointsFilters(std::istream& in)
00072 {
00073     #ifdef HAVE_YAML_CPP
00074     
00075     YAML::Parser parser(in);
00076     YAML::Node doc;
00077     parser.GetNextDocument(doc);
00078     
00079     // Fix for issue #6: compilation on gcc 4.4.4
00080     //PointMatcher<T> pm;
00081     const PointMatcher & pm = PointMatcher::get();
00082     
00083     for(YAML::Iterator moduleIt = doc.begin(); moduleIt != doc.end(); ++moduleIt)
00084     {
00085         const YAML::Node& module(*moduleIt);
00086         this->push_back(pm.REG(DataPointsFilter).createFromYAML(module));
00087     }
00088     
00089     #endif // HAVE_YAML_CPP
00090 }
00091 
00093 template<typename T>
00094 void PointMatcher<T>::DataPointsFilters::init()
00095 {
00096     for (DataPointsFiltersIt it = this->begin(); it != this->end(); ++it)
00097     {
00098         (*it)->init();
00099     }
00100 }
00101 
00103 template<typename T>
00104 void PointMatcher<T>::DataPointsFilters::apply(DataPoints& cloud)
00105 {
00106     if (this->empty())
00107         return;
00108     
00109     DataPoints filteredCloud;
00110     cloud.assertDescriptorConsistency();
00111     const int nbPointsBeforeFilters(cloud.features.cols());
00112     LOG_INFO_STREAM("Applying " << this->size() << " DataPoints filters - " << nbPointsBeforeFilters << " points in");
00113 
00114     for (DataPointsFiltersIt it = this->begin(); it != this->end(); ++it)
00115     {
00116         const int nbPointsIn(cloud.features.cols());
00117         if (nbPointsIn == 0)
00118             throw ConvergenceError("no points to filter");
00119         
00120         filteredCloud = (*it)->filter(cloud);
00121         filteredCloud.assertDescriptorConsistency();
00122         swapDataPoints(cloud, filteredCloud);
00123         
00124         const int nbPointsOut(cloud.features.cols());
00125         LOG_INFO_STREAM("* " << (*it)->className << " - " << nbPointsOut << " points out (-" << (100 - double(nbPointsOut*100.)/nbPointsIn) << "\%)");
00126     }
00127     
00128     const int nbPointsAfterFilters(cloud.features.cols());
00129     LOG_INFO_STREAM("Applied " << this->size() << " filters - " << nbPointsAfterFilters << " points out (-" << (100 - double(nbPointsAfterFilters*100.)/nbPointsBeforeFilters) << "\%)");
00130 }
00131 
00132 template struct PointMatcher<float>::DataPointsFilters;
00133 template struct PointMatcher<double>::DataPointsFilters;


libpointmatcher
Author(s): Stéphane Magnenat, François Pomerleau
autogenerated on Thu Jan 2 2014 11:16:06