Vesicle computers: Approximating Voronoi diagram on Voronoi automata

Irregular arrangements of vesicles filled with excitable and precipitating chemical systems are imitated by Voronoi automata --- finite-state machines defined on a planar Voronoi diagram. Every Voronoi cell takes four states: resting, excited, refractory and precipitate. A resting cell excites if it has at least one excited neighbour; the cell precipitates if a ratio of excited cells in its neighbourhood to its number of neighbours exceed certain threshold. To approximate a Voronoi diagram on Voronoi automata we project a planar set onto automaton lattice, thus cells corresponding to data-points are excited. Excitation waves propagate across the Voronoi automaton, interact with each other and form precipitate in result of the interaction. Configuration of precipitate represents edges of approximated Voronoi diagram. We discover relation between quality of Voronoi diagram approximation and precipitation threshold, and demonstrate feasibility of our model in approximation Voronoi diagram of arbitrary-shaped objects and a skeleton of a planar shape.Comment: Chaos, Solitons & Fractals (2011), in pres

Visual identification by signature tracking

We propose a new camera-based biometric: visual signature identification. We discuss the importance of the parameterization of the signatures in order to achieve good classification results, independently of variations in the position of the camera with respect to the writing surface. We show that affine arc-length parameterization performs better than conventional time and Euclidean arc-length ones. We find that the system verification performance is better than 4 percent error on skilled forgeries and 1 percent error on random forgeries, and that its recognition performance is better than 1 percent error rate, comparable to the best camera-based biometrics