<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">dt</journal-id><journal-title-group><journal-title xml:lang="ru">Цифровая трансформация</journal-title><trans-title-group xml:lang="en"><trans-title>Digital Transformation</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2522-9613</issn><issn pub-type="epub">2524-2822</issn><publisher><publisher-name>Educational Establishment “Belarusian State University of Informatics and Radioelectronics”</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.38086/2522-9613-2020-2-43-50</article-id><article-id custom-type="elpub" pub-id-type="custom">dt-514</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ТЕХНИЧЕСКИЕ НАУКИ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>TECHNICAL SCIENCES</subject></subj-group></article-categories><title-group><article-title>Использование стеков для сегментации изображений на основе выращивания областей</article-title><trans-title-group xml:lang="en"><trans-title>Using Stacks for Image Segmentation Based on Region Growing</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Цветков</surname><given-names>В. Ю.</given-names></name><name name-style="western" xml:lang="en"><surname>Tsviatkou</surname><given-names>V. Yu.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Доктор технических наук, доцент, заведующий кафедрой инфокоммуникационных технологий.</p><p>Ул. П. Бровки, д. 6, 220013, Минск</p></bio><bio xml:lang="en"><p>Dr. Sc. (Technology), Associate Professor, Head of Department of Infocommunications.</p></bio><email xlink:type="simple">vtsvet@bsuir.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусский государственный университет информатики и радиоэлектроники, УО</institution></aff><aff xml:lang="en"><institution>Belarusian State University of Informatics and Radioelectronics</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2020</year></pub-date><pub-date pub-type="epub"><day>11</day><month>07</month><year>2020</year></pub-date><volume>0</volume><issue>2</issue><fpage>43</fpage><lpage>50</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Цветков В.Ю., 2020</copyright-statement><copyright-year>2020</copyright-year><copyright-holder xml:lang="ru">Цветков В.Ю.</copyright-holder><copyright-holder xml:lang="en">Tsviatkou V.Y.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://dt.bsuir.by/jour/article/view/514">https://dt.bsuir.by/jour/article/view/514</self-uri><abstract/><trans-abstract xml:lang="en"><p>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.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>FIFO-стек</kwd><kwd>LIFO-стек</kwd><kwd>сегментация изображений</kwd><kwd>выращивание областей</kwd><kwd>размер стека</kwd></kwd-group><kwd-group xml:lang="en"><kwd>FIFO stack</kwd><kwd>LIFO stack</kwd><kwd>image segmentation</kwd><kwd>region growing</kwd><kwd>stack size</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Otsu, N. A threshold selection method from gray-level histograms / N. Otsu // IEEE transactions on systems, man, and cybernetics. - 1979. - Vol. 9. - Pp. 62-66.</mixed-citation><mixed-citation xml:lang="en">Otsu N. A threshold selection method from gray-level histograms. IEEE transactions on systems, man, and cybernetics, 1979, vol. 9, pp. 62-66.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Haralick, R.M. Image segmentation techniques / R.M. Haralick, L.G. Shapiro // Computer Vision, Graphics, and Image Processing. - 1985. - Vol. 29 (1). - Pp. 100-132.</mixed-citation><mixed-citation xml:lang="en">Haralick R. M., Shapiro L. G. Image segmentation techniques. Computer Vision, Graphics, and Image Processing, 1985, vol. 29 (1), pp. 100-132.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Horowitz, S.L. Picture segmentation by a tree traversal algorithm / S.L. Horowitz, T. Pavilidis // Journal of the ACM. -1976. - Vol. 23 (2). - Pp. 368-388.</mixed-citation><mixed-citation xml:lang="en">Horowitz S.L., Pavilidis T. Picture segmentation by a tree traversal algorithm. Journal of the ACM, 1976, vol. 23 (2), pp. 368-388.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Meyer, F. Topographic distance and watershed lines / F. Meyer // Signal Processing. - 1994. - Vol. 38 (1). - P. 113-125.</mixed-citation><mixed-citation xml:lang="en">Meyer F. Topographic distance and watershed lines. Signal Processing, 1994, vol. 38 (1), pp. 113-125.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Jain, P.K. An adaptive single seed based region growing algorithm for color image segmentation / P.K. Jain, S. Susan // India Conference (INDICON) 2013. Annual IEEE. - 2013. - Pp. 1-6.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">A Region Growing Vessel Segmentation Algorithm Based on Spectrum Information / H. Jiang [et al.] // Computational and Mathematical Methods in Medicine: Hindawi Publishing Corporation. - 2013. - Pp. 1-9.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Merzougui, M. Region growing segmentation optimized by evolutionary approach and Maximum Entropy / M. Merzougui, A.E. Allaoui // International Workshop on Microwave Engineering, Communications Systems and Technologies (MECST'2019), Leuven, Belgium. - 2019. - P. 1046-1051.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Brass, P. Advanced Data Structures / P. Brass. - New York: Cambridge University Press, 2008. - 456 p.</mixed-citation><mixed-citation xml:lang="en">Brass P. Advanced Data Structures. New York: Cambridge University Press, 2008. 456 p.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Fox, C. Concise Notes on Data Structures and Algorithms / C. Fox. - James Madison University, 2011. - 136 p.</mixed-citation><mixed-citation xml:lang="en">Fox C. Concise Notes on Data Structures and Algorithms. James Madison University, 2011. 136 p.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Goodrich, M.T. Data Structures and Algorithms in Java / M.T. Goodrich, R. Tamassia, M.H. Goldwasser. - Wiley, 2014. - 736 p.</mixed-citation><mixed-citation xml:lang="en">Goodrich M. T., Tamassia R., Goldwasser M. H. Data Structures and Algorithms in Java. Wiley, 2014. 736 p.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
