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.
This work was developed in collaboration with HP Brazil R&D.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Seitz, S., Dyer, C.: Physically-Valid View Synthesis by Image Interpolation. In: Proceedings of the International Workshop on Representations of Visual Scenes, Cambridge, Massachussets, USA, pp. 26–33 (1995)
Lhuillier, M., Quan, L.: Image Interpolation by Joint View Triangulation. In: Proceedings of the International Conference on Computer Vision and Pattern Recognition, Fort Collins, Colorado, USA, pp. 139–145 (1999)
Lhuillier, M., Quan, L.: Robust Dense Matching using Local and Global Geometric Constraints. In: Proceedings of the 15th International Conference on Pattern Recognition, pp. 968–972 (2000)
Snir, M., Otto, S., Huss-Lederman, S., Walker, D., Dongarra, J.: MPI: The complete reference. MIT Press, Cambridge (1996)
Alnuweiri, H., Prasanna, V.: Parallel architectures and algorithms for image component labeling. IEEE Trans. Patt. Anal. Machine Intell. 14, 1014–1034 (1992)
Horowitz, S., Pavlidis, T.: Picture segmentation by a directed split-and-merge procedure. In: Proceedings of the 2nd International Joint Conference on Pattern Recognition, pp. 424–433 (1974)
Tilton, J.: Image segmentation by iterative parallel region growing with applications to data compression and image analysis. In: Proceedings of the 2nd Symposium on the Frontiers of Massively Parallel Computation, pp. 357–360 (1988)
Willebeck-LeMair, M., Reeves, A.: Solving non-uniform problems on simd computers: case study on region growing. Journal of Paralle and Distributed Computing 8, 135–149 (1990)
Jájá, J., Bader, D., Harwood, D., Davis, L.: Parallel algorithms for image enhancement and segmentation by region growing with an experimental study. Technical report, Institute for Advanced Computer Studies, University of Maryland (1995)
Schimid, C., Mohr, R., Bauckhage, C.: Comparing and Evaluating Interest Points. In: Proceedings of the 6th International Conference on Computer Vision, Bombay, India, pp. 230–235 (1998)
Monga, O.: An Optimal Region Growing Algorithm for Image Segmentation. International Journal of Pattern Recognition and Artificial Intelligence 1, 351–375 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castro, M.B., Baldo, L., Fernandes, L.G., Raeder, M., Velho, P. (2005). A Parallel Version for the Propagation Algorithm. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_35
Download citation
DOI: https://doi.org/10.1007/11535294_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28126-9
Online ISBN: 978-3-540-31826-2
eBook Packages: Computer ScienceComputer Science (R0)