A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Split-and-merge image segmentation based on localized feature analysis and statistical tests
CVGIP: Graphical Models and Image Processing
Topographic distance and watershed lines
Signal Processing - Special issue on mathematical morphology and its applications to signal processing
The watershed transform: definitions, algorithms and parallelization strategies
Fundamenta Informaticae - Special issue on mathematical morphology
A massively parallel implementation of the watershed based on cellular automata
ASAP '97 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
An improved watershed algorithm for counting objects in noisy, anisotropic 3-D biological images
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 3)-Volume 3 - Volume 3
Unsupervised video segmentation based on watersheds and temporal tracking
IEEE Transactions on Circuits and Systems for Video Technology
Four-Color Theorem and Level Set Methods for Watershed Segmentation
International Journal of Computer Vision
EURASIP Journal on Embedded Systems - Special issue on design and architectures for signal and image processing
Fast, parallel watershed algorithm based on path tracing
ICCVG'10 Proceedings of the 2010 international conference on Computer vision and graphics: Part II
| Hi-index | 0.00 |
This paper describes an improved immersion-based watershed algorithm to compute the watershed lines for segmentation of digital gray scale images and its hardware implementation. The proposed algorithm is devoid of certain disadvantages inherent in a conventional immersion-based algorithm originally proposed by Vincent and Soille. Flooding of catchment basins from pre-determined regional minima and conditional neighborhood comparisons while processing the eight neighboring pixels of a labeled center pixel ensures thin continuous watershed lines. Reduced computational complexity and increased throughput compared to the conventional algorithm occurs from simultaneous determination of labels of various neighboring pixels. The complexity of the proposed algorithm is analyzed. The results of running both the proposed and the conventional algorithm on different test images clearly establish the superiority of the proposed algorithm. A prototype architecture designed to implement the proposed watershed algorithm has been modelled in VHDL and synthesized for Virtex FPGA. The FPGA implementation results show acceptable performance of the proposed architecture.