Generating Logos with a Generative Adversarial Neural Network Conditioned on Color
Total Page：16
File Type：pdf, Size：1020Kb
LoGAN: Generating Logos with a Generative Adversarial Neural Network Conditioned on color Ajkel Mino Gerasimos Spanakis Department of Data Science and Knowledge Engineering Department of Data Science and Knowledge Engineering Maastricht University Maastricht University Maastricht, Netherlands Maastricht, Netherlands [email protected] [email protected] Abstract—Designing a logo is a long, complicated, and expen- et al. [6] to be only one to have tackled this problem thus sive process for any designer. However, recent advancements in far. They propose a clustered approach for dealing with multi- generative algorithms provide models that could offer a possible modal data, specifically logos. Logos get assigned synthetic solution. Logos are multi-modal, have very few categorical prop- erties, and do not have a continuous latent space. Yet, conditional labels, defined by the cluster they belong to, and a GAN generative adversarial networks can be used to generate logos is trained, conditioned on these labels. However, synthetic that could help designers in their creative process. We propose labels do not provide enough flexibility. The need for more LoGAN: an improved auxiliary classifier Wasserstein generative descriptive labels arises: labels that could better convey what is adversarial neural network (with gradient penalty) that is able in the logos, and present designers with more detailed selection to generate logos conditioned on twelve different colors. In 768 generated instances (12 classes and 64 logos per class), when criteria. looking at the most prominent color, the conditional generation This paper provides a first step to more expressive and part of the model has an overall precision and recall of 0.8 and 0.7 informative labels instead of synthetic ones, which is achieved respectively. LoGAN’s results offer a first glance at how artificial by defining logos using their most prominent color. Twelve intelligence can be used to assist designers in their creative color classes are introduced: black, blue, brown, cyan, gray, process and open promising future directions, such as including more descriptive labels which will provide a more exhaustive and green, orange, pink, purple, red, white, and yellow. We propose easy-to-use system. LoGAN: an improved Auxiliary Classifier Wasserstein Gen- Index Terms—Conditional Generative Adversarial Neural Net- erative Adversarial Neural Network (with Gradient Penalty) work, Logo generation (AC-WGAN-GP) that is able to generate logos conditioned on the aforementioned twelve colors. I. INTRODUCTION The rest of this paper is structured as follows: In Section Designing a logo is a lengthy process that requires continu- 2 the related work and background will be discussed, then ous collaboration between the designers and their clients. Each in Section 3 the proposed architecture be conveyed, followed drafted logo takes time and effort to be designed, which turns by Section 4, where the dataset and labeling process will this creative process into a tedious and expensive endeavor. be explained. Section 5 presents the experimental results, Recent advancements in generative models suggest a possi- consisting of the training details and results, and finally we ble use of artificial intelligence as a solution to this problem. conclude and discuss some possible extensions of this work Specifically, Generative Adversarial Neural Networks (GANs) in Section 6. [1], which learn how to mimic any distribution of data. They II. BACKGROUND &RELATED WORK consist of two neural networks, a generator and a discrimina- arXiv:1810.10395v1 [cs.CV] 23 Oct 2018 tor, that are contended against each other, trying to reach a First proposed in 2014 by Goodfellow et al. [1], GANs have Nash Equilibrium [2] in a minimax game. seen a rise in popularity during the last couple of years, after possible solutions to training instability and mode collapse Whilst GANs and other generative models have been used were introduced [7]–[9]. to generate almost anything, from MNIST digits [1] to anime faces [3], Mario levels [4] and fake celebrities [5], logo A. Generative Adversarial Networks generation has yet to receive thorough exploration. One pos- GANs (architecture depicted in Fig.1(a)) consist of two sible explanation is that logos do not contain a hierarchy different neural networks, a generator and a discriminator, that of nested segments, which networks can learn and try to are trained simultaneously in a competitive manner. reproduce. Furthermore, their latent space is not continuous, The generator is fed a noise vector (G(z)) from a probability meaning that not every generated logo will necessarily be distribution (p ), and outputs a generated data-point (fake aesthetically pleasing. To the best of our knowledge, Sage, z image). The discriminator takes its input either from the We gratefully acknowledge the support of Mediaan in this research espe- generator (the fake image) (D(G(z))) or from the training cially for providing the necessary computing resources. set (the real image) (D(x)) and is trained to distinguish Fig. 1. GAN, conditional GAN (CGAN) and auxiliary classifier GAN (ACGAN) architectures, where x denotes the real image, c the class label, z the noise vector, G the Generator, and D the Discriminator. between the two. The discriminator and the generator play a C. GAN Applications two-player minimax game with value function (1), where the These different GAN architectures have been used for discriminator tries to maximize V, while the generator tries to numerous purposes, including (but not limited to): higher- minimize it. quality image generation [5], [17], image blending [18], image super-resolution [19] and object detection [20]. Up until the writing of this paper, logo generation has min max V (D; G) = Ex∼pdata [log D(x)] (1) G D previously only been investigated by Sage et al. [6], who + [log(1 − D(G(z)))] Ez∼pz accomplish three main things: 1) Objective functions: While GANs are able to gen- • Define the Large Logo Dataset (LLD) [21] erate high-quality images, they are notoriously difficult to • Synthetically label the logos by clustering them using the train. They suffer from problems like training stability, non- ResNet Classifier network convergence and mode collapse. Multiple improvements have • Build a GAN conditioned on these synthetic labels been suggested to fix these problems [7]–[9]; including using However, as these labels are defined from computer- deep convolutional layers for the networks [10] and modified generated clusters, they do not necessarily provide intuitive objective functions i.e. to least-squares [11] or to Wasserstein classes for a human designer. More descriptive labels, that distance between the distributions [12]–[14]. could provide designers with more detailed selection criteria and better convey what is in the logos are needed. B. Conditionality This paper offers a solution to the previous problem by: Conditional generation with GANs entails using labeled 1) Using twelve colors to define the logo classes data to generate images based on a certain class. The two types 2) Defining LoGAN: An AC-WGAN-GP that can condi- that will be discussed in the subsections below are Conditional tionally generate logos GANs and Auxiliary Classifier GANs. 1) Conditional GANs: In a conditional GAN (CGAN) [15] III. PROPOSED ARCHITECTURE (architecture depicted in Fig.1(b)) the discriminator and the The proposed architecture for LoGAN is an Auxiliary Clas- generator are conditioned on c, which could be a class label sifier Wasserstein Generative Adversarial Neural Network with or some data from another modality. The input and c are gradient penalty (AC-WGAN-GP), depicted on Fig.2. LoGAN combined in a joint hidden representation and fed as an is based on the ACGAN architecture , with the main difference additional input layer in both networks. being that it consists of three neural networks, namely the 2) Auxiliary Classifier GANs: Contrary to CGANs, in Aux- discriminator, the generator and an additional classification iliary Classifier GANs (AC-GAN) [16] (architecture depicted network 1. The latter is responsible for assisting the discrimi- z in Fig.1(c)) the latent space is conditioned on the class label. nator in classifying the logos, as the original classification loss The discriminator is forced to identify fake and real images, as well as the class of the image, irrespective of whether it is 1Code for this paper is available via fake or real. https://github.com/ajki/LoGAN from AC-GAN was dominated by the Wasserstein distance trained once for every 5 iterations of discriminator training, used by the WGAN-GP. as suggested by Gulrajan et al. [14], z was sampled from a Gaussian Distribution [22], and batch normalization was used [23]. IV. DATA The dataset used to train LoGAN is the LLD-icons dataset [21], which consists of 486’377 32 × 32 icons. 1) Labeling: To extract the most prominent color from the image a k-Means algorithm with k = 3 was used to define the RGB values of the centroids. The algorithm makes use of the MiniBatchKMeans implementation from sci-kit learn package, and the package webcolors was used to turn the RGB values into color words. The preliminary colors consisted of X11 color names 2, which were grouped into 12 main classes: black, blue, brown, cyan, gray, green, orange, pink, purple, red, white, and yellow. The class distribution can be observed in Fig.3. Fig. 2. LoGAN architecture, where x denotes the real image, c the class label, z the noise vector, G the Generator, D the Discriminator and Q the Classifier In an original AC-GAN [16] the discriminator is forced to optimize the classification loss together with the real-fake loss. This is shown in equations (2) & (3), which describe the loss from defining the source of the image (training set or generator) and the loss from defining the class of the image respectively. The adversarial aspect of AC-GAN comes as the ACGAN ACGAN discriminator tries to maximize LClass + LSource , whilst ACGAN ACGAN the generator tries to maximize LClass − LSource [16].