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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
De Bock, J., & Philips, W. (2007). Line segment based watershed segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4418 LNCS, pp. 579–586). Springer Verlag. https://doi.org/10.1007/978-3-540-71457-6_53
Mendeley helps you to discover research relevant for your work.