The watershed transformation of gray-scale images is described in terms of graph theory. An algorithm of watershed segmentation is proposed. This algorithm uses ordered queues to find the shortest path between image pixels and to segment image objects.
展开▼