A Pipeline Implementation of a Watershed Algorithm on FPGA

The watershed transformation is a popular image segmentation technique for grey scale images. This paper describes a pipeline implementation of a watershed algorithm designed for hardware implementation. In the algorithm, pixels in a given image are repeatedly scanned from top-left to bottom-right, and then from bottom-right to top-left in order to propagate the value of each pixel to its neighbors. In the implementation, w-sets of k-lines are buffered on the FPGA, and the algorithm is repeatedly applied to w-sets, shifting in a new set from the external memory banks and shifting out the oldest set to other external memory banks, w and k can be chosen according to the number of the external memory banks and the size of the FPGA. Therefore, it is possible to realize the best performance on a given hardware platform.

[1]  Tsutomu Maruyama,et al.  Implementation of a Parallel and Pipelined Watershed Algorithm on FPGA , 2006, 2006 International Conference on Field Programmable Logic and Applications.

[2]  Mohamed Akil,et al.  Implementation of a watershed algorithm on FPGAs , 1998, Optics & Photonics.

[3]  Fernand Meyer,et al.  Topographic distance and watershed lines , 1994, Signal Process..

[4]  S. Srinivasan,et al.  Reduced memory implementation of modified serial watershed algorithm based on ordered queue , 2003, Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing.

[5]  Indrajit Chakrabarti,et al.  Flooding-based watershed algorithm and its prototype hardware architecture , 2004 .

[6]  Jing-Yu Yang,et al.  A fast watershed algorithm based on chain code and its application in image segmentation , 2005, Pattern Recognit. Lett..

[7]  Alina N. Moga,et al.  An efficient watershed algorithm based on connected components , 2000, Pattern Recognit..