2253

Cellular automaton for ultra-fast watershed transform on GPU

Claude Kauffmann, Nicolas Piche
19th International Conference on Pattern Recognition, 2008. ICPR 2008. p.1-4
BibTeX

Download Download (PDF)   View View   Source Source   

1699

views

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).
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2025 hgpu.org

All rights belong to the respective authors

Contact us:

contact@hpgu.org