Using Stacks for Image Segmentation Based on Region Growing
https://doi.org/10.38086/2522-9613-2020-2-43-50
Abstract
The aim of the work is to comparatively evaluate the sizes of FIFO and LIFO stacks required for image segmentation based on growing regions. The coordinates (y, x) of the pixels that need to be attached to the cultivated area are placed in stacks during the segmentation process. The size of the stack needed to store the coordinates depends on the structure of the image and cannot be determined before segmentation. To avoid stack overflow, its size is determined for maximum load conditions when the image contains a single maximum area. In this case, the stack size is equal to the image size. This approach does not take into account the process of stack unloading and leads to memory overrun. Expressions are obtained in the paper that allow one to increase the accuracy of determining the sizes of FIFO and LIFO stacks necessary for storing the coordinates of adjacent pixels in a segmentation algorithm based on growing regions under maximum load conditions. In this case, the initial position of the region growth point and the direction of the selection of adjacent pixels in the scanning window are taken into account. A comparative assessment of the stack sizes required for image segmentation showed that using the FIFO stack is preferable to the LIFO stack and leads to significant memory savings.
About the Author
V. Yu. TsviatkouBelarus
Dr. Sc. (Technology), Associate Professor, Head of Department of Infocommunications.
6 P. Brovka Str., 220013 MinskReferences
1. Otsu N. A threshold selection method from gray-level histograms. IEEE transactions on systems, man, and cybernetics, 1979, vol. 9, pp. 62-66.
2. Haralick R. M., Shapiro L. G. Image segmentation techniques. Computer Vision, Graphics, and Image Processing, 1985, vol. 29 (1), pp. 100-132.
3. Horowitz S.L., Pavilidis T. Picture segmentation by a tree traversal algorithm. Journal of the ACM, 1976, vol. 23 (2), pp. 368-388.
4. Meyer F. Topographic distance and watershed lines. Signal Processing, 1994, vol. 38 (1), pp. 113-125.
5. Jain P. K., Susan S. An adaptive single seed based region growing algorithm for color image segmentation. India Conference (INDICON) 2013. Annual IEEE, pp. 1-6.
6. Jiang H. [et al.]. A Region Growing Vessel Segmentation Algorithm Based on Spectrum Information. Computational and Mathematical Methods in Medicine: Hindawi Publishing Corporation, 2013, pp. 1-9.
7. Merzougui M., Allaoui A.E. Region growing segmentation optimized by evolutionary approach and Maximum Entropy. International Workshop on Microwave Engineering, Communications Systems and Technologies (MECST'2019), Leuven, Belgium, 2019, pp. 1046-1051.
8. Brass P. Advanced Data Structures. New York: Cambridge University Press, 2008. 456 p.
9. Fox C. Concise Notes on Data Structures and Algorithms. James Madison University, 2011. 136 p.
10. Goodrich M. T., Tamassia R., Goldwasser M. H. Data Structures and Algorithms in Java. Wiley, 2014. 736 p.
Review
For citations:
Tsviatkou V.Yu. Using Stacks for Image Segmentation Based on Region Growing. Digital Transformation. 2020;(2):43-50. (In Russ.) https://doi.org/10.38086/2522-9613-2020-2-43-50