DocumentCode :
2485564
Title :
Cellular automaton for ultra-fast watershed transform on GPU
Author :
Kauffmann, Claude ; Piche, Nicolas
fYear :
2008
fDate :
8-11 Dec. 2008
Firstpage :
1
Lastpage :
4
Abstract :
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).
Keywords :
cellular automata; computer graphic equipment; image segmentation; parallel processing; transforms; Ford-Bellman shortest paths algorithm; GPU; N-D images; cellular automaton; graphical processing units; image integration; parallel processors; ultra-fast watershed transform; Algorithm design and analysis; Automata; Concurrent computing; Costs; Geography; Hospitals; Image segmentation; Labeling; Partitioning algorithms; Pixel;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pattern Recognition, 2008. ICPR 2008. 19th International Conference on
Conference_Location :
Tampa, FL
ISSN :
1051-4651
Print_ISBN :
978-1-4244-2174-9
Electronic_ISBN :
1051-4651
Type :
conf
DOI :
10.1109/ICPR.2008.4761628
Filename :
4761628
Link To Document :
بازگشت