-
Notifications
You must be signed in to change notification settings - Fork 0
/
approximateES.hpp
217 lines (191 loc) · 6.62 KB
/
approximateES.hpp
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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
#pragma once
#include "keep-me-concave/keep_me_concave.hpp"
#include <queue>
#include "EnergyMinimizer.hpp"
#include <stdio.h>
#include "util.hpp"
typedef struct Undefined
{
double lambda;
short_array x_l;
short_array x_r;
Undefined(double _lambda, short_array _x_l, short_array _x_r):lambda(_lambda),x_l(_x_l),x_r(_x_r)
{
}
}Undefined;
// I think there is no need to store \Lambda^\star
/*typedef struct Defined
{
double lambda;
short_array x;
Defined(double _lambda, short_array _x):lambda(_lambda),x(_x)
{
}
}Defined;*/
class ApproximateES
{
vector<short_array> labelings; // labelings aligned with KeepMeConcave::segments
KeepMeConcave kmc;
double lambda_min, lambda_max;
size_t N; // number of variables
queue<Undefined> Lambda;
//vector<Defined> LambdaStar;
EnergyMinimizer* minimizer;
size_t max_iter;
int verbosity;
int e1, e2, e3;
public:
ApproximateES(size_t _N, double _lambda_min, double _lambda_max, EnergyMinimizer* _m , float* _x0 = NULL, size_t _max_iter = 10000, int _verbosity = 0, float* _x1 = NULL):
kmc(_lambda_min, _lambda_max),
lambda_min(_lambda_min),
lambda_max(_lambda_max),
N(_N),
minimizer(_m),
max_iter(_max_iter),
verbosity(_verbosity)
{
e1 = e2 = e3 = 0;
short_array x0( new float[N] );
short_array x1( new float[N] );
for(size_t i = 0; i < N; i++) // copy
{
if(_x0 != NULL )
x0[i] = _x0[i];
else x0[i] = 0;
if(_x1 != NULL )
x1[i] = _x1[i];
else x1[i] = x0[i];
}
Undefined u1(lambda_min, x0, x0);
Undefined u2(lambda_max, x1, x1);
Lambda.push(u1);
Lambda.push(u2);
labelings.push_back( x0 );
labelings.push_back( x1 );
}
bool compare(const short_array& s1, const short_array& s2, double lambda)
{
if(lambda == lambda_min || lambda == lambda_max)
return false;
for(size_t i = 0; i < N; i++)
{
if( s1[i] != s2[i] )
return false;
}
return true;
}
void loop()
{
size_t iter = 0;
while( (!Lambda.empty()) && (iter < max_iter) )
{
if(verbosity >= 2)
cout<<"Iteration: "<<iter<<endl;
else if(verbosity == 1 && (iter%10)==0)
cout<<"Iteration: "<<iter<<endl;
Undefined u = Lambda.front();
Lambda.pop();
double energy2, m2, b2,min_m, min_b, min_energy;
double energy3, m3, b3;
//short_array min_x = minimizer->minimize( u.x_l, u.lambda, min_energy, min_m, min_b, true);
short_array min_x = minimizer->minimize( u.x_l, u.lambda, min_energy, min_m, min_b, false);
short_array x2 = minimizer->minimize( u.x_r, u.lambda, energy2, m2, b2, false);
short_array x3 = minimizer->minimize( u.x_r, u.lambda, energy3, m3, b3, true);
if(min_energy > energy2 && min_energy > energy3)
e1++;
else if( energy2 > energy3 && energy2 > min_energy)
e2++;
else if( energy3 > energy2 && energy3 > min_energy)
e3++;
if( energy2 < min_energy)
{
min_m = m2;
min_b = b2;
min_energy = energy2;
min_x = x2;
}
if(energy3 < min_energy)
{
min_m = m3;
min_b = b3;
min_energy = energy3;
min_x = x3;
}
//if( !compare( min_x, u.x_l, u.lambda) && !compare(min_x, u.x_r, u.lambda) )
{
LineSegment l( min_m, min_b, lambda_min, lambda_max, false );
kmc.addLineSegment(l);
if(verbosity >= 2)
cout<<"* Adding line segment: "<<l<<endl;
int num_intersections = kmc.num_intersections;
if( num_intersections > 1 && (kmc.intersecting_lambda[0] != kmc.intersecting_lambda[num_intersections -1] ) )
{ // had intersections
cout.precision(16);
if(verbosity >= 1)
{
cout<<"\t Had intersections at "<< kmc.intersecting_lambda[0]<<", "<<kmc.intersecting_lambda[num_intersections-1]<<endl;
cout<<"\t\t Energies are: "<< fixed << kmc.intersecting_energies[0]<<", "<<fixed<<kmc.intersecting_energies[num_intersections-1]<<endl;
}
double lambda_l = kmc.intersecting_lambda[0];
double lambda_r = kmc.intersecting_lambda[num_intersections - 1];
int index_l = kmc.intersecting_indexes[0];
int index_r = kmc.intersecting_indexes[num_intersections - 1];
if(index_r - index_l > 1 )
labelings.erase( labelings.begin() + index_l + 1, labelings.begin() + index_r);
Undefined u1( lambda_l, labelings[index_l], min_x );
Undefined u2( lambda_r, labelings[index_r], min_x );
Lambda.push(u1);
Lambda.push(u2);
labelings.insert( labelings.begin() + index_l + 1, min_x);
}
}
//else
//{
//}
iter++;
}
if(iter == max_iter)
cout<<"Maximum number of iterations reached"<<endl;
cout<<"Done in "<<iter<<" iterations."<<endl;
cout<<KBCYN<<"[e1, e2, e3] = ["<<e1<<", "<<e2<<", "<<e3<<"]"<<KNRM<<endl;
if(verbosity >= 1)
cout<<kmc<<endl;
if(verbosity >= 2)
{
/*cout<<"labelings:"<<endl;
for(size_t i = 0; i < labelings.size(); i++)
{
cout<<labelings[i][0]<<" ";
}
cout<<endl;*/
}
}
void writeLambdas(const char* filename)
{
FILE* fp = fopen(filename,"w");
if(!fp)
{
cerr<<"Error in openning file "<<filename<<endl;
return;
}
vector<LineSegment> segments = kmc.getSegments();
size_t i = 0;
for(i = 1; i < segments.size(); i++)
{
fprintf(fp, "%e\n", segments[i].lambda_min);
}
//fprintf(fp, "%.8f\n", segments[i-1].lambda_max);
fclose(fp);
}
vector<short_array> getLabelings()
{
return labelings;
}
KeepMeConcave getKMC()
{
return kmc;
}
~ApproximateES()
{
}
};