发布求助
文献互助 智能选刊 最新文献

Journal of Communications Technology and Electronics最新文献

筛选
英文 中文
Registration of Point Clouds in 3D Space Using Soft Alignment 利用软对齐技术在三维空间中注册点云
IF 0.5 4区 计算机科学
Journal of Communications Technology and Electronics Pub Date : 2024-09-11 DOI: 10.1134/s1064226924700165
A. Yu. Makovetskii, V. I. Kober, S. M. Voronin, A. V. Voronin, V. N. Karnaukhov, M. G. Mozerov
{"title":"Registration of Point Clouds in 3D Space Using Soft Alignment","authors":"A. Yu. Makovetskii, V. I. Kober, S. M. Voronin, A. V. Voronin, V. N. Karnaukhov, M. G. Mozerov","doi":"10.1134/s1064226924700165","DOIUrl":"https://doi.org/10.1134/s1064226924700165","url":null,"abstract":"<p><b>Abstract</b>—There was significant recent progress in the field of deep learning, which has led to compelling advances in most tasks of semantic computer vision (e.g., classification, detection, and segmentation). Point cloud registration is a problem in which two or more different point clouds are aligned by estimation of the relative geometric transformation between them. This well-known problem plays an important role in many applications such as SLAM, 3D reconstruction, mapping, positioning, and localization. The complexity of the point cloud registration increases due to the difficulty of feature extraction related to a large difference in the appearances of a single object obtained by a laser scanner from different points of view. Millions of points created every second require high-efficiency algorithms and powerful computing devices. The well-known ICP algorithm for point cloud registration and its variants have relatively high computational efficiency, but are known to be immune to local minima and, therefore, rely on the quality of the initial rough alignment. Algorithm operation with the interference caused by noisy points on dynamic objects is usually critical for obtaining a satisfactory estimate, especially when using real LiDAR data. In this study, we propose a neural network algorithm to solve the problem of point cloud registration by estimating the soft alignment of the points of the source and target point clouds. The proposed algorithm efficiently works with incongruent noisy point clouds generated by LiDAR. Results of computer simulation are presented to illustrate the efficiency of the proposed algorithm.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mathematical Modeling of Network Nodes and Topologies of Modern Data Networks 现代数据网络节点和拓扑结构的数学建模
IF 0.5 4区 计算机科学
Journal of Communications Technology and Electronics Pub Date : 2024-09-11 DOI: 10.1134/s1064226924700141
V. M. Antonova, I. G. Buzhin, V. S. Gnezdilov, N. A. Grechishkina, N. A. Kuznetsov, Yu. B. Mironov
{"title":"Mathematical Modeling of Network Nodes and Topologies of Modern Data Networks","authors":"V. M. Antonova, I. G. Buzhin, V. S. Gnezdilov, N. A. Grechishkina, N. A. Kuznetsov, Yu. B. Mironov","doi":"10.1134/s1064226924700141","DOIUrl":"https://doi.org/10.1134/s1064226924700141","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Mathematical and simulation models of network nodes and the simplest topologies of modern data transmission networks are developed. The functional model of a modern network node is described, and its mathematical model is developed. A simulation model of a topology consisting of network nodes is developed to evaluate probabilistic and temporal indicators of the service quality of a communication network. Based on the simulation model, the probability of packet loss is plotted versus the packet arrival rate for the topology under study.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Occlusion Handling in Depth Estimation of a Scene from a Given Light Field Using a Geodesic Distance and the Principle of Symmetry of the View 利用大地测量距离和视图对称原理，在根据给定光场对场景进行深度估计时处理遮挡问题
IF 0.5 4区 计算机科学
Journal of Communications Technology and Electronics Pub Date : 2024-09-11 DOI: 10.1134/s1064226924700177
M. G. Mozerov, V. N. Karnaukhov, V. I. Kober, L. V. Zimina
{"title":"Occlusion Handling in Depth Estimation of a Scene from a Given Light Field Using a Geodesic Distance and the Principle of Symmetry of the View","authors":"M. G. Mozerov, V. N. Karnaukhov, V. I. Kober, L. V. Zimina","doi":"10.1134/s1064226924700177","DOIUrl":"https://doi.org/10.1134/s1064226924700177","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">\u0000<b>Abstract</b>—</h3><p>The problem of depth estimation of a scene from a given light field can be reduced to the problem of classical stereo matching with the statement that matching pixels in stereo images have the same brightness values. However, this assumption is generally incorrect, given the presence of noise in the images and the different illumination of the left and right images in the stereo pair, as well as the existence of occlusions. In this regard, the luminous flux, representing 80 images pairwise epipolar to the central one, offers a number of advantages, especially in terms of occlusion handling. In this paper, we propose the principle of viewing symmetry: if a pixel of the central image lies in the occlusion zone relative to one of the peripheral images of the light field, then this pixel does not belong to the occlusion zone for an axisymmetric image of the peripheral field. Thus, it is possible to form a robust volume of discrepancy weights relative to the occlusion. As a result, the algorithm proposed in the article significantly improves the result of the scene depth reconstruction. The effectiveness of our approach is demonstrated using the main test database of the light field and comparing it with the best reconstruction algorithms in the efficiency of border recognition and in the speed of calculation.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142224381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Minimization of Forecast Variance Using an Example of ETS Models 以 ETS 模型为例最小化预测方差
IF 0.5 4区 计算机科学
Journal of Communications Technology and Electronics Pub Date : 2024-09-11 DOI: 10.1134/s1064226924700153
N. V. Beletskaya, D. A. Petrusevich
{"title":"Minimization of Forecast Variance Using an Example of ETS Models","authors":"N. V. Beletskaya, D. A. Petrusevich","doi":"10.1134/s1064226924700153","DOIUrl":"https://doi.org/10.1134/s1064226924700153","url":null,"abstract":"<p><b>Abstract</b>—Construction of a combined model of time series (for two models of the same type that exhibit additivity, for example, ARIMA) or a combined forecast of models (in the absence of additivity, for example, for ETS models) providing minimization of the estimated forecast variance is considered. As distinct from alternative models of time series in which the forecast variance is estimated using the Student test, the ARIMA and ETS models allow construction of a function that is related to the parameters of model. Thus, it is possible to estimate the value of the confidence interval for the forecast and construct combinations of models with a minimum estimate of the width of the interval depending on the parameters of the combination. The theoretical part of the work studies linear combinations of forecasts of two models, in which the estimate of forecast variance is minimized (regardless of the type of model). The Hessian of the function for estimating the forecast variance is obtained for construction of a linear combination of forecasts. It is analyzed under the conditions for extremum (zero first derivatives of the function for estimating the variance of the forecast for the combined models). Then, the Hessian is estimated for several groups of ETS models, and the conditions for the presence of a minimum of the estimated forecast variance at a stationary point are considered versus parameters of models.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142185991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Superpixel-Segmentation Based on Energy Minimization and Convolution with the Geodesic Distance Kernel 基于能量最小化和卷积大地距离核的超像素分割技术
IF 0.5 4区 计算机科学
Journal of Communications Technology and Electronics Pub Date : 2024-09-11 DOI: 10.1134/s1064226924700189
V. N. Karnaukhov, V. I. Kober, M. G. Mozerov, L. V. Zimina
{"title":"Superpixel-Segmentation Based on Energy Minimization and Convolution with the Geodesic Distance Kernel","authors":"V. N. Karnaukhov, V. I. Kober, M. G. Mozerov, L. V. Zimina","doi":"10.1134/s1064226924700189","DOIUrl":"https://doi.org/10.1134/s1064226924700189","url":null,"abstract":"<p><b>Abstract</b>—The energy minimization or maximum a posteriori probability (MAP) method is the basis for solving many computer vision problems, including the segmentation problem. However, it is assumed that the number of regions during segmentation is quite small. At the same time, in the problem of superpixel segmentation or otherwise excessive segmentation, the number of such areas exceeds 1000, which makes the computational optimization problem by the MAP method practically impossible. In this paper, we propose a solution that reduces segmentation with any number of areas to the problem of marking only nine labels. In addition, convolution with the geodesic distance kernel is used to enhance the robustness of optimization. This makes it possible to obtain single-linked superpixels at the output of the algorithm, unlike many other methods that require additional adjustments. The effectiveness of the proposed method is compared and measured by the precision-recall criteria, as well as by visual illustration.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142185992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Packet Duplication for Improving Throughput of the Multi-Link Devices in Wi-Fi 7 Networks 利用数据包复制提高 Wi-Fi 7 网络中多链路设备的吞吐量
IF 0.5 4区 计算机科学
Journal of Communications Technology and Electronics Pub Date : 2024-07-29 DOI: 10.1134/s1064226924700128
V. D. Paroshin, I. A. Levitsky, V. A. Loginov, E. M. Khorov
{"title":"Packet Duplication for Improving Throughput of the Multi-Link Devices in Wi-Fi 7 Networks","authors":"V. D. Paroshin, I. A. Levitsky, V. A. Loginov, E. M. Khorov","doi":"10.1134/s1064226924700128","DOIUrl":"https://doi.org/10.1134/s1064226924700128","url":null,"abstract":"<p><b>Abstract</b>—Multi-link operation (MLO) is one of the main innovations of the upcoming IEEE 802.11be standard. MLO uses a common sliding window for all links to control the delivery of packets. Due to the finiteness of the sliding window, transmission of packets on one link may result in packet shortages on other links, reducing throughput. To avoid it, an aggregation algorithm is required that selects the number and packets to be transmitted. In this paper, the known algorithms are extended by sending duplicates. Simulations have confirmed that duplicates can increase the Multi-Link Device (MLD) throughput by accelerating the sliding window progression.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141867070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Harmonization of Hyperspectral and Multispectral Data for Calculation of Vegetation Index 协调高光谱和多光谱数据以计算植被指数
IF 0.5 4区 计算机科学
Journal of Communications Technology and Electronics Pub Date : 2024-07-29 DOI: 10.1134/s1064226924700104
A. L. Nurmukhametov, D. S. Sidorchuk, R. V. Skidanov
{"title":"Harmonization of Hyperspectral and Multispectral Data for Calculation of Vegetation Index","authors":"A. L. Nurmukhametov, D. S. Sidorchuk, R. V. Skidanov","doi":"10.1134/s1064226924700104","DOIUrl":"https://doi.org/10.1134/s1064226924700104","url":null,"abstract":"<p><b>Abstract</b>—Hyperspectral analysis is a powerful tool in the precision agriculture arsenal that becomes increasingly accessible. The number of hyperspectral images obtained near the Earth surface is constantly growing. It is important to consistently use this data along with conventional data of multispectral monitoring. In this work, problem of harmonization of hyperspectral survey data obtained at the surface of the Earth and satellite multispectral monitoring data is investigated. The problem of spectral harmonization, which is insoluble in general case, is further complicated in this case by the heterogeneity of the available data. In this regard, a simplified formulation of the harmonization problem is considered, aimed at calculation of vegetation indices. A novel method has been developed that does not require pixelwise matching or calibration panels. The experimental part of the work shows that the proposed method allows significant compensation for shifts of the NDVI and WBI, observed in the absence of harmonization.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141867176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Performance Study of the PRAW Mechanism with Slots of Arbitrary Duration in Wi-Fi HaLow Networks Wi-Fi HaLow 网络中具有任意时隙的 PRAW 机制的性能研究
IF 0.5 4区 计算机科学
Journal of Communications Technology and Electronics Pub Date : 2024-07-29 DOI: 10.1134/s1064226924700049
M. V. Shlapak, R. R. Yusupov, A. I. Lyakhov
{"title":"Performance Study of the PRAW Mechanism with Slots of Arbitrary Duration in Wi-Fi HaLow Networks","authors":"M. V. Shlapak, R. R. Yusupov, A. I. Lyakhov","doi":"10.1134/s1064226924700049","DOIUrl":"https://doi.org/10.1134/s1064226924700049","url":null,"abstract":"<p><b>Abstract</b>—The rapid growth in the number of smart devices capable of exchanging data within a single network leads to the emergence of mechanisms that allow adapting data transmission technologies to the Internet of Things networks. One of them is the mechanism of the periodic restricted access window (PRAW) presented in the 802.11ah standard. A competent choice of parameters of the PRAW mechanism allows a large number of sensors to transmit data quickly and energy-efficiently, but the 802.11ah standard itself does not give recommendations on their choice. This article solves the following optimization problems: minimizing (a) the average delay, (b) the average energy consumption per transmitted packet when the average delay limit is met, and (c) the share of channel time consumed by the PRAW mechanism when the restrictions on both metrics are met. Based on the results of solving these problems, we give recommendations on the choice of PRAW parameters for different network loads determined by the intensity of packet generation and the number of stations.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141867066","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Study of an Adaptive Waiting Control Algorithm for Channel Access in IEEE 8012.11be Networks 研究 IEEE 8012.11be 网络中信道接入的自适应等待控制算法
IF 0.5 4区 计算机科学
Journal of Communications Technology and Electronics Pub Date : 2024-07-29 DOI: 10.1134/s106422692470013x
D. V. Bankov, E. S. Bogdanov, I. A. Levitsky, V. A. Loginov, E. M. Khorov
{"title":"Study of an Adaptive Waiting Control Algorithm for Channel Access in IEEE 8012.11be Networks","authors":"D. V. Bankov, E. S. Bogdanov, I. A. Levitsky, V. A. Loginov, E. M. Khorov","doi":"10.1134/s106422692470013x","DOIUrl":"https://doi.org/10.1134/s106422692470013x","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>To increase throughput of Wi-Fi networks, the IEEE 802.11be standard has introduced a multi-link operation feature that enables devices to transmit and receive data in multiple channels. The article studies an adaptive waiting control algorithm for channel access by multi-link devices (MLDs) incapable of simultaneous transmission and reception (NSTR) at different channels. The algorithm features accounting for the channel capacities, the number of single-link devices in the network, and the traffic intensity in the channels. The simulation shows high performance of the proposed algorithm.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141867173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fundamentals of Design and Operation of Reconfigurable Intelligent Surfaces 可重构智能表面的设计与操作基础
IF 0.5 4区 计算机科学
Journal of Communications Technology and Electronics Pub Date : 2024-07-29 DOI: 10.1134/s1064226924700062
A. S. Tyarin, A. A. Kureev, E. M. Khorov
{"title":"Fundamentals of Design and Operation of Reconfigurable Intelligent Surfaces","authors":"A. S. Tyarin, A. A. Kureev, E. M. Khorov","doi":"10.1134/s1064226924700062","DOIUrl":"https://doi.org/10.1134/s1064226924700062","url":null,"abstract":"<p><b>Abstract</b>—Reconfigurable intelligent surfaces (RISs) are a promising technology for increasing the information capacity and coverage of future wireless networks. Various available types of these devices consist of different elements that can be used for signal absorption, increasing the information capacity, and phase shift keying. This causes a lack of a single concept and misunderstanding of functionality of specific RISs. The aim of this study is to eliminate this gap by describing one of the most widely used RIS structures and its operating principles, which make it possible to formulate the main functionalities of the RIS.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141867177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信