-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCircleOpt.java
71 lines (59 loc) · 2.37 KB
/
CircleOpt.java
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
package cljd;
public class CircleOpt {
public double stepSize = 0.25;
public double iterations = 30;
public static double square(double x) {return x*x;}
public double evaluate(double[] data, CircleParameters params) {
int N = data.length/2;
double sum = 0.0;
for (int i = 0; i < N; i++) {
int at = 2*i;
double x = data[at + 0];
double y = data[at + 1];
double distToCentre = Math.sqrt(
square(x - params.cx) + square(y - params.cy));
double distToCircle = distToCentre - params.r;
sum += square(distToCircle);
}
return (1.0/N)*sum;
}
public ADNumber evaluate(double[] data, ADCircleParameters params) {
int N = data.length/2;
ADNumber sum = ADNumber.constant(0.0);
for (int i = 0; i < N; i++) {
int at = 2*i;
ADNumber x = ADNumber.constant(data[at + 0]);
ADNumber y = ADNumber.constant(data[at + 1]);
ADNumber distToCentre = x.sub(params.cx).square()
.add(y.sub(params.cy).square())
.sqrt();
ADNumber distToCircle = distToCentre.sub(params.r);
sum = sum.add(distToCircle.square());
}
return sum.mul(ADNumber.constant(1.0/N));
}
private ADCircleParameters makeADParams(CircleParameters p, int which) {
ADCircleParameters dst = new ADCircleParameters();
dst.cx = new ADNumber(p.cx, which == 0? 1.0 : 0.0);
dst.cy = new ADNumber(p.cy, which == 1? 1.0 : 0.0);
dst.r = new ADNumber(p.r, which == 2? 1.0 : 0.0);
return dst;
}
public CircleParameters gradient(
double[] data, CircleParameters params) {
ADCircleParameters adp = new ADCircleParameters();
CircleParameters result = new CircleParameters();
result.cx = evaluate(data, makeADParams(params, 0)).getDerivative();
result.cy = evaluate(data, makeADParams(params, 1)).getDerivative();
result.r = evaluate(data, makeADParams(params, 2)).getDerivative();
return result;
}
public CircleParameters optimize(
double[] data, CircleParameters p0) {
CircleParameters p = p0;
for (int i = 0; i < iterations; i++) {
p = p.add(gradient(data, p).mul(-stepSize));
}
return p;
}
};