Research Article Open Access

Parallelisation of Algorithms of Mathematical Morphology

Abdallah Boukerram and Samira A.K. Azzou

Abstract

The tools of mathematical morphology developed within the framework of the image processing, require of big capacity of data and the very high costs of execution. So today, the limits of the sequential machines are not to be any more to show, the passage in the new parallel machines of type Simd, Mimd, clusters or grids is imperative. This paper deals with problems related to the parallelisation of the algorithm of mathematical morphology and highlights the resources influencing over the computing time. This study leans on the various levels of parallelisable calculation to evaluate the awaited profits then in term of processing time. An implementation of a whole of algorithms of reference is carried out on a cluster and a simd computer.

Journal of Computer Science
Volume 2 No. 8, 2006, 615-618

DOI: https://doi.org/10.3844/jcssp.2006.615.618

Submitted On: 3 July 2006 Published On: 31 August 2006

How to Cite: Boukerram, A. & Azzou, S. A. (2006). Parallelisation of Algorithms of Mathematical Morphology. Journal of Computer Science, 2(8), 615-618. https://doi.org/10.3844/jcssp.2006.615.618

  • 2,359 Views
  • 2,098 Downloads
  • 1 Citations

Download

Keywords

  • Mathematical morphology
  • parallel algorithms
  • time of processing
  • clusters
  • simd computer