A parallel version for the Propagation Algorithm

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a parallel version for the Propagation Algorithm which belongs to the region growing family of algorithms. The main goal of our implementation is to decrease de Propagation Algorithm execution time in order to allow its use on image interpolation applications. Our solution is oriented to low cost high performance platforms such as clusters of workstations. Four different input data sets represented by pairs of images were chosen in order to carry out experimental tests. The results obtained show that our parallel version of the Propagation Algorithm presents significant speedups. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Castro, M. B., Baldo, L., Fernandes, L. G., Raeder, M., & Velho, P. (2005). A parallel version for the Propagation Algorithm. In Lecture Notes in Computer Science (Vol. 3606, pp. 403–412). Springer Verlag. https://doi.org/10.1007/11535294_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free