<?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">dan</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады Национальной академии наук Беларуси</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady of the National Academy of Sciences of Belarus</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-8323</issn><issn pub-type="epub">2524-2431</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">dan-218</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>INFORMATICS</subject></subj-group></article-categories><title-group><article-title>ПРОСТРАНСТВЕННО-ЧАСТОТНЫЙ КОВАРИАЦИОННЫЙ ПОИСК МАЛОРАЗМЕРНЫХ ЦЕЛЕЙ НА ОСНОВЕ НЕПРОРЕЖЕННОГО ДИСКРЕТНОГО ЛИФТИНГ ВЕЙВЛЕТ-ПРЕОБРАЗОВАНИЯ ХААРА</article-title><trans-title-group xml:lang="en"><trans-title>SPATIAL-FREQUENCY COVARIANCE SEARCH FOR LOW-SIZED TARGETS BASED ON HAAR UNDECIMATED LIFTING WAVELET TRANSFORM</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>BARYSKIEVIC</surname><given-names>I. A.</given-names></name></name-alternatives><email xlink:type="simple">anbor@bsuir.by</email><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 name-style="western" xml:lang="en"><surname>TSVIATKOU</surname><given-names>V. Yu.</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>2014</year></pub-date><pub-date pub-type="epub"><day>09</day><month>06</month><year>2016</year></pub-date><volume>58</volume><issue>3</issue><fpage>16</fpage><lpage>21</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; БОРИСКЕВИЧ И.А., ЦВЕТКОВ В.Ю., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">БОРИСКЕВИЧ И.А., ЦВЕТКОВ В.Ю.</copyright-holder><copyright-holder xml:lang="en">BARYSKIEVIC I.A., 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://doklady.belnauka.by/jour/article/view/218">https://doklady.belnauka.by/jour/article/view/218</self-uri><abstract><p>Предложен пространственно-частотный ковариационный метод поиска малоразмерных целей на кадрах видеопоследовательности. Метод основан на непрореженном дискретном лифтинг вейвлет-преобразовании Хаара. Он позволяет уменьшить время вычисления и повысить вероятность правильного обнаружения цели за счет использования непрореженного дискретного лифтинг вейвлет-преобразования Хаара для вычисления ковариационного дескриптора.</p></abstract><trans-abstract xml:lang="en"><p>A spatial-frequency covariance method of search for low-sized targets on video frames is proposed. It is based on Haar undecimated lifting wavelet transform. The method allows one to reduce computation time and to increase the probability of correct detection of target by using Haar undecimated lifting wavelet transform for calculation of a covariance descriptor.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Porikli F., Tuzel O. // Proceedings of IEEE Int’l. Conference on Multimedia and Expo. 2005. P. 1234–1237.</mixed-citation><mixed-citation xml:lang="en">Porikli F., Tuzel O. // Proceedings of IEEE Int’l. Conference on Multimedia and Expo. 2005. P. 1234–1237.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Avidan S. // Proc. IEEE Conf. on Computer Vision and Pattern Recognition. 2005. Vol. 2. P. 494–501.</mixed-citation><mixed-citation xml:lang="en">Avidan S. // Proc. IEEE Conf. on Computer Vision and Pattern Recognition. 2005. Vol. 2. P. 494–501.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Ribaric S., Adrinek G., S egvic S . // Proceedings of the 12th IEEE Mediterranean Electrotechnical Conference. 2004. P. 231–234.</mixed-citation><mixed-citation xml:lang="en">Ribaric S., Adrinek G., S egvic S . // Proceedings of the 12th IEEE Mediterranean Electrotechnical Conference. 2004. P. 231–234.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Tuzel O., Porikli F., Meer P. // Proc. 9th European Conf. on Computer Vision. 2006. Vol. 2. P. 589–600.</mixed-citation><mixed-citation xml:lang="en">Tuzel O., Porikli F., Meer P. // Proc. 9th European Conf. on Computer Vision. 2006. Vol. 2. P. 589–600.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Meng J. // IEEE International Symposium on Communication and Information Technologies. 2005. Vol. 1. P. 606–609.</mixed-citation><mixed-citation xml:lang="en">Meng J. // IEEE International Symposium on Communication and Information Technologies. 2005. Vol. 1. P. 606–609.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Борискевич И. А., Цветков В. Ю., Аль-Хелли Ф. А. М. // Телекоммуникации: сети и технологии, алгебраическое кодирование и безопасность данных: Материалы Междунар. науч.-техн. семинара (Минск, апрель–декабрь 2013 г.). Минск, 2014. С. 16–21.</mixed-citation><mixed-citation xml:lang="en">Борискевич И. А., Цветков В. Ю., Аль-Хелли Ф. А. М. // Телекоммуникации: сети и технологии, алгебраическое кодирование и безопасность данных: Материалы Междунар. науч.-техн. семинара (Минск, апрель–декабрь 2013 г.). Минск, 2014. С. 16–21.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Yang H., Shao L. // Neurocomputing. 2011. Vol. 74. P. 3823–3831.</mixed-citation><mixed-citation xml:lang="en">Yang H., Shao L. // Neurocomputing. 2011. Vol. 74. P. 3823–3831.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Oren M., Papageorgiou C. // Proceedings of IEEE International on Computer Vision and Pattern Recognition. 1997. Vol. 97. P. 193–199.</mixed-citation><mixed-citation xml:lang="en">Oren M., Papageorgiou C. // Proceedings of IEEE International on Computer Vision and Pattern Recognition. 1997. Vol. 97. P. 193–199.</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>
