Meyer, F.: Un algorithme optimal de ligne de partage des eaux. In: Actes du 8eme Congres AFCET, Lyon-Villeurbanne, France (1991) 847--859 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Queue-Based Region Growing Algorithm for Accurate.. - Thiran, Warscotte, Macq (1997) (3 citations) (Correct)
....boundaries equidistant from two flooding minima and then labels them as watershed pixels. A final scan of the grey level identifies and labels new minima [10] More recently, optimum processing speed in the computation of this watersheds has been achieved by the use of hierarchical waiting queues [21, 22]. Meyer presented two watershed algorithms in [8] These algorithms are based on a flooding definition of watersheds and a two level ordering relation provided by an ordered queue. These watershed transforms fulfil two constraints imposed by the problem of the brain segmentation in MR images: they ....
F. Meyer, Un algorithme optimal de ligne de partage des eaux, Actes du 8eme Congres AFCET, Lyon-Villeurbanne, France, 1991, pp. 847-859.
The Watershed Transform: Definitions, Algorithms and.. - Roerdink, Meijster (2000) (7 citations) (Correct)
....which is linear in the number of pixels of the image. This can be realized with a data structure called hierarchical or ordered queue (OQ) which is a priority queue of N fifo queues, one queue for each of the N grey values in the image, such that the lower grey values have higher priority [5,24]. The OQ processes lower grey Fundamenta Informaticae 41 (2000) 187 288, IOS Press J.B.T.M. Roerdink and A. Meijster 25 Algorithm 4.7 Scan line algorithm for labelling level components based on disjoint sets. 1: procedure union find ComponentLabelling 2: Input: grey scale image im on digital ....
Meyer, F. Un algorithme optimal de ligne de partage des eaux. In Proceedings 8th Congress AFCET, Lyon-Villeurbane, France (1992), vol. 2, pp. 847-859.
Parallel Image Component Labeling with Watershed Transformation - Moga, Gabbouj (1997) (7 citations) (Correct)
....implementations. 1 This research has been supported by the Graduate School in Electronics, Telecommunication and Automation (GETA) and Edinburgh Parallel Computing Centre in the Training and Research on Advanced Computing Systems (TRACS) programme. 1 Introduction The watershed transformation [7, 13, 21, 22, 23, 33, 34] has been broadly studied in the frame of grayscale image segmentation. The method performs by labeling connected components catchment basins within an image. Watershed transformation has been used in several industrial, biomedical, and computer vision applications (see [5, 6, 17, 23, 31] ....
....data are not uncommon. Although several trials have been previously made to parallelize watersheds (see [25] 29] the task is far from being easy since the operation relies on the history of region growth. Various serial methodologies for computing catchment basins with 0 width watershed lines [7, 13, 21, 22, 23, 33] have been employed for the purpose of parallelization on MIMD computers (see [24] In each parallel approach, the image is distributed to a virtual grid of processors and partial results are produced by any of the watershed labeling techniques referred above. Considering the recursive nature of ....
[Article contains additional citation context not shown here]
F. Meyer. Un algorithme optimal de ligne de partage des eaux. In Proceedings 8 e Congres Reconnaissance des Formes et Intelligence Artificielle, pages 847--857, Lyon, France, November 1991.
Image Segmentation Through Operators Based Upon Topology - Bertrand, Everat, Couprie (1997) (Correct)
....transformation and regularization. Nevertheless, each cell contains a lot of minima. The homotopic and leveling kernels of an image, though simplified, keep all these minima. This over segmentation problem is also crucial when using methods based upon the watershed transformation ( 7] 9] 14] [15]) In this section, we propose a method for detecting significant basins. In a lower kernel, the minima are coming into contact through upper points. We will take advantage of this feature to characterize some non significant regions. Since its upper values have been flattened down, we will ....
F. Meyer, "Un algorithme optimal de ligne de partage des eaux", 8th Conf. Rec. des Formes et Int. Art., Vol. 2, AFCET Ed., Lyon, pp. 847-859 (1992).
Watershed Algorithms and Contrast Preservation - Najman, Couprie (2003) (2 citations) (Correct)
No context found.
Meyer, F.: Un algorithme optimal de ligne de partage des eaux. In: Actes du 8eme Congres AFCET, Lyon-Villeurbanne, France (1991) 847--859
Some Properties of Topological Greyscale Watersheds - Bertrand (2004) (Correct)
No context found.
F. Meyer, "Un algorithme optimal de ligne de partage des eaux," in Actes du 8eme Congres AFCET, pp. 847--859, (Lyon-Villeurbanne, France), 1991.
Watersheds, Extension Maps, and the Emergence Paradigm - Najman, Couprie, Bertrand (2004) (Correct)
No context found.
Meyer, F.: Un algorithme optimal de ligne de partage des eaux. In: Actes du 8eme Congres AFCET, Lyon-Villeurbanne, France (1991) 847--859
Image Segmentation Through Operators Based Upon Topology - Gilles Bertrand.. (1997) (Correct)
No context found.
F. Meyer, "Un algorithme optimal de ligne de partage des eaux", 8th Conf. Rec. des Formes et Int. Art., Vol. 2, AFCET Ed., Lyon, pp. 847-859 (1992).
Topological Grayscale Watershed Transformation - Michel Couprie And (1997) (1 citation) (Correct)
No context found.
F. Meyer, "Un algorithme optimal de ligne de partage des eaux", 8th Conf. Reconnaissance des Formes et Intelligence Artificielle, Vol. 2, pp. 847-859, AFCET Ed., Lyon, 1992.
The Watershed Transform: Definitions, Algorithms and.. - Roerdink, Meijster (2001) (7 citations) (Correct)
No context found.
Meyer, F. Un algorithme optimal de ligne de partage des eaux. In Proceedings 8th Congress AFCET, Lyon-Villeurbane, France (1992), vol. 2, pp. 847--859.
Topological Grayscale Watershed Transformation - Couprie, Bertrand (1997) (1 citation) (Correct)
No context found.
F. Meyer, "Un algorithme optimal de ligne de partage des eaux", 8th Conf. Reconnaissance des Formes et Intelligence Artificielle, Vol. 2, pp. 847-859, AFCET Ed., Lyon, 1992.
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