Evolutionary Image Transition and Painting Using Random Walks

03/02/2020
by   Aneta Neumann, et al.
4

We present a study demonstrating how random walk algorithms can be used for evolutionary image transition. We design different mutation operators based on uniform and biased random walks and study how their combination with a baseline mutation operator can lead to interesting image transition processes in terms of visual effects and artistic features. Using feature-based analysis we investigate the evolutionary image transition behaviour with respect to different features and evaluate the images constructed during the image transition process. Afterwards, we investigate how modifications of our biased random walk approaches can be used for evolutionary image painting. We introduce an evolutionary image painting approach whose underlying biased random walk can be controlled by a parameter influencing the bias of the random walk and thereby creating different artistic painting effects.

READ FULL TEXT

page 11

page 13

page 14

page 20

page 23

page 24

page 33

page 34

research
04/21/2016

Evolutionary Image Transition Based on Theoretical Insights of Random Processes

Evolutionary algorithms have been widely studied from a theoretical pers...
research
10/20/2017

Quasi-random Agents for Image Transition and Animation

Quasi-random walks show similar features as standard random walks, but w...
research
07/14/2018

Stochastic Stability in Schelling's Segregation Model with Markovian Asynchronous Update

We investigate the dependence of steady-state properties of Schelling's ...
research
10/04/2020

"Drunk Man" Saves Our Lives: Route Planning by a Biased Random Walk Mode

Based on the hurricane striking Puerto Rico in 2017, we developed a tran...
research
10/16/2012

Variational Dual-Tree Framework for Large-Scale Transition Matrix Approximation

In recent years, non-parametric methods utilizing random walks on graphs...
research
12/20/2022

Strong uniform convergence of Laplacians of random geometric and directed kNN graphs on compact manifolds

Consider n points independently sampled from a density p of class 𝒞^2 on...
research
05/22/2019

Heavy Hitters and Bernoulli Convolutions

A very simple event frequency approximation algorithm that is sensitive ...

Please sign up or login with your details

Forgot password? Click here to reset