Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic watershed segmentation of randomly textured color images
IEEE Transactions on Image Processing
Hybrid image segmentation using watersheds and fast region merging
IEEE Transactions on Image Processing
An improved watershed algorithm based on efficient computation of shortest paths
Pattern Recognition
EURASIP Journal on Embedded Systems - Special issue on design and architectures for signal and image processing
Fast segmentation of bone in CT images using 3D adaptive thresholding
Computers in Biology and Medicine
Fast, parallel watershed algorithm based on path tracing
ICCVG'10 Proceedings of the 2010 international conference on Computer vision and graphics: Part II
An improved fast watershed algorithm for image segmentation
International Journal of Computational Vision and Robotics
Building programming abstractions for wireless sensor networks using watershed segmentation
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Deriving implicit indoor scene structure with path analysis
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness
A faster graph-based segmentation algorithm with statistical region merge
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
Parallel computing of catchment basins in large digital elevation model
HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
Hi-index | 0.11 |
In this paper, a novel algorithm is proposed for the watershed transformation. This new algorithm is based on chain code. The traditional concept of chain code is first expanded into point-out chain code and point-in chain code. Then two theorems, which depict how to make watershed transformation based on chain code, are proposed and proved. In the end, the description of this new algorithm is presented, and its complexity is discussed in detail. Experiments show that the presented algorithm runs fast. Further more, the new algorithm can provide more information to the following image processing.