forked from TUC-ProAut/libRSF
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSumMixture.h
More file actions
148 lines (127 loc) · 4.58 KB
/
Copy pathSumMixture.h
File metadata and controls
148 lines (127 loc) · 4.58 KB
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
/***************************************************************************
* libRSF - A Robust Sensor Fusion Library
*
* Copyright (C) 2018 Chair of Automation Technology / TU Chemnitz
* For more information see https://www.tu-chemnitz.de/etit/proaut/libRSF
*
* libRSF is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* libRSF is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with libRSF. If not, see <http://www.gnu.org/licenses/>.
*
* Author: Tim Pfeifer (tim.pfeifer@etit.tu-chemnitz.de)
***************************************************************************/
/**
* @file SumMixture.h
* @author Tim Pfeifer
* @date 18.09.2018
* @brief Sum-Mixture error model inspired from the work of Rosen.
* @copyright GNU Public License.
*
*/
#ifndef SUMMIXTURE_H
#define SUMMIXTURE_H
#include "ErrorModel.h"
#include "GaussianMixture.h"
#include "../NumericalRobust.h"
namespace libRSF
{
/** \brief The robust Sum-Mixture error model
* Based on:
* D. M. Rosen, M. Kaess, and J. J. Leonard
* “Robust incremental online inference over sparse factor graphs: Beyond the Gaussian case”
* Proc. of Intl. Conf. on Robotics and Automation (ICRA), Karlsruhe, 2013.
* DOI: 10.1109/ICRA.2013.6630699
*
* \param Mixture Underlying mixture distribution
*
*/
template <int Dim, typename MixtureType, bool SpecialNormalization>
class SumMixture : public ErrorModel <Dim, Dim>
{
public:
SumMixture()
{
_Normalization = 0;
}
virtual ~SumMixture() = default;
explicit SumMixture(const MixtureType &Mixture)
{
this->addMixture(Mixture);
}
void clear()
{
_Normalization = 0;
_Mixture.clear();
}
template <typename T>
bool weight(const VectorT<T, Dim> &RawError, T* Error) const
{
/** map error to eigen matrix for easier access */
VectorRef<T, Dim> ErrorMap(Error);
if(this->_Enable)
{
const int NumberOfComponents = _Mixture.getNumberOfComponents();
MatrixT<T, Dynamic, 1> Scalings(NumberOfComponents);
MatrixT<T, Dynamic, 1> Exponents(NumberOfComponents);
/** calculate all exponents and scalings */
for(int nComponent = 0; nComponent < NumberOfComponents; ++nComponent)
{
Exponents(nComponent) = - 0.5 * (_Mixture.template getExponentialPartOfComponent<T>(nComponent, RawError).squaredNorm() + 1e-10);
Scalings(nComponent) = T(_Mixture.template getLinearPartOfComponent<T>(nComponent, RawError));
}
/** combine them numerically robust and distribute the error equally over all dimensions */
ErrorMap.fill(sqrt(-2.0* (ScaledLogSumExp(Exponents, Scalings) - log(_Normalization + 1e-10))) / sqrt(Dim));
}
else
{
/** pass raw error trough */
VectorRef<T, Dim> ErrorMap(Error);
ErrorMap = RawError;
}
return true;
}
private:
void addMixture(const MixtureType &Mixture)
{
_Mixture = Mixture;
const int NumberOfComponents = _Mixture.getNumberOfComponents();
if constexpr(SpecialNormalization == false)
{
/** original version */
_Normalization = 0;
for(int nComponent = 0; nComponent < NumberOfComponents; ++nComponent)
{
_Normalization += _Mixture.getMaximumOfComponent(nComponent);
}
}
else
{
/** version for Reviewer 3 */
_Normalization = _Mixture.getMaximumOfComponent(0);
for(int nComponent = 1; nComponent < NumberOfComponents; ++nComponent)
{
_Normalization = std::max(_Normalization, _Mixture.getMaximumOfComponent(nComponent));
}
_Normalization = _Normalization*NumberOfComponents + 10;
}
}
MixtureType _Mixture;
double _Normalization;
};
typedef SumMixture<1, GaussianMixture<1>, false> SumMix1;
typedef SumMixture<2, GaussianMixture<2>, false> SumMix2;
typedef SumMixture<3, GaussianMixture<3>, false> SumMix3;
typedef SumMixture<1, GaussianMixture<1>, true> SumMix1Special;
typedef SumMixture<2, GaussianMixture<2>, true> SumMix2Special;
typedef SumMixture<3, GaussianMixture<3>, true> SumMix3Special;
}
#endif // SUMMIXTURE_H