Distributed Connected Component Filtering and Analysis in 2-D and 3-D Tera-Scale Data Sets

Simon Gazagnes*, Michael H. F. Wilkinson

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
26 Downloads (Pure)

Abstract

Connected filters and multi-scale tools are region-based operators acting on the connected components of an image. Component trees are image representations to efficiently perform these operations as they represent the inclusion relationship of the connected components hierarchically. This paper presents disccofan (DIStributed Connected COmponent Filtering and ANalysis), a new method that extends the previous 2-D implementation of the Distributed Component Forests (DCFs) to handle 3-D processing and higher dynamic range data sets. disccofan combines shared and distributed memory techniques to efficiently compute component trees, user-defined attributes filters, and multi-scale analysis. Compared to similar methods, disccofan is faster and scales better on low and moderate dynamic range images, and is the only method with a speed-up larger than 1 on a realistic, astronomical floating-point data set. It achieves a speed-up of 11.20 using 48 processes to compute the DCF of a 162 Gigapixels, single-precision floating-point 3-D data set, while reducing the memory used by a factor of 22. This approach is suitable to perform attribute filtering and multi-scale analysis on very large 2-D and 3-D data sets, up to single-precision floating-point value.
Original languageEnglish
Pages (from-to)3664-3675
Number of pages12
JournalIeee transactions on image processing
Volume30
Early online date11-Mar-2021
DOIs
Publication statusPublished - 2021

Keywords

  • MATHEMATICAL MORPHOLOGY
  • component trees
  • Connected filters
  • hierarchical image representation
  • multi-scale representation
  • multithreading
  • MPI
  • high-performance computing

Cite this