-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsubProblem.hpp
executable file
·342 lines (274 loc) · 8.94 KB
/
subProblem.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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
#ifndef SUBPROBLEM_HPP
#define SUBPROBLEM_HPP
#include <vector>
#include <set>
class subProblem
{
std::vector<double> *pCEnergy_;
std::vector<std::pair<std::vector<short>,double> > *pSpCEnergy_;
std::vector<short> nLabel_;
short comLabel_;
int blkSiz_;
std::vector<int> nodeOffset_;
int nDualVar_;
bool sparseFlag_;
public:
subProblem(const std::vector<int>& memNode, std::vector<short> nLabel, std::vector<double>* pCEnergy): pCEnergy_(pCEnergy), nLabel_(nLabel), nDualVar_(0), sizCliq_(memNode.size()), nCliqLab_(1), memNode_(memNode) {
sparseFlag_ = false;
stride_.resize(nLabel.size());
int strideComp = 1;
int strideInd = nLabel.size() - 1;
for (std::vector<short>::reverse_iterator rl = nLabel.rbegin(); rl != nLabel.rend(); ++rl) {
stride_[strideInd] = strideComp;
strideComp *= *rl;
--strideInd;
}
for (std::vector<short>::iterator l = nLabel.begin(); l != nLabel.end(); ++l) {
nodeOffset_.push_back(nDualVar_);
nDualVar_ += *l;
nCliqLab_ *= *l;
}
dualVar_.resize(nDualVar_);
momentum_.resize(nDualVar_);
gradient_.resize(nDualVar_);
newtonStep_.resize(nDualVar_);
primalCliqFrac_.resize(nCliqLab_);
primalCliqConsist_.resize(nCliqLab_);
}
subProblem(const std::vector<int>& memNode, std::vector<short> nLabel, std::vector<std::pair<std::vector<short>,double> >* pSpCEnergy): pSpCEnergy_(pSpCEnergy), nLabel_(nLabel), nDualVar_(0), sizCliq_(memNode.size()), nCliqLab_(1), memNode_(memNode) {
sparseFlag_ = true;
stride_.resize(nLabel.size());
int strideComp = 1;
int strideInd = nLabel.size() - 1;
for (std::vector<short>::reverse_iterator rl = nLabel.rbegin(); rl != nLabel.rend(); ++rl) {
stride_[strideInd] = strideComp;
strideComp *= *rl;
--strideInd;
}
for (std::vector<short>::iterator l = nLabel.begin(); l != nLabel.end(); ++l) {
nodeOffset_.push_back(nDualVar_);
nDualVar_ += *l;
}
nCliqLab_ = (*pSpCEnergy).size();
dualVar_.resize(nDualVar_);
momentum_.resize(nDualVar_);
gradient_.resize(nDualVar_);
newtonStep_.resize(nDualVar_);
primalCliqFrac_.resize(nCliqLab_);
primalCliqConsist_.resize(nCliqLab_);
}
subProblem(const std::vector<int>& memNode, std::vector<short> nLabel, int rowSiz, int colSiz, double *sparseKappa, std::map<int,double> *sparseEnergy, std::set<int> *sparseInd): nLabel_(nLabel), nDualVar_(0), sizCliq_(memNode.size()), rowSiz_(rowSiz), colSiz_(colSiz), nCliqLab_(1), memNode_(memNode), sparseKappa_(sparseKappa), sparseEnergy_(sparseEnergy), sparseInd_(sparseInd) {
int nMargSet = 6; //needed for calculating node-pair marginals
sparseFlag_ = true;
comLabel_ = nLabel_[0]; //if all nodes share same number of labels
blkSiz_ = comLabel_*comLabel_;
stride_.resize(sizCliq_);
int strideComp = 1;
int strideInd = sizCliq_ - 1;
for (std::vector<short>::reverse_iterator rl = nLabel.rbegin(); rl != nLabel.rend(); ++rl) {
stride_[strideInd] = strideComp;
strideComp *= *rl;
--strideInd;
}
for (std::vector<short>::iterator l = nLabel.begin(); l != nLabel.end(); ++l) {
nodeOffset_.push_back(nDualVar_);
nDualVar_ += *l;
nCliqLab_ *= *l;
}
for (int iNode = 0; iNode != (sizCliq_+1)/2; ++iNode) {
oneSet_.push_back(iNode);
}
for (int iNode = (sizCliq_+1)/2; iNode != sizCliq_; ++iNode) {
twoSet_.push_back(iNode);
}
if (sizCliq_ == 3) { //only possible if clique is 1X3 or 3X1
threeASet_.push_back(0);
threeBSet_.push_back(2);
fourASet_.push_back(1);
fourBSet_.clear();
fiveASet_.push_back(1);
fiveBSet_.push_back(2);
sixASet_.push_back(0);
sixBSet_.clear();
}
else if ((rowSiz_ == 2) && (colSiz_ == 2)) {
threeASet_.push_back(0);
threeBSet_.push_back(2);
fourASet_.push_back(1);
fourBSet_.push_back(3);
fiveASet_.push_back(0);
fiveBSet_.push_back(3);
sixASet_.push_back(1);
sixBSet_.push_back(2);
}
setStride_.resize(nMargSet);
nSetLab_.resize(nMargSet);
for (int setInd = 0; setInd != nMargSet; ++setInd) {
std::vector<int> fullSet = getSet(setInd);
setStride_[setInd].resize(fullSet.size());
strideInd = setStride_[setInd].size() - 1;
strideComp = 1;
nSetLab_[setInd] = 1;
for (std::vector<int>::reverse_iterator rn = fullSet.rbegin(); rn != fullSet.rend(); ++rn) {
setStride_[setInd][strideInd] = strideComp;
strideComp *= nLabel[*rn];
nSetLab_[setInd] *= nLabel[*rn];
--strideInd;
}
}
dualVar_.resize(nDualVar_);
momentum_.resize(nDualVar_);
gradient_.resize(nDualVar_);
newtonStep_.resize(nDualVar_);
//primalCliqFrac_.resize(nCliqLab_);
//primalCliqConsist_.resize(nCliqLab_);
}
subProblem(const std::vector<int>& memNode, std::vector<short> nLabel, std::vector<double> pixVal): nLabel_(nLabel), nDualVar_(0), sizCliq_(memNode.size()), nCliqLab_(1), memNode_(memNode), pixVal_(pixVal) {
stride_.resize(nLabel.size());
int strideComp = 1;
int strideInd = nLabel.size() - 1;
for (std::vector<short>::reverse_iterator rl = nLabel.rbegin(); rl != nLabel.rend(); ++rl) {
stride_[strideInd] = strideComp;
strideComp *= *rl;
--strideInd;
}
for (std::vector<short>::iterator l = nLabel.begin(); l != nLabel.end(); ++l) {
nodeOffset_.push_back(nDualVar_);
nDualVar_ += *l;
nCliqLab_ *= *l;
}
dualVar_.resize(nDualVar_);
momentum_.resize(nDualVar_);
gradient_.resize(nDualVar_);
newtonStep_.resize(nDualVar_);
primalCliqFrac_.resize(nCliqLab_);
primalCliqConsist_.resize(nCliqLab_);
}
int sizCliq_;
int rowSiz_, colSiz_;
int nCliqLab_;
std::vector<int> nSetLab_;
int vecOffset_;
std::vector<double> dualVar_;
std::vector<double> momentum_;
std::vector<double> gradient_;
std::vector<double> newtonStep_;
std::vector<int> memNode_;
std::vector<double> pixVal_;
std::vector<int> oneSet_, twoSet_;
std::vector<int> threeASet_, threeBSet_;
std::vector<int> fourASet_, fourBSet_;
std::vector<int> fiveASet_, fiveBSet_;
std::vector<int> sixASet_, sixBSet_;
std::set<int> cliqNeigh_;
std::vector<int> stride_;
std::vector<std::vector<int> > setStride_;
int primalCliqMax_;
std::vector<double> primalCliqFrac_;
std::vector<double> primalCliqConsist_;
std::vector<double> nodeLabSum_;
std::vector<double> nodePairLabSum_;
double f1Den_;
std::vector<short> getNodeLabel() const {return nLabel_;}
short getComLabel() const {return comLabel_;}
int getBlkSiz() const {return blkSiz_;}
int getCliqSiz() const {return sizCliq_;}
std::vector<double> getDualVar() const {return dualVar_;}
std::vector<double> getMomentum() const {return momentum_;}
std::vector<int> getNodeOffset() const {return nodeOffset_;}
int getCliqOffset() const {return vecOffset_;}
void setCliqOffset(int vecOffset) {vecOffset_ = vecOffset;}
int getDualSiz() const {return nDualVar_;}
std::vector<double> getCE() const {return *pCEnergy_;}
std::vector<double> getPixVal() const {return pixVal_;}
std::vector<int> getMemNode() const {return memNode_;}
//std::vector<int> getOneSet() const {return oneSet_;}
//std::vector<int> getTwoSet() const {return twoSet_;}
std::vector<int> getSet(int setInd) const {
std::vector<int> retVec;
switch(setInd) {
case 0:
return oneSet_;
case 1:
return twoSet_;
case 2:
retVec = threeASet_;
retVec.insert(retVec.end(), threeBSet_.begin(), threeBSet_.end());
return retVec;
case 3:
retVec = fourASet_;
retVec.insert(retVec.end(), fourBSet_.begin(), fourBSet_.end());
return retVec;
case 4:
retVec = fiveASet_;
retVec.insert(retVec.end(), fiveBSet_.begin(), fiveBSet_.end());
return retVec;
case 5:
retVec = sixASet_;
retVec.insert(retVec.end(), sixBSet_.begin(), sixBSet_.end());
return retVec;
}
return retVec;
}
std::vector<int> getSet(int setInd, char partInd) const {
if (setInd == 2) {
if (partInd == 'a') {
return threeASet_;
}
else if (partInd == 'b') {
return threeBSet_;
}
}
else if (setInd == 3) {
if (partInd == 'a') {
return fourASet_;
}
else if (partInd == 'b') {
return fourBSet_;
}
}
else if (setInd == 4) {
if (partInd == 'a') {
return fiveASet_;
}
else if (partInd == 'b') {
return fiveBSet_;
}
}
else if (setInd == 5) {
if (partInd == 'a') {
return sixASet_;
}
else if (partInd == 'b') {
return sixBSet_;
}
}
}
std::vector<int> getStride() const {return stride_;}
std::vector<int> getStride(int setInd) const {
return setStride_[setInd];
}
int getSetLabCnt(int setInd) const {
return nSetLab_[setInd];
}
std::set<int> getSparseInd() const {return *sparseInd_;}
double getCEConst() const {return *sparseKappa_;}
double getCE(int iCliqLab) const {
if (sparseFlag_) {
if ((*sparseEnergy_).find(iCliqLab) == (*sparseEnergy_).end()) {
return *sparseKappa_;
}
else {
return (*sparseEnergy_)[iCliqLab];
}
}
else {
return (*pCEnergy_)[iCliqLab];
}
}
// std::vector<std::pair<std::vector<short>,double> > getSparseCEnergy() const {return *pSpCEnergy_;}
double *sparseKappa_;
std::map<int,double> *sparseEnergy_;
std::set<int> *sparseInd_;
};
#endif //SUBPROBLEM_HPP