-
Notifications
You must be signed in to change notification settings - Fork 1
/
vision_problem_11.cc
104 lines (84 loc) · 2.96 KB
/
vision_problem_11.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
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
/*
* 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_11.h"
#include "shape.h"
VisionProblem_11::VisionProblem_11() { }
void VisionProblem_11::generate(int label, Vignette *vignette) {
int nb_shapes;
int xs, ys, i = 0, pxs, pys;
const int dist_min = Vignette::width/12;
int nb_attempts, max_nb_attempts = 100;
int scale, shapeness = 0;
Vignette mask, tmp;
nb_shapes = 2;
do {
nb_attempts = 0;
mask.clear();
vignette->clear();
pxs = 0; pys = 0;
for(int s = 0; nb_attempts < max_nb_attempts && s < nb_shapes; s++) {
Shape shape;
do {
tmp.clear();
do {
if(s == 0) {
scale = big_part_size / 2;
shape.randomize(scale, big_part_hole_size / 2);
shapeness = 0;
} else {
scale = small_part_size / 2;
shape.randomize(scale, small_part_hole_size / 2);
shapeness = 1;
}
if(nb_shapes == 2 || s == 0 || label == 0) {
xs = int(random_uniform_0_1() * Vignette::width);
ys = int(random_uniform_0_1() * Vignette::height);
} else {
xs = pxs + int(4 * (random_uniform_0_1() - 0.5) * small_part_hole_size);
ys = pys + int(4 * (random_uniform_0_1() - 0.5) * small_part_hole_size);
}
nb_attempts++;
} while(nb_attempts < max_nb_attempts &&
tmp.overwrites(&shape, xs, ys));
if(nb_attempts < max_nb_attempts) {
tmp.draw(s, &shape, xs, ys);
tmp.fill(xs, ys, 128);
i = tmp.intersection(&mask);
}
nb_attempts++;
} while(nb_attempts < max_nb_attempts &&
s > 0 &&
((label == 0 && i > 0) || (label == 1 && (i < 1 || i > 4))));
if(nb_attempts < max_nb_attempts) {
vignette->store_and_draw(&shape, xs, ys, shapeness,
0, scale, 0);
pxs = xs; pys = ys;
if(label == 0) {
for(int k = 0; k < dist_min; k++) tmp.grow();
}
mask.superpose(&mask, &tmp);
}
}
} while(nb_attempts >= max_nb_attempts);
}