Advertisement

Automated Aesthetic Selection of Evolutionary Art by Distance Based Classification of Genomes and Phenomes Using the Universal Similarity Metric

  • Nils Svangård
  • Peter Nordin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3005)

Abstract

In this paper we present a new technique for automatically approximating the aesthetic fitness of evolutionary art. Instead of assigning fitness values to images interactively, we use the Universal Similarity Metric to predict how interesting new images are to the observer based on a library of aesthetic images. In order to approximate the Information Distance, and find the images most similar to the training set, we use a combination of zip-compression, for genomes, and jpeg-compression of the final images. We evaluated the prediction accuracy of our system by letting the user label a new set of images and then compare that to what our system classifies as the most aesthetically pleasing images. Our experiments indicate that the Universal Similarity Metric can successfully be used to classify what images and genomes are aesthetically pleasing, and that it can clearly distinguish between “ugly” and “pretty” images with an accuracy better than the random baseline.

Keywords

Compression Algorithm Information Distance Kolmogorov Complexity Concatenate Phenomes Random Baseline 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dawkins, R.: The Blind Watchmaker, Harlow Logman (1986)Google Scholar
  2. 2.
    Sims, K.: Artificial Evolution for Computer Graphics. In: 1991 ACM SIGGRAPH Proceedings, Computer Graphics, vol. 25(4) (1991)Google Scholar
  3. 3.
    Rooke, S.: Eons of Genetically Evolved Algorithmic Images, Creative Evolutionary Systems, pp. 339–365. Morgan Kaufmann Publishers, San Francisco (2002)Google Scholar
  4. 4.
    Baluja, S., Pomerlau, D., Todd, J.: Towards Automated Artificial Evolution for Computer- Generated Images. Connection Science 6, 325–354 (1994)CrossRefGoogle Scholar
  5. 5.
    Saunders, R., Gero, J.S.: Artificial Creativity: A Synthetic Approach to the Study of Creative Behaviour. In: Gero, J.S. (ed.) Proceedings of the Fifth Conference on Computational and Cognitive Models of Creative Design, Key Centre of Design Com-putting and Cognition (2001)Google Scholar
  6. 6.
    Machado, P., Cardoso, A.: NEvAr − The Assessment of an Evolutionary Art Tool. In: Wiggins, G (Ed.). Proceedings of the AISB00 Symposium on Creative & Cultural Aspects and Applications of AI & Cognitive Science, Birmingham, UK (2000)Google Scholar
  7. 7.
    Machado, P., Cardoso, A.: Computing Aesthetics. In: de Oliveira, F.M. (ed.) SBIA 1998. LNCS (LNAI), vol. 1515, pp. 219–228. Springer, Heidelberg (1998) ISBN 3-540-65190-XCrossRefGoogle Scholar
  8. 8.
    Machado, P., Romero, J.,, Manaris, B.,, Santos, A., Cardoso, A.: Power to the Critics − A Framework for the Development of Artificial Critics. In: Proceedings of 3rd Workshop on Creative Systems, 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), Acapulco, Mexico, pp. 55–64 (2003)Google Scholar
  9. 9.
    Li, M., Badger, J.H., Chen, X., Kwong, S., Kearney, P., Zhang, H.: An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics 17(2), 149–154 (2001)CrossRefGoogle Scholar
  10. 10.
    Li, M., Vitányi, P.: Algorithmic Complexity, International Encyclopedia of the Social & Behavioral Sciences. In: Smelser, N., Baltes, P. (eds.), Pergamon, Oxford, pp. 376–382 ((2001/2002)Google Scholar
  11. 11.
    Li., M., Chen, X., Li, X., Ma, B., Vitányi, P.: The Similarity Metric. In: Proceedings at the 14th ACM-SIAM Symposium on Discrete Algorithms (2003)Google Scholar
  12. 12.
    Li, M., Vitányi, P.: An Introduction To Kolmogorov Complexity and its Applications, 2nd edn. Springer, New York (1997)zbMATHGoogle Scholar
  13. 13.
    Bennet, C., Gács, P., Li, M., Vitányi, P., Zurek, W.: Information Distance. IEEE Transactions on Information Theory 44(4), 1407–1423 (1998)CrossRefGoogle Scholar
  14. 14.
    Riccardo, P., Langdon, W.B.: Submachine-code Genetic Programming, Technical Report CSRP-98-18, University of Birmingham, School of Computer Science (1998)Google Scholar
  15. 15.
    Svangård, N., Nordin, P., Lloyd, S.: Parallel Evolution of Trading Strategies Based on Binary Classification using Sub-Machine-Code Genetic Programming. In: proceedings at the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Nils Svangård
    • 1
  • Peter Nordin
    • 1
  1. 1.Chalmers University of Technology Complex Systems GroupGothenburgSweden

Personalised recommendations