Goto

Collaborating Authors

 Ter-Sarkisov, Aram


Logo Generation Using Regional Features: A Faster R-CNN Approach to Generative Adversarial Networks

arXiv.org Artificial Intelligence

In this paper we introduce the Local Logo Generative Adversarial Network (LL-GAN) that uses regional features extracted from the Faster Regional Convolutional Neural Network (Faster R-CNN) to generate logos. We demonstrate the strength of this approach by training the framework on a small style-rich dataset collected online to generate large impressive logos. Our approach beats the state-of-the-art models (StyleGAN2, Self-Attention GANs) that suffer from mode collapse due to the size of the data.


Beef Cattle Instance Segmentation Using Fully Convolutional Neural Network

arXiv.org Machine Learning

We present an instance segmentation algorithm trained and applied to a CCTV recording of beef cattle during a winter finishing period. A fully convolutional network was transformed into an instance segmentation network that learns to label each instance of an animal separately. We introduce a conceptually simple framework that the network uses to output a single prediction for every animal. These results are a contribution towards behaviour analysis in winter finishing beef cattle for early detection of animal welfare-related problems.


Derivation of Upper Bounds on Optimization Time of Population-Based Evolutionary Algorithm on a Function with Fitness Plateaus Using Elitism Levels Traverse Mechanism

arXiv.org Artificial Intelligence

In this article a tool for the analysis of population-based EAs is used to derive asymptotic upper bounds on the optimization time of the algorithm solving Royal Roads problem, a test function with plateaus of fitness. In addition to this, limiting distribution of a certain subset of the population is approximated.


Convergence Properties of (μ + λ) Evolutionary Algorithms

AAAI Conferences

Evolutionary Algorithms (EA) are a branch of heuristic population-based optimization tools that is growing in popularity (especially for combinatorial and other problems with poorly understood landscapes). Despite their many uses, there are no proofs that an EA will always converge to the global optimum for any general problem.