Title
A Cellular Automaton For Ultra-Fast Watershed Transform On Gpu
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).
Year
DOI
Venue
2008
10.1109/ICPR.2008.4761628
19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6
Keywords
Field
DocType
parallel processing,image segmentation,lattices,shortest path algorithm,cellular automata,automata,watershed transform,cellular automaton,algorithm design and analysis,pixel
Computer vision,Distance measurement,Cellular automaton,Algorithm design,Massively parallel,Computer science,Automaton,Image segmentation,Watershed,Pixel,Artificial intelligence
Conference
ISSN
Citations 
PageRank 
1051-4651
10
0.70
References 
Authors
8
2
Name
Order
Citations
PageRank
Claude Kauffmann1393.84
Nicolas Piche2100.70