X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?p=svrt.git;a=blobdiff_plain;f=vision_problem_15.cc;fp=vision_problem_15.cc;h=1747cb44b71827b74818760296917b9a18d9c061;hp=0000000000000000000000000000000000000000;hb=dfc7d0cd9b185a982b9f83d6d862824a62000aea;hpb=471b18a7f4e9cbdfb510f304260ec5e6baeee697

diff --git a/vision_problem_15.cc b/vision_problem_15.cc
new file mode 100644
index 0000000..1747cb4
--- /dev/null
+++ b/vision_problem_15.cc
@@ -0,0 +1,61 @@
+/*
+ *  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 <francois.fleuret@idiap.ch>
+ *
+ *  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 selector.  If not, see <http://www.gnu.org/licenses/>.
+ *
+ */
+
+#include "vision_problem_15.h"
+#include "shape.h"
+
+VisionProblem_15::VisionProblem_15() { }
+
+void VisionProblem_15::generate(int label, Vignette *vignette) {
+  int nb_shapes = 4;
+  int xs[nb_shapes], ys[nb_shapes];
+
+  int error;
+  do {
+    do {
+      scalar_t alpha = drand48() * 2 * M_PI;
+      scalar_t radius = drand48() * Vignette::width / 2;
+      scalar_t xc = drand48() * Vignette::width;
+      scalar_t yc = drand48() * Vignette::height;
+      for(int n = 0; n < nb_shapes; n++) {
+        xs[n] = int(xc + part_size/2 +
+                    radius * sin(alpha + n * 2 * M_PI / scalar_t(nb_shapes)));
+        ys[n] = int(yc + part_size/2 +
+                    radius * cos(alpha + n * 2 * M_PI / scalar_t(nb_shapes)));
+      }
+    } while(cluttered_shapes(part_size, nb_shapes, xs, ys));
+
+    vignette->clear();
+
+    Shape shape;
+    error = 0;
+    for(int n = 0; n < nb_shapes; n++) {
+      if(n == 0 || label == 0) {
+        shape.randomize(part_size / 2, part_hole_size / 2);
+      }
+      error |= shape.overwrites(vignette, xs[n], ys[n]);
+      shape.draw(vignette, xs[n], ys[n]);
+    }
+  } while(error);
+}