A cellular active contours algorithm based on region evolution

This paper introduces a new algorithm for implementing cellular active contour technique based on pixel-level snakes (PLS). The main motivation is the optimization of the computational performance, especially when PLS are implemented on pixel-parallel single instruction multiple data (MID) processor arrays. The algorithm is based on the evolution of an active region. This allows the implementation of the entire algorithm using very simple local rules. Additionally, nested contours and propagation into narrow cavities are supported. The algorithm and experimental results from real-time implementation on vision chips are presented.