Segmentation of Macrophages on a Quadtree Grid Using the p4est Library

Abstract The paper proposes the numerical schemes applied in the macrophage segmentation process on a quadtree grid, generated adaptively with respect to intensity of the data. Because the data are sparse and, in general, distinctly rectangular images, to generate the mesh the library ‘p4est’ (parallel forest) has been selected. The library offers tools to connect multiple trees into a ‘forest’ (‘4est’), enabling parallel processing (‘p4est’). The segmentation methods used canbe solvedwith PDEs commonly used in image processing, the linear heat equation and the modified SUBSURF model, for which we proposed explicit and semi-implicit schemes based on the finite volume space discretisation. The choice of numerical algorithms is adapted to the way the grid elements are iterated in the environment of the library. In this paper we focus on a single quadtree. From the numerical point of view, the extension to the forest is straightforward. Description of the library’s principles with respect to the grid generation, its elements iteration, refining, coarsening and balancing the grid with the help of so-called callback functions and parallelism can be found in more detail, e.g., in [7], [8].

Authors

Institutions

Publication Details

Journal
Tatra Mountains Mathematical Publications
Published
2025-10-13
DOI
https://doi.org/10.2478/tmmp-2025-0019
Primary Topic
Machine Learning in Bioinformatics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Segmentation of Macrophages on a Quadtree Grid Using the p4est Library

Zuzana Krivá
Tatra Mountains Mathematical Publications
Machine Learning in Bioinformatics
article

Segmentation of Macrophages on a Quadtree Grid Using the p4est Library

Zuzana Krivá
article en

Abstract

Abstract The paper proposes the numerical schemes applied in the macrophage segmentation process on a quadtree grid, generated adaptively with respect to intensity of the data. Because the data are sparse and, in general, distinctly rectangular images, to generate the mesh the library ‘p4est’ (parallel forest) has been selected. The library offers tools to connect multiple trees into a ‘forest’ (‘4est’), enabling parallel processing (‘p4est’). The segmentation methods used canbe solvedwith PDEs commonly used in image processing, the linear heat equation and the modified SUBSURF model, for which we proposed explicit and semi-implicit schemes based on the finite volume space discretisation. The choice of numerical algorithms is adapted to the way the grid elements are iterated in the environment of the library. In this paper we focus on a single quadtree. From the numerical point of view, the extension to the forest is straightforward. Description of the library’s principles with respect to the grid generation, its elements iteration, refining, coarsening and balancing the grid with the help of so-called callback functions and parallelism can be found in more detail, e.g., in [7], [8].

Tatra Mountains Mathematical PublicationsVol. 91(3)
Slovak University of Technology in Bratislava (SK)
Openalex Percentile: Top 74%
Machine Learning in Bioinformatics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.