Microscope Image Processing

2. Propagation

while HFQ is not empty:

p <- outHFQ

for each non-labeled q neighbor of p:

L(q) <- L(p)

inHFQ(q, f(q))

In this function, the hierarchical FIFO queue (HFQ) has the following

operations: inHFQ( p, n)—insert pixel p with priority n; outHFQ—remove the

pixel with the lowest priority, with the FIFO policy for pixels at the same

priority. This FIFO policy implements intrinsically the second component of

the lexicographic cost of Eq. 8.24.

Two points are worth mentioning in the formulation of the catchment basins

given in Eq. 8.25. First, watershed lines are not defined by this algorithm. Second,

many optimal solutions are possible. This is because ...