Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
Threshold Decomposition of Gray-Scale Morphology into Binary Morphology
IEEE Transactions on Pattern Analysis and Machine Intelligence
Solving nonuniform problems on SIMD computers: case study on region growing
Journal of Parallel and Distributed Computing - Massively parallel computation
Threshold Superposition in Morphological Image Analysis Systems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A Proposal for the Implementation of a Parallel Watershed Algorithm
CAIP '95 Proceedings of the 6th International Conference on Computer Analysis of Images and Patterns
Design and Implementation of a Parallel Image Processor Chip for a SIMD Array Processor
ASAP '95 Proceedings of the IEEE International Conference on Application Specific Array Processors
An efficient watershed segmentation algorithm suitable for parallel implementation
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2
Cellular Logic-in-Memory Arrays
IEEE Transactions on Computers
An efficient immersion-based watershed transform method and its prototype architecture
Journal of Systems Architecture: the EUROMICRO Journal
Reconfigurable Morphological Image Processing Accelerator for Video Object Segmentation
Journal of Signal Processing Systems
| Hi-index | 0.01 |
The watershed transform is a very powerful segmentation tool which comes directly from the idea of watershed line in geohydrology. It has proved its efficiency in many computer vision application fields. This paper presents a new implementation of the watershed which is optimal according to computation time. The flooding algorithm is reminded. Then, a massively parallel cellular automaton is proposed to propagate data using this approach. We discuss the pros and cons of a hardware implementation and give an example of application. A comparison between the results obtained and theoretical limit cases is also presented.