DeepAI AI Chat
Log In Sign Up

Quasi-random Agents for Image Transition and Animation

by   Aneta Neumann, et al.

Quasi-random walks show similar features as standard random walks, but with much less randomness. We utilize this established model from discrete mathematics and show how agents carrying out quasi-random walks can be used for image transition and animation. The key idea is to generalize the notion of quasi-random walks and let a set of autonomous agents perform quasi-random walks painting an image. Each agent has one particular target image that they paint when following a sequence of directions for their quasi-random walk. The sequence can easily be chosen by an artist and allows them to produce a wide range of different transition patterns and animations.


page 5

page 6

page 7

page 8

page 9


Evolutionary Image Transition and Painting Using Random Walks

We present a study demonstrating how random walk algorithms can be used ...

Meeting Times of Non-atomic Random Walks

In this paper, we revisit the problem of classical meeting times of rand...

Quasi-Dilemmas for Artificial Moral Agents

In this paper we describe moral quasi-dilemmas (MQDs): situations simila...

Random Walks: A Review of Algorithms and Applications

A random walk is known as a random process which describes a path includ...

Robotic Surveillance Based on the Meeting Time of Random Walks

This paper analyzes the meeting time between a pair of pursuer and evade...

On the Search Efficiency of Parallel Lévy Walks on Z^2

Lévy walk is a popular movement model where an agent repeatedly samples ...

The Pendulum Arrangement: Maximizing the Escape Time of Heterogeneous Random Walks

We identify a fundamental phenomenon of heterogeneous one dimensional ra...