Pub Date : 2022-10-01DOI: 10.18287/2412-6179-co-1139
A. Frolov, А.V. Ustinov, S. Khonina
In this paper, we study a change in the propagation trajectory of a set of autofocusing laser beams using a fractional Fourier transform. Clusters of displaced bounded Airy-Gaussian beams supplemented by a phase function that deflects the beam similarly to a prism are considered. The shift and phase deviation (according to the carrier spatial frequencies) make it possible to change the propagation trajectory of a set of autofocusing beams. The influence of the parameters under consideration on the properties of autofocusing of a cluster of Airy-Gaussian beams is investigated by means of numerical simulation.
{"title":"Changing the trajectory of Airy beam sets with spatial carriers","authors":"A. Frolov, А.V. Ustinov, S. Khonina","doi":"10.18287/2412-6179-co-1139","DOIUrl":"https://doi.org/10.18287/2412-6179-co-1139","url":null,"abstract":"In this paper, we study a change in the propagation trajectory of a set of autofocusing laser beams using a fractional Fourier transform. Clusters of displaced bounded Airy-Gaussian beams supplemented by a phase function that deflects the beam similarly to a prism are considered. The shift and phase deviation (according to the carrier spatial frequencies) make it possible to change the propagation trajectory of a set of autofocusing beams. The influence of the parameters under consideration on the properties of autofocusing of a cluster of Airy-Gaussian beams is investigated by means of numerical simulation.","PeriodicalId":46692,"journal":{"name":"Computer Optics","volume":"16 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76457854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-01DOI: 10.18287/2412-6179-co-1096
S. Karpeev, V. Podlipnov, S. Degtyarev, A. Algubili
Complex polarization-phase transformations are considered, which are implemented using easy-to-manufacture optical elements. The manufacturing technology of such elements is based on the axially symmetric discretization of the required polarization and phase distributions. This representation leads to optical elements in the form of sector sandwich structures consisting of polarizing and phase plates stacked together. The paper numerically and experimentally investigates the main types of such sector sandwich structures for the formation of second-order cylindrical polarizations.
{"title":"Formation of high-order cylindrical vector beams with sector sandwich structures","authors":"S. Karpeev, V. Podlipnov, S. Degtyarev, A. Algubili","doi":"10.18287/2412-6179-co-1096","DOIUrl":"https://doi.org/10.18287/2412-6179-co-1096","url":null,"abstract":"Complex polarization-phase transformations are considered, which are implemented using easy-to-manufacture optical elements. The manufacturing technology of such elements is based on the axially symmetric discretization of the required polarization and phase distributions. This representation leads to optical elements in the form of sector sandwich structures consisting of polarizing and phase plates stacked together. The paper numerically and experimentally investigates the main types of such sector sandwich structures for the formation of second-order cylindrical polarizations.","PeriodicalId":46692,"journal":{"name":"Computer Optics","volume":"17 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80892768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-01DOI: 10.18287/2412-6179-co-1106
V. Kotlyar, A. Kovalev, A. Savelyeva
We calculate the topological charge (TC) of a coherent axial superposition of different-"color" Laguerre-Gaussian (LG) beams, each having a different wavelength and TC. It is found that the TC of such a superposition is equal to the TC of the longer-wavelength constituent LG beam regardless of the weight coefficient of this beam in the superposition and its corresponding TC. It is interesting that the instantaneous TC of such a superposition is conserved and the (time-averaged) intensity distribution of the "colored" optical vortex changes its light "gamut": whereas in the near field with increasing radius, colors of the light rings (rainbow) change according to their TC in the superposition from the smaller TC to the larger one, upon free-space propagation (to the far field), with increasing radius, the ring colors in the rainbow get arranged in the reverse order from the larger TC to the smaller one. It is also shown that choosing the wavelengths (blue, green, and red)in a special way in a three-color superposition of single-ringed LG beams allows obtaining a time-averaged white light ring at a certain distance.
{"title":"Coherent superposition of the Laguerre-Gaussian beams with different wavelengths: colored optical vortices","authors":"V. Kotlyar, A. Kovalev, A. Savelyeva","doi":"10.18287/2412-6179-co-1106","DOIUrl":"https://doi.org/10.18287/2412-6179-co-1106","url":null,"abstract":"We calculate the topological charge (TC) of a coherent axial superposition of different-\"color\" Laguerre-Gaussian (LG) beams, each having a different wavelength and TC. It is found that the TC of such a superposition is equal to the TC of the longer-wavelength constituent LG beam regardless of the weight coefficient of this beam in the superposition and its corresponding TC. It is interesting that the instantaneous TC of such a superposition is conserved and the (time-averaged) intensity distribution of the \"colored\" optical vortex changes its light \"gamut\": whereas in the near field with increasing radius, colors of the light rings (rainbow) change according to their TC in the superposition from the smaller TC to the larger one, upon free-space propagation (to the far field), with increasing radius, the ring colors in the rainbow get arranged in the reverse order from the larger TC to the smaller one. It is also shown that choosing the wavelengths (blue, green, and red)in a special way in a three-color superposition of single-ringed LG beams allows obtaining a time-averaged white light ring at a certain distance.","PeriodicalId":46692,"journal":{"name":"Computer Optics","volume":"74 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80012483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-01DOI: 10.18287/2412-6179-co-933
M. Valueva, P. Lyakhov, N. Nagornov, G. Valuev
Continuous improvement of methods for visual information registration, processing and storage leads to the need of improving technical characteristics of digital image processing systems. The paper proposes new high-performance digital filter architectures for image processing by the Winograd method with calculations performed in a residue number system with special-type moduli. To assess the performance and hardware costs of the proposed architectures, hardware simulation is carried out using a field-programmable gate array in a computer-aided design envi-ronment Xilinx Vivado 2018.3 for the target device Artix-7 xc7a200tffg1156-3. The results of hardware simulation show that the proposed filter architectures have 1.13 – 5.42 times higher performance, but require more hardware costs compared to the known methods. The results of this study can be used in the design of complex systems for image processing and analysis for their performance to be increased.
{"title":"High-performance digital image filtering architectures in the residue number system based on the Winograd method","authors":"M. Valueva, P. Lyakhov, N. Nagornov, G. Valuev","doi":"10.18287/2412-6179-co-933","DOIUrl":"https://doi.org/10.18287/2412-6179-co-933","url":null,"abstract":"Continuous improvement of methods for visual information registration, processing and storage leads to the need of improving technical characteristics of digital image processing systems. The paper proposes new high-performance digital filter architectures for image processing by the Winograd method with calculations performed in a residue number system with special-type moduli. To assess the performance and hardware costs of the proposed architectures, hardware simulation is carried out using a field-programmable gate array in a computer-aided design envi-ronment Xilinx Vivado 2018.3 for the target device Artix-7 xc7a200tffg1156-3. The results of hardware simulation show that the proposed filter architectures have 1.13 – 5.42 times higher performance, but require more hardware costs compared to the known methods. The results of this study can be used in the design of complex systems for image processing and analysis for their performance to be increased.","PeriodicalId":46692,"journal":{"name":"Computer Optics","volume":"133 6 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86482209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-01DOI: 10.18287/2412-6179-co-1061
A. Sokolova, A. Savchenko, Nikolenko
One of main issues in face identification is the lack of training data of specific type (bad quality image, varying scale or illumination, children/old people faces, etc.). As a result, the recogni-tion accuracy may be low for input images which are not similar to the majority of images in the dataset used to train the feature extractor. In this paper, we propose that this issue is dealt with by the automatic detection of such out-of-distribution data based on the addition of a preliminary stage of their automatic rejection using a special convolutional network trained using a set of rare data collected using various transformations. To increase the computational efficiency, the decision about the presence of a rare image is made on the basis of the same face descriptor that is used in the classifier. Experimental research confirmed the accuracy improvement of the proposed approach for several datasets of faces and modern neural network descriptors.
{"title":"Open-set face identification with automatic detection of out-of-distribution images","authors":"A. Sokolova, A. Savchenko, Nikolenko","doi":"10.18287/2412-6179-co-1061","DOIUrl":"https://doi.org/10.18287/2412-6179-co-1061","url":null,"abstract":"One of main issues in face identification is the lack of training data of specific type (bad quality image, varying scale or illumination, children/old people faces, etc.). As a result, the recogni-tion accuracy may be low for input images which are not similar to the majority of images in the dataset used to train the feature extractor. In this paper, we propose that this issue is dealt with by the automatic detection of such out-of-distribution data based on the addition of a preliminary stage of their automatic rejection using a special convolutional network trained using a set of rare data collected using various transformations. To increase the computational efficiency, the decision about the presence of a rare image is made on the basis of the same face descriptor that is used in the classifier. Experimental research confirmed the accuracy improvement of the proposed approach for several datasets of faces and modern neural network descriptors.","PeriodicalId":46692,"journal":{"name":"Computer Optics","volume":"14 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73180400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-01DOI: 10.18287/2412-6179-co-1126
V. Kotlyar, A. Kovalev, V. Zaitsev
In this work, we study several different vector and hybrid light fields, including those with multiple polarization singularities. We derive polarization singularity indices by adopting a well-known M.V. Berry's formula, which is commonly used to obtain the topological charge of scalar vortex light fields. It is shown that fields whose polarization state depends only on the polar angle in the beam cross section can have either polarization singularity lines outgoing from the center, or a single polarization singularity in the center of the beam cross section. If the polarization state of the field depends only on the radial variable, then such fields have no polarization singularities and their index is equal to zero. If the polarization state of a vector field depends on both polar coordinates, then such a field can have several polarization singularities at different locations in the beam cross section. We also investigate a vector field with high-order radial polarization and with a real parameter. At different values of this parameter, such a field has either several polarization singularity lines outgoing from the center, or a single singular point in the center. The polarization singularity index of such a field for different parameters can be either half-integer, or integer, or zero.
{"title":"Inhomogeneously polarized light fields: polarization singularity indices derived by analogy with the topological charge","authors":"V. Kotlyar, A. Kovalev, V. Zaitsev","doi":"10.18287/2412-6179-co-1126","DOIUrl":"https://doi.org/10.18287/2412-6179-co-1126","url":null,"abstract":"In this work, we study several different vector and hybrid light fields, including those with multiple polarization singularities. We derive polarization singularity indices by adopting a well-known M.V. Berry's formula, which is commonly used to obtain the topological charge of scalar vortex light fields. It is shown that fields whose polarization state depends only on the polar angle in the beam cross section can have either polarization singularity lines outgoing from the center, or a single polarization singularity in the center of the beam cross section. If the polarization state of the field depends only on the radial variable, then such fields have no polarization singularities and their index is equal to zero. If the polarization state of a vector field depends on both polar coordinates, then such a field can have several polarization singularities at different locations in the beam cross section. We also investigate a vector field with high-order radial polarization and with a real parameter. At different values of this parameter, such a field has either several polarization singularity lines outgoing from the center, or a single singular point in the center. The polarization singularity index of such a field for different parameters can be either half-integer, or integer, or zero.","PeriodicalId":46692,"journal":{"name":"Computer Optics","volume":"11 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87812153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-01DOI: 10.18287/2412-6179-co-1074
V. Syuzev, A. V. Proletarsky, D. Mikov, I. Deykin
The article is devoted to methods of discretization of energy characteristics of two-dimensional random signals when simulating random signals using the original harmonic method, which is a generalization of the well-known algorithm proposed by V. S. Pugachev for the two-dimensional case. Requirements imposed on the sampling method are aimed at reducing the computational complexity of the simulation method and increasing its flexibility thanks to removing restrictions on the form of autocorrelation functions and spectral energy density functions. The use of the simulation error as a criterion for quality assessment is proposed. The discretization method is considered for signals given both on unlimited definition intervals and on limited ones. The article demonstrates results of the software system implementation in which the original simulation method is realized using the described sampling methods in both cases. The proposed technique is shown to be robust and efficient, with the results obtained being of independent scientific and technical value and showing promise for developing new effective spectral techniques of simulating signals for the use in intelligent decision support systems.
本文研究了利用普加乔夫(V. S. Pugachev)在二维情况下提出的著名算法的推广——原始谐波法(original harmonic method)对二维随机信号进行模拟时能量特性的离散化方法。对采样方法提出的要求是为了降低模拟方法的计算复杂度,并通过消除对自相关函数和谱能量密度函数形式的限制来增加其灵活性。提出了将仿真误差作为质量评价标准的方法。考虑了无限定义区间和有限定义区间信号的离散化方法。本文演示了软件系统实现的结果,在这两种情况下,使用所描述的采样方法实现了原始的仿真方法。结果表明,该方法鲁棒性好、效率高,具有独立的科学技术价值,为智能决策支持系统开发新的有效的信号模拟频谱技术提供了前景。
{"title":"Techniques of sampling the energy characteristics of two-dimensional random signals","authors":"V. Syuzev, A. V. Proletarsky, D. Mikov, I. Deykin","doi":"10.18287/2412-6179-co-1074","DOIUrl":"https://doi.org/10.18287/2412-6179-co-1074","url":null,"abstract":"The article is devoted to methods of discretization of energy characteristics of two-dimensional random signals when simulating random signals using the original harmonic method, which is a generalization of the well-known algorithm proposed by V. S. Pugachev for the two-dimensional case. Requirements imposed on the sampling method are aimed at reducing the computational complexity of the simulation method and increasing its flexibility thanks to removing restrictions on the form of autocorrelation functions and spectral energy density functions. The use of the simulation error as a criterion for quality assessment is proposed. The discretization method is considered for signals given both on unlimited definition intervals and on limited ones. The article demonstrates results of the software system implementation in which the original simulation method is realized using the described sampling methods in both cases. The proposed technique is shown to be robust and efficient, with the results obtained being of independent scientific and technical value and showing promise for developing new effective spectral techniques of simulating signals for the use in intelligent decision support systems.","PeriodicalId":46692,"journal":{"name":"Computer Optics","volume":"27 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79440097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-01DOI: 10.18287/2412-6179-co-1047
V. A. Lobanova, Yuliya Ivanova
This article discusses the design and development of a neural network algorithm for the segmentation of text areas in real-scene images. After reviewing the available neural network models, the U-net model was chosen as a basis. Then an algorithm for detecting text areas in real-scene images was proposed and implemented. The experimental training of the network allows one to define the neural network parameters such as the size of input images and the number and types of the network layers. Bilateral and low-pass filters were considered as a preprocessing stage. The number of images in the KAIST Scene Text Database was increased by applying rotations, compression, and splitting of the images. The results obtained were found to surpass competing methods in terms of the F-measure value.
{"title":"Development of software for the segmentation of text areas in real-scene images","authors":"V. A. Lobanova, Yuliya Ivanova","doi":"10.18287/2412-6179-co-1047","DOIUrl":"https://doi.org/10.18287/2412-6179-co-1047","url":null,"abstract":"This article discusses the design and development of a neural network algorithm for the segmentation of text areas in real-scene images. After reviewing the available neural network models, the U-net model was chosen as a basis. Then an algorithm for detecting text areas in real-scene images was proposed and implemented. The experimental training of the network allows one to define the neural network parameters such as the size of input images and the number and types of the network layers. Bilateral and low-pass filters were considered as a preprocessing stage. The number of images in the KAIST Scene Text Database was increased by applying rotations, compression, and splitting of the images. The results obtained were found to surpass competing methods in terms of the F-measure value.","PeriodicalId":46692,"journal":{"name":"Computer Optics","volume":"73 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72916274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-01DOI: 10.18287/2412-6179-co-1122
Е.E. Aydarkin, N. Mogilevskaya
The paper investigates the ability of the equal-weight columns method to resist grouping erasures. The Gilbert model for error generation flow is adapted for the case of erasures. A simulation model of the erasure-correction channel is constructed with the possibility of choosing the type of erasure and the method of protection against erasure. With the help of this model, an experimental study of the equal-weight column method and its modifications is conducted and a detailed analysis of the results with conclusions for developers of networks and data transmission channels is carried out. An estimate of the decoding probability is constructed. A method of dealing with clustering erasures by using additional redundancy is proposed.
{"title":"Experimental study of a matrix method of equal-weight columns correcting ability to protect data from erasure","authors":"Е.E. Aydarkin, N. Mogilevskaya","doi":"10.18287/2412-6179-co-1122","DOIUrl":"https://doi.org/10.18287/2412-6179-co-1122","url":null,"abstract":"The paper investigates the ability of the equal-weight columns method to resist grouping erasures. The Gilbert model for error generation flow is adapted for the case of erasures. A simulation model of the erasure-correction channel is constructed with the possibility of choosing the type of erasure and the method of protection against erasure. With the help of this model, an experimental study of the equal-weight column method and its modifications is conducted and a detailed analysis of the results with conclusions for developers of networks and data transmission channels is carried out. An estimate of the decoding probability is constructed. A method of dealing with clustering erasures by using additional redundancy is proposed.","PeriodicalId":46692,"journal":{"name":"Computer Optics","volume":"33 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83063140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-01DOI: 10.18287/2412-6179-co-1098
D. Plotnikov, P. Kolbudaev, E. Loupian
The paper describes a method for automatic subpixel-accurate geographic referencing of imagery acquired by KMSS-M with 60 m spatial resolution, based on leveraging a coarse, reconstructed, cloud-free and daily updated MODIS surface reflectance reference image. The method is based on maximizing Pearson's correlation value when determining an optimal local displacement of the distorted image fragment by comparing with the reference image. To assess the effectiveness of the method when used over continental-scale and heterogeneous areas, three experiments were carried out providing quantitative estimates of imagery registration errors: an experiment with model datasets, an experiment to estimate the absolute registration error of MODIS reference imagery, and an experiment to estimate the registration error of geocorrected KMSS-M data. Experimental evaluation of the method based on model datasets of decameter-resolution Sentinel-2 (MSI) imagery demonstrated its robustness when used over a variety of environmental conditions over a one year-long observation period. The average georeferencing error of MODIS coarse-resolution reference was shown to be less than 20 meters in Red and Near-infrared bands. Corrected KMSS-M imagery evaluation over the Russian Grain Belt within 2020 has shown, on average, the subpixel referencing accuracy both in Red and Near-infrared bands, while the average absolute georeferencing error of the original uncorrected KMSS-M imagery was shown to be about 3 kilometers. Subpixel registration accuracy of KMSS-M imagery, corrected with MODIS-based coarse-resolution reference, opens new prospects for using multi-temporal analysis of this multispectral surface reflectance data in a variety of scientific and practical applications associated with vegetation cover satellite monitoring. The technological flexibility of the method ensures its applicability to data from other satellite systems for Earth optical remote sensing.
{"title":"An automatic method for subpixel registration of KMSS-M imagery based on coarse-resolution actualized reference","authors":"D. Plotnikov, P. Kolbudaev, E. Loupian","doi":"10.18287/2412-6179-co-1098","DOIUrl":"https://doi.org/10.18287/2412-6179-co-1098","url":null,"abstract":"The paper describes a method for automatic subpixel-accurate geographic referencing of imagery acquired by KMSS-M with 60 m spatial resolution, based on leveraging a coarse, reconstructed, cloud-free and daily updated MODIS surface reflectance reference image. The method is based on maximizing Pearson's correlation value when determining an optimal local displacement of the distorted image fragment by comparing with the reference image. To assess the effectiveness of the method when used over continental-scale and heterogeneous areas, three experiments were carried out providing quantitative estimates of imagery registration errors: an experiment with model datasets, an experiment to estimate the absolute registration error of MODIS reference imagery, and an experiment to estimate the registration error of geocorrected KMSS-M data. Experimental evaluation of the method based on model datasets of decameter-resolution Sentinel-2 (MSI) imagery demonstrated its robustness when used over a variety of environmental conditions over a one year-long observation period. The average georeferencing error of MODIS coarse-resolution reference was shown to be less than 20 meters in Red and Near-infrared bands. Corrected KMSS-M imagery evaluation over the Russian Grain Belt within 2020 has shown, on average, the subpixel referencing accuracy both in Red and Near-infrared bands, while the average absolute georeferencing error of the original uncorrected KMSS-M imagery was shown to be about 3 kilometers. Subpixel registration accuracy of KMSS-M imagery, corrected with MODIS-based coarse-resolution reference, opens new prospects for using multi-temporal analysis of this multispectral surface reflectance data in a variety of scientific and practical applications associated with vegetation cover satellite monitoring. The technological flexibility of the method ensures its applicability to data from other satellite systems for Earth optical remote sensing.","PeriodicalId":46692,"journal":{"name":"Computer Optics","volume":"40 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81137519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}