mirror of
https://gitee.com/mirrors_PX4/PX4-Autopilot.git
synced 2026-04-14 10:07:39 +08:00
161 lines
4.4 KiB
C++
161 lines
4.4 KiB
C++
/****************************************************************************
|
|
*
|
|
* Copyright (c) 2021-2022 PX4 Development Team. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in
|
|
* the documentation and/or other materials provided with the
|
|
* distribution.
|
|
* 3. Neither the name PX4 nor the names of its contributors may be
|
|
* used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
|
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
|
|
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
|
|
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
|
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
****************************************************************************/
|
|
|
|
/**
|
|
* @file WelfordMeanVector.hpp
|
|
*
|
|
* Welford's online algorithm for computing mean and covariance of a vector.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
namespace math
|
|
{
|
|
|
|
template <typename Type, size_t N>
|
|
class WelfordMeanVector
|
|
{
|
|
public:
|
|
// For a new value, compute the new count, new mean, the new M2.
|
|
bool update(const matrix::Vector<Type, N> &new_value)
|
|
{
|
|
if (_count == 0) {
|
|
reset();
|
|
_count = 1;
|
|
_mean = new_value;
|
|
return false;
|
|
|
|
} else if (_count == UINT16_MAX) {
|
|
// count overflow
|
|
// reset count, but maintain mean and variance
|
|
_M2 = _M2 / _count;
|
|
_M2_accum.zero();
|
|
|
|
_count = 1;
|
|
|
|
} else {
|
|
_count++;
|
|
}
|
|
|
|
// mean
|
|
// accumulates the mean of the entire dataset
|
|
// use Kahan summation because delta can be very small compared to the mean
|
|
const matrix::Vector<Type, N> delta{new_value - _mean};
|
|
{
|
|
const matrix::Vector<Type, N> y = (delta / _count) - _mean_accum;
|
|
const matrix::Vector<Type, N> t = _mean + y;
|
|
_mean_accum = (t - _mean) - y;
|
|
_mean = t;
|
|
}
|
|
|
|
if (!_mean.isAllFinite()) {
|
|
reset();
|
|
return false;
|
|
}
|
|
|
|
// covariance
|
|
// Kahan summation (upper triangle only)
|
|
{
|
|
// eg C(x,y) += dx * (y - mean_y)
|
|
matrix::SquareMatrix<Type, N> m2_change{};
|
|
|
|
for (size_t r = 0; r < N; r++) {
|
|
for (size_t c = r; c < N; c++) {
|
|
m2_change(r, c) = delta(r) * (new_value(c) - _mean(c));
|
|
}
|
|
}
|
|
|
|
for (size_t r = 0; r < N; r++) {
|
|
for (size_t c = r; c < N; c++) {
|
|
|
|
const Type y = m2_change(r, c) - _M2_accum(r, c);
|
|
const Type t = _M2(r, c) + y;
|
|
_M2_accum(r, c) = (t - _M2(r, c)) - y;
|
|
|
|
_M2(r, c) = t;
|
|
}
|
|
|
|
// protect against floating point precision causing negative variances
|
|
if (_M2(r, r) < 0) {
|
|
_M2(r, r) = 0;
|
|
}
|
|
}
|
|
|
|
// make symmetric
|
|
for (size_t r = 0; r < N; r++) {
|
|
for (size_t c = r + 1; c < N; c++) {
|
|
_M2(c, r) = _M2(r, c);
|
|
}
|
|
}
|
|
}
|
|
|
|
if (!_M2.isAllFinite()) {
|
|
reset();
|
|
return false;
|
|
}
|
|
|
|
return valid();
|
|
}
|
|
|
|
bool valid() const { return _count > 2; }
|
|
auto count() const { return _count; }
|
|
|
|
void reset()
|
|
{
|
|
_count = 0;
|
|
_mean.zero();
|
|
_M2.zero();
|
|
|
|
_mean_accum.zero();
|
|
_M2_accum.zero();
|
|
}
|
|
|
|
matrix::Vector<Type, N> mean() const { return _mean; }
|
|
matrix::Vector<Type, N> variance() const { return _M2.diag() / (_count - 1); }
|
|
matrix::SquareMatrix<Type, N> covariance() const { return _M2 / (_count - 1); }
|
|
|
|
Type covariance(int x, int y) const { return _M2(x, y) / (_count - 1); }
|
|
|
|
private:
|
|
|
|
matrix::Vector<Type, N> _mean{};
|
|
matrix::Vector<Type, N> _mean_accum{}; ///< kahan summation algorithm accumulator for mean
|
|
|
|
matrix::SquareMatrix<Type, N> _M2{};
|
|
matrix::SquareMatrix<Type, N> _M2_accum{}; ///< kahan summation algorithm accumulator for M2
|
|
|
|
uint16_t _count{0};
|
|
};
|
|
|
|
} // namespace math
|