Morphological segmentation on the programmable retina: towards mixed synchronous/asynchronous algorithms

Abstract. We present a new algorithm to compute the watershed transform on a massively parallel machine. Logic minimization, together with a novel approach to the notion of dynam-ics, allow the implementation of the watershed algorithm on a cellular automata grid, such as the programmable retina. We then investigate the prot acquired from computing some parts of the algorithm in an asynchronous way, in terms of time and energy consumption