Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations
IEEE Transactions on Pattern Analysis and Machine Intelligence
A fast sequential rainfalling watershed segmentation algorithm
ACIVS'05 Proceedings of the 7th international conference on Advanced Concepts for Intelligent Vision Systems
Tracking multiple objects using moving snakes
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Fast and memory efficient 2-D connected components using linked lists of line segments
IEEE Transactions on Image Processing
Segmentation of cell nuclei in arabidopsis thaliana roots
ICIAR'10 Proceedings of the 7th international conference on Image Analysis and Recognition - Volume Part II
| Hi-index | 0.00 |
In this paper we present an overview of our novel line segment based watershed segmentation algorithm. Most of the existing watershed algorithms use the region label image as the main data structure for its ease of use. These type of watershed algorithms have a relatively large memory footprint and need unbounded memory access. For our new watershed algorithm we replaced the traditional region label image with a data structure that stores the regions in linked line segments. Consequently, the new algorithm has a much smaller memory footprint. Using the new data structure also makes it possible to create an efficient algorithm that only needs one scan over the input image and that only needs the last 3 lines and a small part of the data structure in memory.