𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient watershed algorithm based on connected components

✍ Scribed by A. Bieniek; A. Moga

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
644 KB
Volume
33
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, a formal de"nition and a new algorithmic technique for the watershed transformation is presented. The novelty of the approach is to adapt the connected component operator to solve the watershed segmentation problem. The resulting algorithm is independent of the number of grey-levels, employs simple data structures, requires less error prone memory management, and issues a lower complexity and a short running time. However, the algorithm does not modify the principle of the watershed segmentation; the output result is the same as that of using any traditional algorithm which does not build watershed lines.

πŸ“œ SIMILAR VOLUMES

Algorithms for connected component label
Algorithms for connected component labeling based on quadtrees
✍ Kunio Aizawa; Shojiro Tanaka; Koyo Motomura; Ryosuke Kadowaki πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 346 KB

## Abstract An algorithm of linear time complexity is presented to label connected components of a binary image by a quadtree. For a given node, the search for all adjacent nodes is carried out in __O__(1) (i.e., constant time complexity for the worst case) using our formerly presented algorithm in

An efficient algorithm for multistate pr
An efficient algorithm for multistate protein design based on FASTER
✍ Benjamin D. Allen; Stephen L. Mayo πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 326 KB

## Abstract Most of the methods that have been developed for computational protein design involve the selection of side‐chain conformations in the context of a single, fixed main‐chain structure. In contrast, multistate design (MSD) methods allow sequence selection to be driven by the energetic con