annotate artifacts/src/main/java/org/dive4elements/river/artifacts/math/MovingAverage.java @ 9608:96c41d4f4aba

'.filtered' handling: NaN treatment improved
author dnt_bjoernsen <d.tironi@bjoernsen.de>
date Thu, 12 Sep 2019 15:39:10 +0200
parents 34c15927f9d9
children
rev   line source
5863
4897a58c8746 River artifacts: Added new copyright headers.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 5838
diff changeset
1 /* Copyright (C) 2011, 2012, 2013 by Bundesanstalt für Gewässerkunde
4897a58c8746 River artifacts: Added new copyright headers.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 5838
diff changeset
2 * Software engineering by Intevation GmbH
4897a58c8746 River artifacts: Added new copyright headers.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 5838
diff changeset
3 *
5994
af13ceeba52a Removed trailing whitespace.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 5863
diff changeset
4 * This file is Free Software under the GNU AGPL (>=v3)
5863
4897a58c8746 River artifacts: Added new copyright headers.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 5838
diff changeset
5 * and comes with ABSOLUTELY NO WARRANTY! Check out the
5994
af13ceeba52a Removed trailing whitespace.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 5863
diff changeset
6 * documentation coming with Dive4Elements River for details.
5863
4897a58c8746 River artifacts: Added new copyright headers.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 5838
diff changeset
7 */
4897a58c8746 River artifacts: Added new copyright headers.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 5838
diff changeset
8
5831
bd047b71ab37 Repaired internal references
Sascha L. Teichmann <teichmann@intevation.de>
parents: 5664
diff changeset
9 package org.dive4elements.river.artifacts.math;
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
10
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
11 import java.util.Map;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
12 import java.util.SortedMap;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
13 import java.util.TreeMap;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
14
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
15 public class MovingAverage {
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
16
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
17 public static double[][] simple(final double[][] values, final double radius) {
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
18 final TreeMap<Double, Double> map = toMap(values);
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
19 final int N = map.size();
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
20 final double[] xs = new double[N];
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
21 final double[] ys = new double[N];
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
22 int ndx = 0;
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
23 for (final double x : map.keySet()) {
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
24 final SortedMap<Double, Double> range = map.subMap(x - radius, true, x + radius, true);
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
25 double avg = 0d;
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
26 for (final double v : range.values()) {
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
27 avg += v;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
28 }
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
29 avg /= range.size();
4631
d35d316049e8 A little optimization and handle the case that there are duplicates in the values.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 4630
diff changeset
30 xs[ndx] = x;
d35d316049e8 A little optimization and handle the case that there are duplicates in the values.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 4630
diff changeset
31 ys[ndx] = avg;
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
32 ndx++;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
33 }
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
34 return new double[][] { xs, ys };
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
35 }
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
36
6763
34c15927f9d9 cosmetics.
Felix Wolfsteller <felix.wolfsteller@intevation.de>
parents: 5994
diff changeset
37 /** Build moving average over values. Weight them. */
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
38 public static double[][] weighted(final double[][] values, final double radius) {
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
39 final TreeMap<Double, Double> map = toMap(values);
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
40 final int N = map.size();
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
41 final double[] xs = new double[N];
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
42 final double[] ys = new double[N];
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
43 int ndx = 0;
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
44 final double _1radius = 1d / radius;
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
45 for (final double x : map.keySet()) {
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
46 double avg = 0d;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
47 double weights = 0d;
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
48 for (final Map.Entry<Double, Double> e : map.subMap(x - radius, false, x + radius, false).entrySet()) {
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
49 final Double value = e.getValue();
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
50
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
51 if (!value.isNaN()) {
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
52 final double weight = 1d - Math.abs(x - e.getKey()) * _1radius;
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
53 weights += weight;
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
54 avg += weight * value;
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
55 }
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
56 }
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
57
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
58 avg /= weights;
4631
d35d316049e8 A little optimization and handle the case that there are duplicates in the values.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 4630
diff changeset
59 xs[ndx] = x;
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
60 ys[ndx] = Double.isNaN(map.get(x)) ? Double.NaN : avg;
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
61 ndx++;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
62 }
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
63 return new double[][] { xs, ys };
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
64 }
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
65
6763
34c15927f9d9 cosmetics.
Felix Wolfsteller <felix.wolfsteller@intevation.de>
parents: 5994
diff changeset
66 /** From [x1,x2][y1,y2] makes {x1:y1,x2:y2}. Sorted by x! */
9608
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
67 private static TreeMap<Double, Double> toMap(final double[][] values) {
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
68 final TreeMap<Double, Double> map = new TreeMap<>();
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
69 final double[] xs = values[0];
96c41d4f4aba '.filtered' handling: NaN treatment improved
dnt_bjoernsen <d.tironi@bjoernsen.de>
parents: 6763
diff changeset
70 final double[] ys = values[1];
4631
d35d316049e8 A little optimization and handle the case that there are duplicates in the values.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 4630
diff changeset
71 for (int i = 0; i < xs.length; i++) {
d35d316049e8 A little optimization and handle the case that there are duplicates in the values.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 4630
diff changeset
72 map.put(xs[i], ys[i]);
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
73 }
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
74 return map;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
75 }
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
76 }
5664
fb9892036bd6 Added vimline.
Felix Wolfsteller <felix.wolfsteller@intevation.de>
parents: 4631
diff changeset
77 // vim:set ts=4 sw=4 si et sta sts=4 fenc=utf8 :

http://dive4elements.wald.intevation.org