<?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">sapi</journal-id><journal-title-group><journal-title xml:lang="ru">Системный анализ и прикладная информатика</journal-title><trans-title-group xml:lang="en"><trans-title>«System analysis and applied information science»</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2309-4923</issn><issn pub-type="epub">2414-0481</issn><publisher><publisher-name>Belarusian National Technical University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.21122/2309-4923-2019-3-59-63</article-id><article-id custom-type="elpub" pub-id-type="custom">sapi-378</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>Data processing and decision–making</subject></subj-group></article-categories><title-group><article-title>Определение размера FIFO-стека для алгоритма выращивания областей изображения</article-title><trans-title-group xml:lang="en"><trans-title>Determination of the FIFO-stack size for the algorithm of the image 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></bio><bio xml:lang="en"><p>Doctor of Engineering, 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><country>Беларусь</country></aff><aff xml:lang="en"><institution>Belarusian State University of Informatics and Radioelectronics</institution><country>Belarus</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2019</year></pub-date><pub-date pub-type="epub"><day>12</day><month>12</month><year>2019</year></pub-date><volume>0</volume><issue>3</issue><fpage>59</fpage><lpage>63</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Цветков В.Ю., 2019</copyright-statement><copyright-year>2019</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://sapi.bntu.by/jour/article/view/378">https://sapi.bntu.by/jour/article/view/378</self-uri><abstract><p>Целью работы является вывод выражения, позволяющего определить размер FIFO-стека для хранения координат смежных пикселей в зависимости от размера изображения для алгоритма сегментации на основе выращивания областей. Рассматривается FIFO-стек, организованный по принципу кольцевого многоразрядного регистра сдвига. Сформулированы условия максимальной загрузки FIFO-стека, для которых получено выражение, позволяющее точно определить необходимый размер FIFO-стека, что обеспечивает экономию памяти.</p></abstract><trans-abstract xml:lang="en"><p>The aim of the work is to derive an expression that allows determining the size of the FIFO-stack for storing the coordinates of adjacent pixels depending on the image size for the segmentation algorithm based on region growing. The FIFO stack, organized on the principle of a ring multi-bit shift register, is considered. The conditions for maximum loading of the FIFO stack are formulated, for which an expression is obtained that allows one to accurately determine the required size of the FIFO stack, which provides memory savings.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>FIFO-стек</kwd><kwd>сегментация изображений</kwd><kwd>выращивание областей изображения</kwd></kwd-group><kwd-group xml:lang="en"><kwd>FIFO-stack</kwd><kwd>image segmentation</kwd><kwd>region growing</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">Kaur, N. Analysis and comprehensive study: image segmentation techniques / N. Kaur, J. Singh, V. Sharma // International Journal for Research in Applied Science &amp; Engineering Technology (IJRASET). – 2015. –Vol. 3. – P. 241–246.</mixed-citation><mixed-citation xml:lang="en">Kaur, N. Analysis and comprehensive study: image segmentation techniques / N. Kaur, J. Singh, V. Sharma // International Journal for Research in Applied Science &amp; Engineering Technology (IJRASET). – 2015. –Vol. 3. – P. 241–246.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Moigne, J. L. Refining image segmentation by integration of edge and region data / J. L. Moigne, J. C. Tilton // IEEE transactions on geoscience and remote sensing. – May 1995. – Vol. 33, № 3. – P. 605–614.</mixed-citation><mixed-citation xml:lang="en">Moigne, J. L. Refining image segmentation by integration of edge and region data / J. L. Moigne, J. C. Tilton // IEEE transactions on geoscience and remote sensing. – May 1995. – Vol. 33, № 3. – P. 605–614.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Vasundhara, Ku. Study of Region Base Segmentation Method / Ku. Vasundhara, H. Lokhande // International Journal of Advanced Research in Computer Science and Software Engineering. – 2014. – Vol. 4. – P. 197–200.</mixed-citation><mixed-citation xml:lang="en">Vasundhara, Ku. Study of Region Base Segmentation Method / Ku. Vasundhara, H. Lokhande // International Journal of Advanced Research in Computer Science and Software Engineering. – 2014. – Vol. 4. – P. 197–200.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Kamdi, S. Image Segmentation and Region Growing Algorithm / S. Kamdi, R. K. Krishna // International Journal of Computer Technology and Electronics Engineering (IJCTEE). – February 2012. – Vol. 2. – P. 103–107.</mixed-citation><mixed-citation xml:lang="en">Kamdi, S. Image Segmentation and Region Growing Algorithm / S. Kamdi, R. K. Krishna // International Journal of Computer Technology and Electronics Engineering (IJCTEE). – February 2012. – Vol. 2. – P. 103–107.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Wirth, N. Algorithms and Data Structures / N. Wirth. – Prentice Hall, 1985. – 212 pp.</mixed-citation><mixed-citation xml:lang="en">Wirth, N. Algorithms and Data Structures / N. Wirth. – Prentice Hall, 1985. – 212 pp.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Lipschutz, S. Schaum’s Outline of ‘Theory and Problems of Data Structures / S. Lipschutz. – McGraw-Hill Book Company, 1986. – 344 pp.</mixed-citation><mixed-citation xml:lang="en">Lipschutz, S. Schaum’s Outline of ‘Theory and Problems of Data Structures / S. Lipschutz. – McGraw-Hill Book Company, 1986. – 344 pp.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Kruse, R. L. Data Structures and Program Design in C / R. L. Kruse, A. J. Ryba. – New Jersey: Prentice-Hall, 2000. –717 pp.</mixed-citation><mixed-citation xml:lang="en">Kruse, R. L. Data Structures and Program Design in C / R. L. Kruse, A. J. Ryba. – New Jersey: Prentice-Hall, 2000. –717 pp.</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>
