Affordable Access

Further Optimized Parallel Algorithm of Watershed Segmentation Based on Boundary Components Graph

IFIP Lecture Notes in Computer Science (LNCS)
Publication Date
  • Computer Science
  • Mathematics


is a classical method for image segmentation in gray scale mathematical morphology. Nevertheless watershed algorithm has strong recursive nature, so straightforward parallel one has a very low efficiency. Firstly, the advantages and disadvantages of some existing parallel algorithms are analyzed. Then, a (FOPWA) is presented based on boundary components graph. As the experiments show, FOPWA optimizes both running time and relative speedup, and has more flexibility.Full Text at Springer, may require registration or fee

There are no comments yet on this publication. Be the first to share your thoughts.