| J.B.T.M. Roerdink and A. Meijster, "The watershed transform: definitions, algorithms and parallelization strategies," Fund. Inf., vol. 41, pp. 187--228, Jan. 2000. |
....in a local minima are treated in the same way, no matter they are on a plateau or not. A difference in the segmentation result is plateaus cannot be segmented in Mangan s algorithm, however they tend to be equally divided into in our algorithm. To exactly divide plateaus, a lower complete image [9] of edge strength has to be computed, which will be addressed in our future work. A flooding algorithm [9] based on FIFO queues is used for minima detection. For each minima, a vertex is stored in an empty FIFO queue followed by a flooding process. The flooding process consists of removing a ....
....segmentation result is plateaus cannot be segmented in Mangan s algorithm, however they tend to be equally divided into in our algorithm. To exactly divide plateaus, a lower complete image [9] of edge strength has to be computed, which will be addressed in our future work. A flooding algorithm [9] based on FIFO queues is used for minima detection. For each minima, a vertex is stored in an empty FIFO queue followed by a flooding process. The flooding process consists of removing a vertex from the queue and inserting into the queue its neighboring vertices with the same edge strength. The ....
J. B. Roerdink and A. Meijster, "The watershed transform: definition, algorithms and parallelization strategies," Fundamental Information, vol. 41, pp. 187--228, 2001.
.... the position of the watershed line is not only a function of the initial position of the markers, the noise amplitude and the edge amplitude, represented by its slope, but also of the order in which pixels are treated during execution, because the watershed transform is not a local concept [22]. For initialization, we introduced the marker pixels in the queue in the usual raster order. This has an effect on the segmentation result, that is small in natural images, but might be evident with images of reduced dynamic range [22] Let be the set of all connected subsets in and let . We ....
....because the watershed transform is not a local concept [22] For initialization, we introduced the marker pixels in the queue in the usual raster order. This has an effect on the segmentation result, that is small in natural images, but might be evident with images of reduced dynamic range [22]. Let be the set of all connected subsets in and let . We define a gray level distance criterion as , where , and represents truncation, so that the queue deals with integer priorities. Let denote a random variable that represents the final position of the watershed line. Due to the complexity ....
J. B. T. M. Roerdink and A. Meijster, "The Watershed Transform: Definitions, Algorithms and Parallelization Techniques," Institute for Mathematics and Computer Science, University of Groningen, Groningen, The Netherlands, IWI 99--9-06, 1999.
No context found.
J.B.T.M. Roerdink and A. Meijster, "The watershed transform: definitions, algorithms and parallelization strategies," Fund. Inf., vol. 41, pp. 187--228, Jan. 2000.
No context found.
J. B. T. M. Roerdink and A. Meijster, "The watershed transform: definitions, algorithms and parallelization strategies," Fundamenta Informaticae, vol. 41, pp. 187--228, 2000.
No context found.
J. Roerdink and A. Meijster, "The watershed transform: Definitions, algorithms and parallelization strategies, " Fundamenta Informaticae 41, pp. 187--228, 2000.
No context found.
J. B. T. M. Roerdink and A. Meijster, "The watershed transform: definitions, algorithms and parallelization strategies," Fundamenta Informaticae, vol. 41, pp. 187--228, 2000.
No context found.
J.B.T.M. Roerdink and A. Meijster, "The Watershed Transform: Definitions, Algorithms and Parallelization Strategies," Fundamenta Informaticae, vol. 41, pp. 187-228, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC