Connected morphological attribute filters on distributed memory parallel machines

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

Abstract

We present a new algorithm for attribute filtering of extremely large images, using a forest of modified max-trees, suitable for distributed memory parallel machines. First, max-trees of tiles of the image are computed, after which messages are exchanged to modify the topology of the trees and update attribute data, such that filtering the modified trees on each tile gives exactly the same results as filtering a regular max-tree of the entire image. On a cluster, a speed-up of up to 53× is obtained on 64, and up to 100× on 128 single CPU nodes. On a shared memory machine a peak speed-up of 50× on 64 cores was obtained.

Cite

CITATION STYLE

APA

Kazemier, J. J., Ouzounis, G. K., & Wilkinson, M. H. F. (2017). Connected morphological attribute filters on distributed memory parallel machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10225 LNCS, pp. 357–368). Springer Verlag. https://doi.org/10.1007/978-3-319-57240-6_29

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