Cellular automaton for ultra-fast watershed transform on GPU
19th International Conference on Pattern Recognition, 2008. ICPR 2008. p.1-4
@conference{kauffmann2009cellular,
title={Cellular automaton for ultra-fast watershed transform on GPU},
author={Kauffmann, C. and Piche, N.},
booktitle={Pattern Recognition, 2008. ICPR 2008. 19th International Conference on},
pages={1–4},
issn={1051-4651},
year={2009},
organization={IEEE}
}
In this paper we describe a cellular automaton (CA) used to perform the watershed transform in N-D images. Our method is based on image integration via the Ford-Bellman shortest paths algorithm. Due to the local nature of CA algorithms we show that they are designed to run on massively parallel processors and therefore, be efficiently implemented on low cost consumer graphical processing units (GPUs).
December 27, 2010 by hgpu
