2009
DOI: 10.1111/j.1365-2818.2009.03200.x
|View full text |Cite
|
Sign up to set email alerts
|

Two methods of random seed generation to avoid over‐segmentation with stochastic watershed: application to nuclear fuel micrographs

Abstract: SummaryA stochastic version of the watershed algorithm is obtained by choosing randomly in the image the seeds from which the watershed regions are grown. The output of the procedure is a probability density function corresponding to the probability that each pixel belongs to a boundary. In the present paper, two stochastic seed-generation processes are explored to avoid over-segmentation. The first is a non-uniform Poisson process, the density of which is optimized on the basis of opening granulometry. The se… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 9 publications
(9 reference statements)
0
3
0
Order By: Relevance
“…The basic idea is that if a number of markers, ideally greater than the number of regions, are placed at random on the image to be segmented, the results will be a combination of true and spurious watershed lines; by repeating the experiment a number of times, true lines will appear far more often than each of the individual spurious lines, thus enabling to determine a probability density function of the watershed lines by averaging the results of the experiments. However, this algorithm still requires the user to determine the number of relevant regions, careful tuning of the distribution used to generate random seeds [45], and does not cope well with leaky region boundaries such as the one depicted in Fig. 9.…”
Section: Classical Watershed Segmentationmentioning
confidence: 99%
“…The basic idea is that if a number of markers, ideally greater than the number of regions, are placed at random on the image to be segmented, the results will be a combination of true and spurious watershed lines; by repeating the experiment a number of times, true lines will appear far more often than each of the individual spurious lines, thus enabling to determine a probability density function of the watershed lines by averaging the results of the experiments. However, this algorithm still requires the user to determine the number of relevant regions, careful tuning of the distribution used to generate random seeds [45], and does not cope well with leaky region boundaries such as the one depicted in Fig. 9.…”
Section: Classical Watershed Segmentationmentioning
confidence: 99%
“…Campbell et al (Ref 33), for instance, used it to differentiate phases in titanium alloys. In order to apply this tool to this particular problem, it is first necessary to perform a distance transform (Ref 34,35) to the complement of the binary image. This transformation assigns to each pixel of a carbide a number that is equal to its distance to the nearest pixel belonging to a different phase.…”
Section: Conversion Of the Mesoscale Micrographs Into Binary Imagesmentioning
confidence: 99%
“…Hence to come up with the final result, the most dominant watershed lines have to be extracted from the intensity map, wherefore several possibilities are proposed in Faessel and Jeulin (2010). Further developments on this segmentation technique are discussed in Cativa Tolosa et al (2009), where the placement of the markers is more specific to avoid an over-segmentation of the data.…”
Section: Stochastic Representationmentioning
confidence: 99%