Mercurial > dive4elements > river

annotate artifacts/src/main/java/org/dive4elements/river/artifacts/math/MovingAverage.java @ 5863:4897a58c8746

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
River artifacts: Added new copyright headers.
author Sascha L. Teichmann <teichmann@intevation.de>
date Sun, 28 Apr 2013 14:40:59 +0200
parents 5aa05a7a34b7
children af13ceeba52a
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 *
4897a58c8746 River artifacts: Added new copyright headers.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 5838
diff changeset
4 * This file is Free Software under the GNU AGPL (>=v3)
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
4897a58c8746 River artifacts: Added new copyright headers.
Sascha L. Teichmann <teichmann@intevation.de>
parents: 5838
diff changeset
6 * documentation coming with Dive4Elements River for details.
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
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
15
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
16 public class MovingAverage
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
17 {
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
18
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
19 public static double[][] simple(double[][] values, double radius) {
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
20 TreeMap<Double, Double> map = toMap(values);
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
21 int N = map.size();
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
22 double [] xs = new double[N];
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
23 double [] ys = new double[N];
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
24 int ndx = 0;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
25 for (double x: map.keySet()) {
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
26 SortedMap<Double, Double> range =
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
27 map.subMap(x-radius, true, x+radius, true);
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
28 double avg = 0d;
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
29 for (double v: range.values()) {
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
30 avg += v;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
31 }
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
32 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
33 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
34 ys[ndx] = avg;
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
35 ndx++;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
36 }
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
37 return new double [][] { xs, ys };
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
38 }
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
39
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
40 public static double[][] weighted(double[][] values, double radius) {
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
41 TreeMap<Double, Double> map = toMap(values);
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
42 int N = map.size();
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
43 double [] xs = new double[N];
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
44 double [] ys = new double[N];
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
45 int ndx = 0;
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
46 double _1radius = 1d/radius;
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
47 for (double x: map.keySet()) {
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
48 double avg = 0d;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
49 double weights = 0d;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
50 for (Map.Entry<Double, Double> e:
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
51 map.subMap(x-radius, false, x+radius, false).entrySet()
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
52 ) {
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
53 double weight = 1d - Math.abs(x - e.getKey())*_1radius;
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
54 avg += weight*e.getValue();
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
55 weights += weight;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
56 }
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
57 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
58 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
59 ys[ndx] = avg;
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
60 ndx++;
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
61 }
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
62 return new double [][] { xs, ys };
4625
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
63 }
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 private static TreeMap<Double, Double> toMap(double[][] values) {
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
66 TreeMap<Double, Double> map = new TreeMap<Double, Double>();
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
67 double [] xs = values[0];
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
68 double [] ys = values[1];
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
69 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
70 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
71 }
d6d16b5ab2f0 New class for average calculation implementing moving average algorithms.
Raimund Renkert <rrenkert@intevation.de>
parents:
diff changeset
72 return map;
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 }
5664
fb9892036bd6 Added vimline.
Felix Wolfsteller <felix.wolfsteller@intevation.de>
parents: 4631
diff changeset
75 // vim:set ts=4 sw=4 si et sta sts=4 fenc=utf8 :
http://dive4elements.wald.intevation.org