phundrak/genetic-images
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

README update

Browse Source
This commit is contained in:
Phuntsok Drak-pa 2019-03-19 17:32:41 +01:00
parent 73ca4dcc1d
commit 4a5a131ef0
1 changed files with 14 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
README.org
View File

@ -10,23 +10,26 @@ image as close as possible to the reference image.
The first method will be the random addition of squares of random size to random
locations of random color. If the picture with the new random square improves in
similarity with the reference image, then it is preserved, otherwise the change
is discarded. The generation of the new pictures will be multi-threaded; if two
or more threads return an improved picture, the best one will be selected. Then
it will be reused by the next threads.
is discarded. This method is here as a reference for the other methods.
The second method will instead delegate different parts of the picture to
The second method will be the same as the first method, however The generation
of the new pictures will be multi-threaded; if two or more threads return an
improved picture, the best one will be selected. Then it will be reused by the
next threads.
The third method will instead delegate different parts of the picture to
different threads. For instance, if the software runs on four threads, the
reference picture will be divided in four zones, each one will be generated by a
separate thread.
The third method, which can be combined with either the first or the second,
will limit the choice in terms of random color to the colors already existing in
the reference image.
The fourth method, which can be combined with the first three, will limit the
choice in terms of random color to the colors already existing in the reference
image.
The fourth method, which can be combined with the three first methods, will
force the random squares to be larger during the first iterations and
progressively smaller until the smallest specified size which should be reached
by the last iteration.
The fifth method, which can be combined with the four first methods, will force
the random squares to be larger during the first iterations and progressively
smaller until the smallest specified size which should be reached by the last
iteration.
More methods will be added later once these four will be implemented.