12 citations · 18 across the 9 of their papers we have counts for
9 papers
Logo Generation Using Regional Features: A Faster R-CNN Approach to Generative Adversarial Networks
Aram Ter-Sarkisov, Eduardo Alonso
In this paper we introduce Local Logo Generative Adversarial Network (LL-GAN) that uses regional features extracted from Faster R-CNN for logo generation. We demonstrate the streng…
Network of Steel: Neural Font Style Transfer from Heavy Metal to Corporate Logos
Aram Ter-Sarkisov
We introduce a method for transferring style from the logos of heavy metal bands onto corporate logos using a VGG16 network. We establish the contribution of different layers and l…
Beef Cattle Instance Segmentation Using Fully Convolutional Neural Network
Aram Ter-Sarkisov, Robert Ross, John Kelleher +2
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…
Bootstrapping Labelled Dataset Construction for Cow Tracking and Behavior Analysis
Aram Ter-Sarkisov, Robert Ross, John Kelleher
This paper introduces a new approach to the long-term tracking of an object in a challenging environment. The object is a cow and the environment is an enclosure in a cowshed. Some…
K-Bit-Swap: A New Operator For Real-Coded Evolutionary Algorithms
Aram Ter-Sarkisov, Stephen Marsland
There has been a variety of crossover operators proposed for Real-Coded Genetic Algorithms (RCGAs), which recombine values from the same location in pairs of strings. In this artic…
Elitism Levels Traverse Mechanism For The Derivation of Upper Bounds on Unimodal Functions
Aram Ter-Sarkisov
In this article we present an Elitism Levels Traverse Mechanism that we designed to find bounds on population-based Evolutionary algorithms solving unimodal functions. We prove its…
Derivation of Upper Bounds on Optimization Time of Population-Based Evolutionary Algorithm on a Function with Fitness Plateaus Using Elitism Levels Traverse Mechanism
Aram Ter-Sarkisov, Stephen Marsland
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 t…
Convergence of a Recombination-Based Elitist Evolutionary Algorithm on the Royal Roads Test Function
Aram Ter-Sarkisov, Stephen Marsland
We present an analysis of the performance of an elitist Evolutionary algorithm using a recombination operator known as 1-Bit-Swap on the Royal Roads test function based on a popula…
Convergence Properties of Two (μ + λ) Evolutionary Algorithms On OneMax and Royal Roads Test Functions
Aram Ter-Sarkisov, Stephen Marsland
We present a number of bounds on convergence time for two elitist population-based Evolutionary Algorithms using a recombination operator k-Bit-Swap and a mainstream Randomized Loc…