Cellular automaton for ultra-fast watershed transform on GPU

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).

• Type: Conference
• Year: 2008
• Where: ICPR
• Authors: Claude Kauffmann, Nicolas Piche
• Keywords: Cellular Automaton, Computer Vision, Ford-Bellman Shortest Paths, ICPR 2008, Low Cost Consumer