PointToPlane.h
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 #ifndef POINT_TO_PLANE_ERROR_MINIMIZER_H
00037 #define POINT_TO_PLANE_ERROR_MINIMIZER_H
00038 
00039 #include "PointMatcher.h"
00040 
00041 template<typename T>
00042 struct PointToPlaneErrorMinimizer: public PointMatcher<T>::ErrorMinimizer
00043 {
00044     typedef PointMatcherSupport::Parametrizable Parametrizable;
00045     typedef PointMatcherSupport::Parametrizable P;
00046     typedef Parametrizable::Parameters Parameters;
00047     typedef Parametrizable::ParameterDoc ParameterDoc;
00048     typedef Parametrizable::ParametersDoc ParametersDoc;
00049 
00050     typedef typename PointMatcher<T>::DataPoints DataPoints;
00051     typedef typename PointMatcher<T>::Matches Matches;
00052     typedef typename PointMatcher<T>::OutlierWeights OutlierWeights;
00053     typedef typename PointMatcher<T>::ErrorMinimizer ErrorMinimizer;
00054     typedef typename PointMatcher<T>::ErrorMinimizer::ErrorElements ErrorElements;
00055     typedef typename PointMatcher<T>::TransformationParameters TransformationParameters;
00056     typedef typename PointMatcher<T>::Vector Vector;
00057     typedef typename PointMatcher<T>::Matrix Matrix;
00058 
00059         virtual inline const std::string name()
00060         {
00061                 return "PointToPlaneErrorMinimizer";
00062         }
00063 
00064     inline static const std::string description()
00065     {
00066         return "Point-to-plane error (or point-to-line in 2D). Per \\cite{Chen1991Point2Plane}.";
00067     }
00068 
00069     inline static const ParametersDoc availableParameters()
00070     {
00071         return {
00072                 {"force2D", "If set to true(1), the minimization will be force to give a solution in 2D (i.e., on the XY-plane) even with 3D inputs.", "0", "0", "1", &P::Comp<bool>}
00073             };
00074     }
00075 
00076     const bool force2D;
00077 
00078     PointToPlaneErrorMinimizer(const Parameters& params = Parameters());
00079     PointToPlaneErrorMinimizer(const ParametersDoc paramsDoc, const Parameters& params);
00080     //virtual TransformationParameters compute(const DataPoints& filteredReading, const DataPoints& filteredReference, const OutlierWeights& outlierWeights, const Matches& matches);
00081     virtual TransformationParameters compute(const ErrorElements& mPts);
00082         TransformationParameters compute_in_place(ErrorElements& mPts);
00083     virtual T getResidualError(const DataPoints& filteredReading, const DataPoints& filteredReference, const OutlierWeights& outlierWeights, const Matches& matches) const;
00084     virtual T getOverlap() const;
00085 
00086     static T computeResidualError(ErrorElements mPts, const bool& force2D);
00087 };
00088 
00089 template<typename T, typename MatrixA, typename Vector>
00090 void solvePossiblyUnderdeterminedLinearSystem(const MatrixA& A, const Vector & b, Vector & x);
00091 
00092 #endif


libpointmatcher
Author(s):
autogenerated on Thu Jun 20 2019 19:51:32