论文信息 - Evolution of Pixel Level Snakes towards an efficient hardware implementation

Evolution of Pixel Level Snakes towards an efficient hardware implementation

Since pixel level snakes (PLS) were introduced, several algorithms implementing this cellular active contour technique have been proposed. In this paper, we review the main features of these algorithms and propose some modifications to optimize the computation performance of PLS when they are executed on fine-grain pixel-parallel processor arrays. The modified algorithm has been implemented on a focal plane cellular processor array (SCAMP-3 vision chip) and tested on several applications of practical interest.

Piotr Dudek | David López Vilariño

[1] Csaba Rekeczky,et al. Shortest Path Problem with Pixel Level Snakes : Application to Robot Path Planning , 2004 .

[2] Csaba Rekeczky,et al. Pixel‐level snakes on the CNNUM: algorithm design, on‐chip implementation and applications , 2005, Int. J. Circuit Theory Appl..

[3] P. Dudek,et al. A Cellular Active Contours Algorithm Based on Region Evolution , 2006, 2006 10th International Workshop on Cellular Neural Networks and Their Applications.

[4] Xose Manuel Pardo,et al. Cellular neural networks and active contours: a tool for image segmentation , 2003, Image Vis. Comput..

[5] P. Dudek,et al. SIMD processor array with integrated image sensor , 2000 .

[6] Piotr Dudek,et al. General-purpose 128×128 SIMD processor array with integrated image sensor , 2006 .