<?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-451</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></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-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Объединенный институт проблем информатики НАН Беларуси</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2010</year></pub-date><pub-date pub-type="epub"><day>10</day><month>07</month><year>2018</year></pub-date><volume>0</volume><issue>1(25)</issue><fpage>5</fpage><lpage>12</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/451">https://inf.grid.by/jour/article/view/451</self-uri><abstract><p>Исследуется проблема автоматической бинаризации мультиспектральных и полутоновыхизображений. Дается краткая характеристика основных типов алгоритмов и методов автомати-ческого определения порога бинаризации. Приводится общая схема работы наиболее эффективных алгоритмов бинаризации. Сравниваются результаты бинаризации градиентных изображений, т. е. изображений, полученных в результате вычисления градиента исходного изображения. Проводится оценка качества адаптивного сглаживания изображений, содержащих шумовой сигнал, на основе выбранных алгоритмов автоматической бинаризации.</p></abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Залесский, Б.А. Алгоритм адаптивной фильтрации мультиспектральных изображений /</mixed-citation><mixed-citation xml:lang="en">Залесский, Б.А. Алгоритм адаптивной фильтрации мультиспектральных изображений /</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Б.А. Залесский, Д.В. Прадун // Информатика. – 2009. – № 2 (22). – С. 31–38.</mixed-citation><mixed-citation xml:lang="en">Б.А. Залесский, Д.В. Прадун // Информатика. – 2009. – № 2 (22). – С. 31–38.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Sezgin, M. Survey over image thresholding / M. Sezgin, B. Sankur // Journal of Electronic</mixed-citation><mixed-citation xml:lang="en">Sezgin, M. Survey over image thresholding / M. Sezgin, B. Sankur // Journal of Electronic</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Imaging. – 2004. – Vol. 13, № 1. – P. 146–165.</mixed-citation><mixed-citation xml:lang="en">Imaging. – 2004. – Vol. 13, № 1. – P. 146–165.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Acharya, T. Image Processing. Principles and applications / T. Acharya, A.K. Ray. –</mixed-citation><mixed-citation xml:lang="en">Acharya, T. Image Processing. Principles and applications / T. Acharya, A.K. Ray. –</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">New Jersey : John Wiley &amp; Sons, Inc., 2005. – 428 p.</mixed-citation><mixed-citation xml:lang="en">New Jersey : John Wiley &amp; Sons, Inc., 2005. – 428 p.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Nixon, M.S. Feature Extraction and Image Processing / M.S. Nixon, A.S. Aguado. – Oxford :</mixed-citation><mixed-citation xml:lang="en">Nixon, M.S. Feature Extraction and Image Processing / M.S. Nixon, A.S. Aguado. – Oxford :</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Butterworth-Heinemann, 2002. – 350 p.</mixed-citation><mixed-citation xml:lang="en">Butterworth-Heinemann, 2002. – 350 p.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Otsu, N. A threshold selection method from gray level histograms / N. Otsu // IEEE Trans.</mixed-citation><mixed-citation xml:lang="en">Otsu, N. A threshold selection method from gray level histograms / N. Otsu // IEEE Trans.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Syst. Man Cybern. – 1979. – SMC-9, № 1. – P. 62–66.</mixed-citation><mixed-citation xml:lang="en">Syst. Man Cybern. – 1979. – SMC-9, № 1. – P. 62–66.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Прэтт, У. Цифровая обработка изображений : пер. с англ. : в 2 т. / У. Прэтт ; под ред.</mixed-citation><mixed-citation xml:lang="en">Прэтт, У. Цифровая обработка изображений : пер. с англ. : в 2 т. / У. Прэтт ; под ред.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Д.С. Лебедева. – М. : Мир, 1982. – Т. 2. – 478 с.</mixed-citation><mixed-citation xml:lang="en">Д.С. Лебедева. – М. : Мир, 1982. – Т. 2. – 478 с.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Kapur, J.N. A new method for gray-level picture thresholding using entropy of the histogram / J.N. Kapur, P.K. Sahoo, A.K.C. Wong // Graph. Models Image Process. – 1985. – Vol. 29. – P. 273–285.</mixed-citation><mixed-citation xml:lang="en">Kapur, J.N. A new method for gray-level picture thresholding using entropy of the histogram / J.N. Kapur, P.K. Sahoo, A.K.C. Wong // Graph. Models Image Process. – 1985. – Vol. 29. – P. 273–285.</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>
