An efficient filling algorithm for counting regions
Related Experiment Video
Updated: Aug 23, 2026

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures
Published on: February 15, 2022
W G M Geraets1, A N van Daatselaar, J G C Verheij
1Academic Center for Dentistry Amsterdam, Radiology Department, Louwesweg 1, 1066 EA Amsterdam, The Netherlands. wgeraets@acta.nl
Abstract:
Region filling has many applications in computer graphics and image analysis. Some region filling tasks can be performed by fast scan line filling algorithms. Other region filling tasks require seed filling algorithms which are more general but slower. This paper introduces a seed filling algorithm that is designed to count regions irrespective of their shape. The method is described and its performance is compared with three alternative algorithms by applying them to a collection of 34 test images. The four methods showed complete agreement with respect to the counted numbers of regions. The proposed method was found to be fastest and requiring least memory.
Related Concept Videos
Area Problem
Double Integrals Over General Regions
Triple Integrals over General Regions
Area Between Curves: Integrating With Respect to x
Iterated Integrals and Fubini's Theorem
Area Between Curves: Problem Solving
