Abstract
Beautiful paintings can be approximated with remarkably decent quality using a finite list of translucent polygons, each consisting of a finite number of points, and initialized with random color and coordinates. The polygons evolve by repeatedly mutating their color and coordinates until the resulting mutant satisfies some selection criteria for the next generation. In the end, an approximation of the given image is achieved with a good precision given the restriction that the number of polygons and the number of points per polygon are limited. Since its appearance in 2008 under the name “Evolution of Mona Lisa”, researchers’ interest toward it has decreased despite its initial popularity, which can be partially explained with the lack of a formal publication. In this paper, we describe an efficient natural selection strategy inspired by simulated annealing that, when compared to the existing method, yields better results in every experiment that we conducted. Moreover, this may serve as the first formal introduction to this problem and motivate further research on the topic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fujiwara, Y., Sawai, H.: Evolutionary computation applied to 3D image reconstruction. In: Evolutionary Computation, USA (1997)
Ho, S.Y., Chen, Y.C.: An efficient evolutionary algorithm for accurate polygonal approximation. Pattern Recogn. 34, 2305–2317 (2001)
Santamaría, J., et al.: Performance evaluation of memetic approaches in 3D reconstruction of forensic objects. Soft Comput. 13, 883 (2009)
Genetic Programming: Evolution of Mona Lisa. https://rogerjohansson.blog/2008/12/07/genetic-programming-evolution-of-mona-lisa. Accessed 31 Jan 2018
Dianne, H.: Mona Lisa - A Life Discovered. Simon & Schuster, New York (2015)
Mona Lisa Thing. https://github.com/mackstann/mona/tree/master. Accessed 31 Jan 2018
Evolve: Image Evolution. http://alteredqualia.com/visualization/evolve. Accessed 31 Jan 2018
Evolisa. https://github.com/miezekatze/evolisa. Accessed 31 Jan 2018
Genetic Lisa. https://github.com/peterbraden/genetic-lisa. Accessed 31 Jan 2018
Genetic Programming: Mona Lisa FAQ. https://rogerjohansson.blog/2008/12/09/genetic-programming-mona-lisa-faq. Accessed 31 Jan 2018
Luke, S.: Essentials of Metaheuristics, 2nd edn. Lulu, Abu Dhabi (2013)
Evolution Strategies. http://www.bionik.tu-berlin.de/institut/xs2evost.html. Accessed 31 Jan 2018
Kirkpatrick, S., Gelatt, C.D.J., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Russell, S., Norvig, P.: Artificial Intelligence - A Modern Approach, 2nd edn, pp. 111–114. Prentice Hall, Upper Saddle River (2003)
Azizi, N., Zolfaghari, S.: Adaptive temperature control for simulated annealing: a comparative study. Comput. Oper. Res. 31, 2439–2451 (2004)
Schneider, J., Puchta, M.: Investigation of acceptance simulated annealing - a simplified approach to adaptive cooling schedules. Stat. Mech. Appl. 389, 5822–5831 (2010)
Xinchao, Z.: Simulated annealing algorithm with adaptive neighborhood. Appl. Soft Comput. 11(2), 1827–1836 (2011)
Li, K., Li, M., Chen, H.: The empirical analysis of exploration-exploitation tradeoff for uncertain environment. In: 2014 Seventh International Symposium on Computational Intelligence and Design, Hangzhou, pp. 274–279 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Lam, G.T., Balabanov, K., Logofătu, D., Badica, C. (2018). Novel Nature-Inspired Selection Strategies for Digital Image Evolution of Artwork. In: Nguyen, N., Pimenidis, E., Khan, Z., Trawiński, B. (eds) Computational Collective Intelligence. ICCCI 2018. Lecture Notes in Computer Science(), vol 11056. Springer, Cham. https://doi.org/10.1007/978-3-319-98446-9_47
Download citation
DOI: https://doi.org/10.1007/978-3-319-98446-9_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98445-2
Online ISBN: 978-3-319-98446-9
eBook Packages: Computer ScienceComputer Science (R0)