<?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">ellibs</journal-id><journal-title-group><journal-title xml:lang="ru">Электронные библиотеки</journal-title><trans-title-group xml:lang="en"><trans-title>Russian Digital Libraries Journal</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">1562-5419</issn><publisher><publisher-name>Казанский (Приволжский) федеральный университет</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.26907/1562-5419-2023-26-4-456-465</article-id><article-id custom-type="elpub" pub-id-type="custom">ellibs-383</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>Комбинирование алгоритмов SfM и ORB при 3D-реконструкции</article-title><trans-title-group xml:lang="en"><trans-title>Combining SfM and ORB Algorithms in 3D Reconstruction</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>Daminov</surname><given-names>I. A.</given-names></name></name-alternatives><email xlink:type="simple">ilnazdaminov@bk.ru</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>Arsenyuk</surname><given-names>A. Y.</given-names></name></name-alternatives><email xlink:type="simple">arsenyukofficial@gmail.com</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>Toschev</surname><given-names>A. S.</given-names></name></name-alternatives><email xlink:type="simple">atoschev@kpfu.ru</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>Kazan (Volga region) Federal University</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>28</day><month>08</month><year>2023</year></pub-date><volume>26</volume><issue>4</issue><elocation-id>456–465</elocation-id><permissions><copyright-statement>Copyright &amp;#x00A9; Даминов И.А., Арсенюк А.Ю., Тощев А.С., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Даминов И.А., Арсенюк А.Ю., Тощев А.С.</copyright-holder><copyright-holder xml:lang="en">Daminov I.A., Arsenyuk A.Y., Toschev A.S.</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://ellibs.elpub.ru/jour/article/view/383">https://ellibs.elpub.ru/jour/article/view/383</self-uri><abstract><p>Представлен новый алгоритм 3D-реконструкции с использованием комбинации существующих методов – Structure from Motion (SfM), Oriented FAST и Rotated BRIEF (ORB). Предложен подход, объединяющий преимущества названных методов для повышения точности и эффективности восстановления 3D-структуры сцен изображений. Для улучшения качества реконструкции применены фильтрация и устранение выбросов, а также другие оптимизации. Результаты сравнения нового алгоритма с существующими методами показали его превосходство в точности и устойчивости к шуму. Предложенный подход обладает высокой масштабируемостью и может быть успешно применен в различных областях, требующих точной 3D-реконструкции сцен изображений.
</p></abstract><trans-abstract xml:lang="en"><p>This article presents a new algorithm for 3D reconstruction using a combination of two existing methods – Structure from Motion (SfM) and Oriented FAST and Rotated BRIEF (ORB). The authors propose an approach that merges the advantages of both methods to enhance the accuracy and efficiency of reconstructing the 3D structure of scenes from images. To improve reconstruction quality, filtering and outlier removal are applied, along with other optimizations. Comparative results between the new algorithm and existing methods demonstrate its superiority in accuracy and noise robustness. The proposed approach is highly scalable and can be successfully applied in various fields that require precise 3D reconstruction of image scenes.
</p></trans-abstract><kwd-group xml:lang="ru"><kwd>компьютерное зрение</kwd><kwd>фотограмметрия</kwd><kwd>пространственная точность</kwd><kwd>плотная реконструкция</kwd><kwd>облако точек</kwd></kwd-group><kwd-group xml:lang="en"><kwd>3D-реконструкция</kwd><kwd>sfm</kwd><kwd>orb</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">Szeliski R. Computer Vision, Algorithms and Applications. Springer. 2011, 505 p.</mixed-citation><mixed-citation xml:lang="en">Szeliski R. Computer Vision, Algorithms and Applications. Springer. 2011, 505 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Seitz S. M., Dyer C. R. Photorealistic Scene Reconstruction by Voxel Coloring, Proc. Computer Vision and Pattern Recognition Conf. 1997. P. 1067–1073.</mixed-citation><mixed-citation xml:lang="en">Seitz S. M., Dyer C. R. Photorealistic Scene Reconstruction by Voxel Coloring, Proc. Computer Vision and Pattern Recognition Conf. 1997. P. 1067–1073.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Fraltsov D. Single image 3D scene reconstruction. toloka.ai [Электронный ресурс]. 2023. URL: https://toloka.ai/blog/3d-scenes-reconstruction</mixed-citation><mixed-citation xml:lang="en">Fraltsov D. Single image 3D scene reconstruction. toloka.ai [Электронный ресурс]. 2023. URL: https://toloka.ai/blog/3d-scenes-reconstruction</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Hartley R., Zisserman A. Multiple view geometry in computer vision. Cambridge University press. 2004, 56 p.</mixed-citation><mixed-citation xml:lang="en">Hartley R., Zisserman A. Multiple view geometry in computer vision. Cambridge University press. 2004, 56 p.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">X. Zhu, H. Hu, S. Lin, J. Dai. Deformable convnets v2: More deformable, better results. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Long Beach, CA, USA, 16–17 June 2019. P. 9308–9316.</mixed-citation><mixed-citation xml:lang="en">X. Zhu, H. Hu, S. Lin, J. Dai. Deformable convnets v2: More deformable, better results. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Long Beach, CA, USA, 16–17 June 2019. P. 9308–9316.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Introduction to SURF (Speeded-Up Robust Features). OpenCV documentation [Электронный ресурс]. 2021. URL: https://docs.opencv.org/3.4/df/dd2/tutorial_py_surf_intro.html</mixed-citation><mixed-citation xml:lang="en">Introduction to SURF (Speeded-Up Robust Features). OpenCV documentation [Электронный ресурс]. 2021. URL: https://docs.opencv.org/3.4/df/dd2/tutorial_py_surf_intro.html</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Seitz S. M. A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms, in Proc. IEEE international Conference on Computer Vision and Pattern Recognition. New York, USA. 2006.</mixed-citation><mixed-citation xml:lang="en">Seitz S. M. A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms, in Proc. IEEE international Conference on Computer Vision and Pattern Recognition. New York, USA. 2006.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Итеративный алгоритм ближайших точек. Wikipedia [Электронный ресурс]. 2021 URL: https://en.wikipedia.org/wiki/Iterative_closest_point</mixed-citation><mixed-citation xml:lang="en">Итеративный алгоритм ближайших точек. Wikipedia [Электронный ресурс]. 2021 URL: https://en.wikipedia.org/wiki/Iterative_closest_point</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Hengyu Y., Hongyang . Incremental SFM 3D reconstruction based on monocular. 13th International Symposium on Computational Intelligence and Design (ISCID). 2020. P. 523.</mixed-citation><mixed-citation xml:lang="en">Hengyu Y., Hongyang . Incremental SFM 3D reconstruction based on monocular. 13th International Symposium on Computational Intelligence and Design (ISCID). 2020. P. 523.</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>
