-
Notifications
You must be signed in to change notification settings - Fork 1
/
vision_problem_2.cc
82 lines (70 loc) · 2.75 KB
/
vision_problem_2.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
/*
* 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_2.h"
#include "shape.h"
VisionProblem_2::VisionProblem_2() { }
void VisionProblem_2::generate(int label, Vignette *vignette) {
int x_big, y_big, x_small, y_small;
Shape big_shape, small_shape;
Vignette mask;
int nb_attempts, max_nb_attempts = 10;
int dist_min = Vignette::width/8;
do {
vignette->clear();
mask.clear();
big_shape.randomize(big_part_size / 2, big_part_hole_size / 2);
do {
x_big = int(random_uniform_0_1() * Vignette::width);
y_big = int(random_uniform_0_1() * Vignette::height);
} while(vignette->overwrites(&big_shape, x_big, y_big));
// The mask will encode either a thin area the small shape should
// intersect with (class 1) or a thick one it should not (class 0)
mask.draw(0, &big_shape, x_big, y_big);
if(label) {
mask.grow();
} else {
for(int k = 0; k < dist_min; k++) {
mask.grow();
}
}
vignette->store_and_draw(&big_shape, x_big, y_big, 0,
0, big_part_size, 0);
vignette->fill(x_big, y_big, 128);
vignette->switch_values(128, 255);
nb_attempts = 0;
do {
do {
small_shape.randomize(small_part_size / 2, small_part_hole_size / 2);
x_small = x_big + int((random_uniform_0_1() - 0.5) * big_part_size);
y_small = y_big + int((random_uniform_0_1() - 0.5) * big_part_size);
} while(vignette->overwrites(&small_shape, x_small, y_small)); // ||
nb_attempts++;
} while(nb_attempts < max_nb_attempts &&
((label && !mask.overwrites(&small_shape, x_small, y_small)) ||
(!label && mask.overwrites(&small_shape, x_small, y_small))));
vignette->replace_value(128, 255);
vignette->store_and_draw(&small_shape, x_small, y_small, 1,
0, small_part_size, 0);
} while(nb_attempts >= max_nb_attempts);
}