-
Notifications
You must be signed in to change notification settings - Fork 1
/
vision_problem_19.cc
79 lines (66 loc) · 2.29 KB
/
vision_problem_19.cc
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
/*
* svrt is the ``Synthetic Visual Reasoning Test'', an image
* generator for evaluating classification performance of machine
* learning systems, humans and primates.
*
* Copyright (c) 2009 Idiap Research Institute, http://www.idiap.ch/
* Written by Francois Fleuret <[email protected]>
*
* This file is part of svrt.
*
* svrt is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 3 as
* published by the Free Software Foundation.
*
* svrt is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with svrt. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "vision_problem_19.h"
#include "shape.h"
VisionProblem_19::VisionProblem_19() { }
void VisionProblem_19::generate(int label, Vignette *vignette) {
int nb_shapes = 2;
int xs[nb_shapes], ys[nb_shapes];
int shapeness[nb_shapes];
scalar_t scales[nb_shapes], angles[nb_shapes];
Shape shapes[nb_shapes];
int error;
do {
scalar_t max_scale = -1;
for(int n = 0; n < nb_shapes; n++) {
xs[n] = int(random_uniform_0_1() * Vignette::width);
ys[n] = int(random_uniform_0_1() * Vignette::height);
scales[n] = 1.0 + 3.0 * random_uniform_0_1();
if(n == 0 || scales[n] > max_scale) max_scale = scales[n];
angles[n] = 0;
}
for(int n = 0; n < nb_shapes; n++) {
if(n == 0 || label == 0) {
shapes[n].randomize(max_scale * part_size / 2, max_scale * hole_size/2);
shapeness[n] = n;
} else {
shapes[n].copy(&shapes[0]);
shapeness[n] = 0;
}
}
for(int n = 0; n < nb_shapes; n++) {
shapes[n].scale(scales[n] / max_scale);
shapes[n].rotate(angles[n]);
}
vignette->clear();
error = 0;
for(int n = 0; n < nb_shapes; n++) {
error |= vignette->overwrites(&shapes[n], xs[n], ys[n]);
if(!error) {
vignette->store_and_draw(&shapes[n], xs[n], ys[n], shapeness[n],
angles[n], scales[n] * part_size / 2, 0);
}
}
} while(error);
}