Parallel Image Component Labeling With Watershed Transformation

  • Authors:
  • Alina N. Moga;Moncef Gabbouj

  • Affiliations:
  • Tampere Univ. of Technology, Tampere, Finland;Tampere Univ. of Technology, Tampere, Finland

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Year:
  • 1997

Quantified Score

Hi-index 0.15

Visualization

Abstract

The parallel watershed transformation used in gray scale image segmentation is reconsidered in this paper on the basis of the component labeling problem. The main idea is to break the sequentiality of the watershed transformation and to correctly delimit the extent of all connected components locally, on each processor, simultaneously. The internal fragmentation of the catchment basins, due to domain decomposition, into smaller subcomponents is ulteriorly solved by employing a global connected components operator. Therefore, in a pyramidal structure of master-slave processors, internal contours of adjacent subcomponents within the same component are hierarchically removed. Global final connected areas are efficiently obtained in log2N steps on a logical grid of N processors. Timings and segmentation results of the algorithm built on top of the Message Passing Interface (MPI) and tested on the Cray T3D are brought forward to justify the superiority of the novel design solution compared against previous implementations.