Aspects of computational mode and data distribution for parallel range image segmentation

Academic Article

Abstract

  • The parallel implementation approaches for image segmentation are applicable to many low-level image understanding algorithms in a variety of parallel architectures. An evaluation of initial data distribution is presented to determine whether a square subimage or a striped subimage distribution would result in the greatest overall reduction in execution time for the given range image segmentation problem. By using the initial data distributions, a technique is introduced for changing the allocation of work to each of the processors to reduce the number of settings. This implementation indicate that quantifiable reductions in execution time result from the proper choice of parallel mode for each portion of the segmentation process.
  • Authors

    Published In

  • Parallel Computing  Journal
  • Digital Object Identifier (doi)

    Author List

  • Giolmas N; Watson DW; Chelberg DM; Henstock PV; Yi JH; Siegel HJ
  • Start Page

  • 499
  • End Page

  • 523
  • Volume

  • 25
  • Issue

  • 5