DeepMind Open Sources Arnheim, Produce Pictures With Grammatical Brushstrokes

Have you heard about Rudolf Arnheim? Well! Rudolf was born in Germany in 1904 and was an art and film theorist. In 1968, he was invited to join Harvard University as a Professor of the Psychology of Art. His works, such as “Art and Visual Perception: A Psychology of the Creative Eye” (1954) and “Visual Thinking” (1969), investigated art through the lens of science and sensory perception.

As DeepMind explains in its blog, “Our computational creativity work uses computers as tools for generating visual ‘art’ in a way that is inspired by Arnheim’s formalism.” The research lab took to Twitter to introduce Arnheim – a generative algorithm for producing pictures made with grammatical brushstrokes.

To that end, DeepMind offers two Colabs for people to easily invent their own generative architectures and paintings, which includes:


Sign up for your weekly dose of what's up in emerging technology.
  • Arnheim 1: The original algorithm from the paper Generative Art Using Neural Visual Grammars and Dual Encoders running on 1 GPU allows optimization of any image using a genetic algorithm. This is much more general but much slower than using Arnheim 2, which uses gradients.
  • Arnheim 2: A reimplementation of the Arnheim 1 generative architecture in the CLIPDraw framework allowing optimization of its parameters using gradients; much more efficient than Arnheim 1 above but requires differentiating through the image itself.

For those who want to play around with the code to modify how brushstrokes are generated, one can get here.

These two Colabs are examples of how AI can be used to augment human creativity by suggesting possible ways of forming a depiction.

Download our Mobile App

Alva Noë defines art as the process of reorganization of experience, effectively as a kind of visual philosophy. Whilst we are still very far from an algorithmic understanding of this deeply human process, the colabs here show that to some extent, one minor aspect can be understood by synthesis, namely, how decisions are made about which ordered marks to make to produce a depiction efficiently. The team hopes that others will modify these algorithms in fascinating ways.

Support independent technology journalism

Get exclusive, premium content, ads-free experience & more

Rs. 299/month

Subscribe now for a 7-day free trial

More Great AIM Stories

kumar Gandharv
Kumar Gandharv, PGD in English Journalism (IIMC, Delhi), is setting out on a journey as a tech Journalist at AIM. A keen observer of National and IR-related news.

AIM Upcoming Events

Early Bird Passes expire on 3rd Feb

Conference, in-person (Bangalore)
Rising 2023 | Women in Tech Conference
16-17th Mar, 2023

Conference, in-person (Bangalore)
Data Engineering Summit (DES) 2023
27-28th Apr, 2023

3 Ways to Join our Community

Telegram group

Discover special offers, top stories, upcoming events, and more.

Discord Server

Stay Connected with a larger ecosystem of data science and ML Professionals

Subscribe to our Daily newsletter

Get our daily awesome stories & videos in your inbox

All you need to know about Graph Embeddings

Embeddings can be the subgroups of a group, similarly, in graph theory embedding of a graph can be considered as a representation of a graph on a surface, where points of that surface are made up of vertices and arcs are made up of edges