GPXSee/src/track.cpp

#include "track.h"


#define WINDOW_OE 31

#define WINDOW_EF 3
#define WINDOW_SF 7
#define WINDOW_HF 3


static qreal median(QVector<qreal> v)
{
	qSort(v.begin(), v.end());
	return v.at(v.size() / 2);
}

static qreal MAD(QVector<qreal> v, qreal m)
{
	for (int i = 0; i < v.size(); i++)
		v[i] = qAbs(v.at(i) - m);
	qSort(v.begin(), v.end());
	return v.at(v.size() / 2);
}

static QSet<int> eliminate(const QVector<qreal> &v, int window)
{
	QSet<int> rm;
	qreal m, M;


	if (v.size() < window)
		return rm;

	for (int i = window/2; i < v.size() - window/2; i++) {
		m = median(v.mid(i - window/2, window));
		M = MAD(v.mid(i - window/2, window), m);
		if (qAbs((0.6745 * (v.at(i) - m)) / M) > 3.5)
			rm.insert(i);
	}

	return rm;
}

static Graph filter(const Graph &v, int window)
{
	qreal acc = 0;
	Graph ret;

	if (v.size() < window)
		return ret;

	for (int i = 0; i < window; i++)
		acc += v.at(i).y();
	for (int i = 0; i <= window/2; i++)
		ret.append(GraphPoint(v.at(i).s(), v.at(i).t(), acc/window));

	for (int i = window/2 + 1; i < v.size() - window/2; i++) {
		acc += v.at(i + window/2).y() - v.at(i - (window/2 + 1)).y();
		ret.append(GraphPoint(v.at(i).s(), v.at(i).t(), acc/window));
	}

	for (int i = v.size() - window/2; i < v.size(); i++)
		ret.append(GraphPoint(v.at(i).s(), v.at(i).t(), acc/window));

	return ret;
}

Track::Track(const TrackData &data) : _data(data)
{
	qreal dt, ds, total;


	_time.append(0);
	_distance.append(0);
	_speed.append(0);

	for (int i = 1; i < data.count(); i++) {
		ds = data.at(i).coordinates().distanceTo(data.at(i-1).coordinates());
		_distance.append(ds);

		if (data.first().hasTimestamp() && data.at(i).hasTimestamp())
			_time.append(_data.first().timestamp().msecsTo(
			  _data.at(i).timestamp()) / 1000.0);
		else
			_time.append(NAN);

		if (std::isnan(_time.at(i)) || std::isnan(_time.at(i-1)))
			_speed.append(NAN);
		else {
			dt = _time.at(i) - _time.at(i-1);
			if (!dt) {
				_speed.append(_speed.at(i-1));
				continue;
			}
			_speed.append(ds / dt);
		}
	}

	_outliers = eliminate(_speed, WINDOW_OE);

	total = 0;
	for (int i = 0; i < _data.size(); i++) {
		if (_outliers.contains(i))
			continue;
		total += _distance.at(i);
		_distance[i] = total;
	}
}

Graph Track::elevation() const
{
	Graph raw;

	if (!_data.size())
		return raw;

	for (int i = 0; i < _data.size(); i++) {
		if (_outliers.contains(i))
			continue;

		if (_data.at(i).hasElevation())
			raw.append(GraphPoint(_distance.at(i), _time.at(i),
			  _data.at(i).elevation()));
	}

	return filter(raw, WINDOW_EF);
}

Graph Track::speed() const
{
	Graph raw;
	qreal v;

	if (!_data.size())
		return raw;

	for (int i = 0; i < _data.size(); i++) {
		if (_outliers.contains(i))
			continue;

		if (_data.at(i).hasSpeed())
			v = _data.at(i).speed();
		else if (!std::isnan(_speed.at(i)))
			v = _speed.at(i);
		else
			continue;

		raw.append(GraphPoint(_distance.at(i), _time.at(i), v));
	}

	return filter(raw, WINDOW_SF);
}

Graph Track::heartRate() const
{
	Graph raw;

	if (!_data.size())
		return raw;

	for (int i = 0; i < _data.count(); i++) {
		if (_outliers.contains(i))
			continue;

		if (_data.at(i).hasHeartRate())
			raw.append(GraphPoint(_distance.at(i), _time.at(i),
			  _data.at(i).heartRate()));
	}

	return filter(raw, WINDOW_HF);
}

Graph Track::temperature() const
{
	Graph raw;

	for (int i = 0; i < _data.size(); i++) {
		if (_outliers.contains(i))
			continue;

		if (_data.at(i).hasTemperature())
			raw.append(GraphPoint(_distance.at(i), _time.at(i),
			  _data.at(i).temperature()));
	}

	return Graph(raw);
}

qreal Track::distance() const
{
	return _distance.isEmpty() ? 0 : _distance.last();
}

qreal Track::time() const
{
	return (_data.size() < 2) ? 0 :
	  (_data.first().timestamp().msecsTo(_data.last().timestamp()) / 1000.0);
}

QDateTime Track::date() const
{
	return (_data.size()) ? _data.first().timestamp() : QDateTime();
}

Path Track::track() const
{
	Path ret;

	for (int i = 0; i < _data.size(); i++) {
		if (_outliers.contains(i))
			continue;

		ret.append(_data.at(i).coordinates());
	}

	return ret;
}