<?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">inform</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1816-0301</issn><issn pub-type="epub">2617-6963</issn><publisher><publisher-name>UIIP NASB</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">inform-704</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>INTELLIGENT SYSTEMS</subject></subj-group></article-categories><title-group><article-title>СЕГМЕНТАЦИЯ ОБЪЕКТОВ ПОЛУТОНОВЫХ ИЗОБРАЖЕНИЙ  НА ОСНОВЕ ПРЕОБРАЗОВАНИЯ ВОДОРАЗДЕЛА И ЧЕМФЕРНОЙ МЕТРИКИ</article-title><trans-title-group xml:lang="en"><trans-title></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-alternatives><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Тузиков</surname><given-names>А. В.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Национальный центр информационных ресурсов и технологий НАН Беларуси</institution><country>Belarus</country></aff><aff xml:lang="ru" id="aff-2"><institution>Объединенный институт проблем информатики НАН Беларуси</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2006</year></pub-date><pub-date pub-type="epub"><day>20</day><month>12</month><year>2018</year></pub-date><volume>0</volume><issue>3(11)</issue><fpage>45</fpage><lpage>57</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Гончаренко В.Г., Тузиков А.В., 2018</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="ru">Гончаренко В.Г., Тузиков А.В.</copyright-holder><copyright-holder xml:lang="en">Гончаренко В.Г., Тузиков А.В.</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://inf.grid.by/jour/article/view/704">https://inf.grid.by/jour/article/view/704</self-uri><abstract><p>Вводится понятие преобразования водораздела в терминах теории графов. Предлагаемый подход к вычислению преобразования водораздела основан на построении леса путей с минимальным модифицированным топографическим расстоянием в пространстве , что позволяет корректно сегментировать объекты изображений. Представлены два алгоритма сегментации полутоновых изображений на основе преобразования водораздела для простых метрик, задаваемых единичной окрестностью и чемферной (a,b)-метрикой. Дается сравнение одного из представленных алгоритмов с аналогичным алгоритмом Лотуфо – Фалькао.</p></abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Beucher, S., Lantuejoul, C. Use of watersheds in contour detection / S. Beucher, C. Lantuejoul // International Workshop on Image Processing. – Rennes, France, 1979. – P. 2.1–2.12.</mixed-citation><mixed-citation xml:lang="en">Beucher, S., Lantuejoul, C. Use of watersheds in contour detection / S. Beucher, C. Lantuejoul // International Workshop on Image Processing. – Rennes, France, 1979. – P. 2.1–2.12.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Beucher, S. The watershed transformation applied to image segmentation / S. Beucher // Conference on Signal and Image Processing in Microscopy and Microanalysis. – Cambridge, UK, 1991. – P. 299–314.</mixed-citation><mixed-citation xml:lang="en">Beucher, S. The watershed transformation applied to image segmentation / S. Beucher // Conference on Signal and Image Processing in Microscopy and Microanalysis. – Cambridge, UK, 1991. – P. 299–314.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Beucher, S. The morphological approach to segmentation: the watershed transformation / S. Beucher, F. Meyer // Mathematical Morphology in Image Processing. – 1993. – Ch. 12. – P. 433–481.</mixed-citation><mixed-citation xml:lang="en">Beucher, S. The morphological approach to segmentation: the watershed transformation / S. Beucher, F. Meyer // Mathematical Morphology in Image Processing. – 1993. – Ch. 12. – P. 433–481.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Lotufo, R. The ordered queue and the optimality of the watershed approaches. Mathematical / R. Lotufo, A. Falcao // Morphology and its Application to Image and Signal Processing (Computational Imaging and Vision). – 2000. – Vol. 12. – P. 341–350.</mixed-citation><mixed-citation xml:lang="en">Lotufo, R. The ordered queue and the optimality of the watershed approaches. Mathematical / R. Lotufo, A. Falcao // Morphology and its Application to Image and Signal Processing (Computational Imaging and Vision). – 2000. – Vol. 12. – P. 341–350.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Roerdink, J. The watershed transform: definitions, algorithms, and parallelization strate-gies / J. Roerdink, A. Meijster // Fundamenta Informaticae. – 2000. – Vol. 41. – P. 187–228.</mixed-citation><mixed-citation xml:lang="en">Roerdink, J. The watershed transform: definitions, algorithms, and parallelization strate-gies / J. Roerdink, A. Meijster // Fundamenta Informaticae. – 2000. – Vol. 41. – P. 187–228.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Couprie, M., Bertrand, G. Topological grayscale watershed transformation / M. Couprie, G. Bertrand // Proceedings of SPIE Vision Geometry VI. – 1997. – Vol. 3168. – P. 136–146.</mixed-citation><mixed-citation xml:lang="en">Couprie, M., Bertrand, G. Topological grayscale watershed transformation / M. Couprie, G. Bertrand // Proceedings of SPIE Vision Geometry VI. – 1997. – Vol. 3168. – P. 136–146.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</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 / F. Meyer // Signal Processing. – 1994. – Vol. 38, № 1. – P. 113–125.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Moore, E. F. The shortest path through a maze / E.F. Moore // Proceedings of an International Symposium on the Theory of Switching, Part II. – Harvard University Press, Cambridge, Massachusetts, 1959. – P. 285–292.</mixed-citation><mixed-citation xml:lang="en">Moore, E. F. The shortest path through a maze / E.F. Moore // Proceedings of an International Symposium on the Theory of Switching, Part II. – Harvard University Press, Cambridge, Massachusetts, 1959. – P. 285–292.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Кормен, Т., Лейзерсон, Ч., Ривест, Р. Алгоритмы: построение и анализ / Т. Кормен, Ч. Лейзерсон, Р. Ривест. – М.: БИНОМ, 2004. – 960 с.</mixed-citation><mixed-citation xml:lang="en">Кормен, Т., Лейзерсон, Ч., Ривест, Р. Алгоритмы: построение и анализ / Т. Кормен, Ч. Лейзерсон, Р. Ривест. – М.: БИНОМ, 2004. – 960 с.</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>
