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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
