首页 > 最新文献

PATTERN RECOGNITION AND IMAGE ANALYSIS最新文献

英文 中文
Diabetic Retinopathy Fundus Image Classification Using Ensemble Methods 利用集合方法进行糖尿病视网膜病变眼底图像分类
IF 1 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-04 DOI: 10.1134/s1054661824700123
Marina M. Lukashevich

Abstract

Diabetic retinopathy causes damage to the retina of the eye and leads to poor vision in patients with diabetes around the world. It affects the retina of a person’s eye, begins asymptomatically, and can lead to complete loss of vision. Screening for this disease can be done fairly quickly by using machine learning algorithms to analyze retinal images. Early diagnosis is crucial to prevent dangerous consequences such as blindness. This paper presents the results of implementation and comparison of ensemble machine learning algorithms and describes an approach to the selection of hyperparameters for solving screening problems (binary classification) and classifying the stage of diabetic retinopathy (from 0 to 4). Particular attention is paid to the approaches of searching for hyperparameters on a lattice and random search. This study uses a hyperparameter selection mechanism for ensemble algorithms based on a combination of grid search and random search approaches. The selection of hyperparameters, as well as the selection of informative features, made it possible to increase the accuracy of classification of retinal images. The experimental results showed an accuracy of 0.7531 for retinal image classification on the test dataset for the best model (gradient boosting, GB). When considering a binary classification (presence or absence of diabetic retinopathy), an accuracy of 0.9400 (gradient boosting, GB) was achieved.

摘要 糖尿病视网膜病变会对眼睛视网膜造成损害,导致世界各地的糖尿病患者视力下降。糖尿病视网膜病变会影响患者眼睛的视网膜,开始时无症状,可导致视力完全丧失。通过使用机器学习算法分析视网膜图像,可以相当快速地筛查出这种疾病。早期诊断对于防止失明等危险后果至关重要。本文介绍了集合机器学习算法的实施和比较结果,并描述了一种选择超参数的方法,用于解决筛查问题(二元分类)和糖尿病视网膜病变阶段分类(从 0 到 4)。研究特别关注了在网格上搜索超参数和随机搜索的方法。本研究在结合网格搜索和随机搜索方法的基础上,为集合算法采用了超参数选择机制。超参数的选择以及信息特征的选择使视网膜图像分类的准确率得以提高。实验结果表明,最佳模型(梯度提升,GB)在测试数据集上的视网膜图像分类准确率为 0.7531。当考虑二元分类(是否存在糖尿病视网膜病变)时,准确率达到 0.9400(梯度增强,GB)。
{"title":"Diabetic Retinopathy Fundus Image Classification Using Ensemble Methods","authors":"Marina M. Lukashevich","doi":"10.1134/s1054661824700123","DOIUrl":"https://doi.org/10.1134/s1054661824700123","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Diabetic retinopathy causes damage to the retina of the eye and leads to poor vision in patients with diabetes around the world. It affects the retina of a person’s eye, begins asymptomatically, and can lead to complete loss of vision. Screening for this disease can be done fairly quickly by using machine learning algorithms to analyze retinal images. Early diagnosis is crucial to prevent dangerous consequences such as blindness. This paper presents the results of implementation and comparison of ensemble machine learning algorithms and describes an approach to the selection of hyperparameters for solving screening problems (binary classification) and classifying the stage of diabetic retinopathy (from 0 to 4). Particular attention is paid to the approaches of searching for hyperparameters on a lattice and random search. This study uses a hyperparameter selection mechanism for ensemble algorithms based on a combination of grid search and random search approaches. The selection of hyperparameters, as well as the selection of informative features, made it possible to increase the accuracy of classification of retinal images. The experimental results showed an accuracy of 0.7531 for retinal image classification on the test dataset for the best model (gradient boosting, GB). When considering a binary classification (presence or absence of diabetic retinopathy), an accuracy of 0.9400 (gradient boosting, GB) was achieved.</p>","PeriodicalId":35400,"journal":{"name":"PATTERN RECOGNITION AND IMAGE ANALYSIS","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141546348","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}
引用次数: 0
Automatic Analysis of Walking Steps 自动分析步行步数
IF 1 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-04 DOI: 10.1134/s1054661824700147
Shiping Ye, Olga Nedzvedz, Chaoxiang Chen, Victor Anosov, Alexander Nedzved

Abstract

Tracking the movement and changes in the position of the human skeleton is a key element of algorithms for describing human pose. Detection of changes in the position of the skeleton allows one to obtain a lot of important information for orthopedic problems. This article proposes an algorithm for automatic estimation of walking motion on the basis of the reconstruction of the human skeleton and determination of the harmonic component of walking.

摘要跟踪人体骨骼的运动和位置变化是描述人体姿势算法的关键要素。检测骨架位置的变化可以为矫形问题提供许多重要信息。本文提出了一种在重建人体骨骼和确定行走谐波分量的基础上自动估计行走运动的算法。
{"title":"Automatic Analysis of Walking Steps","authors":"Shiping Ye, Olga Nedzvedz, Chaoxiang Chen, Victor Anosov, Alexander Nedzved","doi":"10.1134/s1054661824700147","DOIUrl":"https://doi.org/10.1134/s1054661824700147","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Tracking the movement and changes in the position of the human skeleton is a key element of algorithms for describing human pose. Detection of changes in the position of the skeleton allows one to obtain a lot of important information for orthopedic problems. This article proposes an algorithm for automatic estimation of walking motion on the basis of the reconstruction of the human skeleton and determination of the harmonic component of walking.</p>","PeriodicalId":35400,"journal":{"name":"PATTERN RECOGNITION AND IMAGE ANALYSIS","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141546350","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}
引用次数: 0
An Approach to Pruning the Structure of Convolutional Neural Networks without Loss of Generalization Ability 在不损失泛化能力的情况下修剪卷积神经网络结构的方法
IF 1 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-04 DOI: 10.1134/s1054661824700056
Chaoxiang Chen, Aliaksandr Kroshchanka, Vladimir Golovko, Olha Golovko

Abstract

This paper proposes an approach to pruning the parameters of convolutional neural networks using unsupervised pretraining. The authors demonstrate that the proposed approach makes it possible to reduce the number of configurable parameters of a convolutional neural network without loss of generalization ability. A comparison of the proposed approach and existing pruning techniques is made. The capabilities of the proposed algorithm are demonstrated on classical CIFAR10 and CIFAR100 computer vision samples.

摘要 本文提出了一种利用无监督预训练修剪卷积神经网络参数的方法。作者证明,所提出的方法可以减少卷积神经网络可配置参数的数量,而不会损失泛化能力。作者对所提出的方法和现有的剪枝技术进行了比较。在经典的 CIFAR10 和 CIFAR100 计算机视觉样本上演示了所提算法的能力。
{"title":"An Approach to Pruning the Structure of Convolutional Neural Networks without Loss of Generalization Ability","authors":"Chaoxiang Chen, Aliaksandr Kroshchanka, Vladimir Golovko, Olha Golovko","doi":"10.1134/s1054661824700056","DOIUrl":"https://doi.org/10.1134/s1054661824700056","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>This paper proposes an approach to pruning the parameters of convolutional neural networks using unsupervised pretraining. The authors demonstrate that the proposed approach makes it possible to reduce the number of configurable parameters of a convolutional neural network without loss of generalization ability. A comparison of the proposed approach and existing pruning techniques is made. The capabilities of the proposed algorithm are demonstrated on classical CIFAR10 and CIFAR100 computer vision samples.</p>","PeriodicalId":35400,"journal":{"name":"PATTERN RECOGNITION AND IMAGE ANALYSIS","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141546341","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}
引用次数: 0
Image Inpainting by Machine Learning Algorithms 用机器学习算法绘制图像
IF 1 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-04 DOI: 10.1134/s1054661824700032
Qing Bu, Wei Wan, Ivan Leonov

Abstract

Image inpainting is the process of filling in missing or damaged areas of images. In recent years, this area has received significant development, mainly owing to machine learning methods. Generative adversarial networks are a powerful tool for creating synthetic images. They are trained to create images similar to the original dataset. The use of such neural networks is not limited to creating realistic images. In areas where privacy is important, such as healthcare or finance, they help generate synthetic data that preserves the overall structure and statistical characteristics, but does not contain the sensitive information of individuals. However, direct use of this architecture will result in the generation of a completely new image. In the case where it is possible to indicate the location of confidential information on an image, it is advisable to use image inpainting in order to replace only the secret information with synthetic information. This paper discusses key approaches to solving this problem, as well as corresponding neural network architectures. Questions are also raised about the use of these algorithms to protect confidential image information, as well as the possibility of using these models when developing new applications.

摘要 图像内绘是对图像缺失或损坏区域进行填充的过程。近年来,这一领域得到了长足的发展,这主要归功于机器学习方法。生成对抗网络是创建合成图像的强大工具。经过训练,它们可以创建与原始数据集相似的图像。这类神经网络的使用不仅限于创建逼真的图像。在医疗保健或金融等重视隐私的领域,它们有助于生成保留整体结构和统计特征,但不包含个人敏感信息的合成数据。不过,直接使用这种架构会生成全新的图像。如果有可能在图像上标出机密信息的位置,最好使用图像涂抹技术,只用合成信息替换机密信息。本文讨论了解决这一问题的主要方法以及相应的神经网络架构。本文还提出了使用这些算法保护机密图像信息的问题,以及在开发新应用时使用这些模型的可能性。
{"title":"Image Inpainting by Machine Learning Algorithms","authors":"Qing Bu, Wei Wan, Ivan Leonov","doi":"10.1134/s1054661824700032","DOIUrl":"https://doi.org/10.1134/s1054661824700032","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Image inpainting is the process of filling in missing or damaged areas of images. In recent years, this area has received significant development, mainly owing to machine learning methods. Generative adversarial networks are a powerful tool for creating synthetic images. They are trained to create images similar to the original dataset. The use of such neural networks is not limited to creating realistic images. In areas where privacy is important, such as healthcare or finance, they help generate synthetic data that preserves the overall structure and statistical characteristics, but does not contain the sensitive information of individuals. However, direct use of this architecture will result in the generation of a completely new image. In the case where it is possible to indicate the location of confidential information on an image, it is advisable to use image inpainting in order to replace only the secret information with synthetic information. This paper discusses key approaches to solving this problem, as well as corresponding neural network architectures. Questions are also raised about the use of these algorithms to protect confidential image information, as well as the possibility of using these models when developing new applications.</p>","PeriodicalId":35400,"journal":{"name":"PATTERN RECOGNITION AND IMAGE ANALYSIS","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141552377","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}
引用次数: 0
No-Reference Image Quality Assessment Based on Machine Learning and Outlier Entropy Samples 基于机器学习和离群熵样本的无参考图像质量评估
IF 1 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-04 DOI: 10.1134/s105466182470007x
Ana Gavrovska, Andreja Samčović, Dragi Dujković

Abstract

A growing research is focusing on approaches for assessing image quality as a result of advancements in digital imaging. Thus, there is an increasing demand for efficient no-reference image quality assessment methods, as many real-world, everyday applications lack distortion-free, i.e., pristine versions of images. This paper presents a new no-reference image quality outlier entropy perception evaluator method for the objective evaluation of real-world distorted images based on natural scene statistics and mean subtracted and contrast normalized coefficients. Distribution of the coefficients is found useful for no-reference image quality assessment, where their characteristics are investigated here. Moreover, entropies such as Shannon and approximate entropies are found suitable for quality estimation. Recent studies show perception-based approaches that demonstrate differences in correlation with subjective assessments. Similar variations are exhibited in entropy domain showing sample outliers compared to other distorted images with different distortion levels. In order to address these variations, this work presents outlier entropy perception evaluator model based on machine learning in order to describe the diversity of distortions affecting entropy and subjective scoring. Patch extraction is employed in the approach, where distortion level is estimated. The evaluatior model is found to be efficient presenting advantages using Shannon and approximate entropies and outlier detection over available perception-based image quality evaluators. The obtained results using proposed model show significant improvements in the correlation with human perceptual quality ratings.

摘要 由于数字成像技术的进步,越来越多的研究集中在图像质量的评估方法上。因此,对高效的无参照图像质量评估方法的需求与日俱增,因为现实世界中的许多日常应用缺乏无失真图像,即原始版本的图像。本文提出了一种新的无参考图像质量离群熵感知评估方法,用于客观评估现实世界中基于自然场景统计和均值减去及对比度归一化系数的失真图像。系数的分布对无参考图像质量评估非常有用,这里对其特征进行了研究。此外,香农熵和近似熵等熵值也适用于质量评估。最近的研究表明,基于感知的方法与主观评估的相关性存在差异。与其他具有不同失真度的失真图像相比,熵域也显示出类似的异常值。为了解决这些差异,这项工作提出了基于机器学习的离群值熵感知评估模型,以描述影响熵和主观评分的失真多样性。该方法采用了补丁提取,对失真程度进行估计。与现有的基于感知的图像质量评价器相比,该评价器模型利用香农熵和近似熵以及离群点检测,具有高效的优势。使用建议模型获得的结果显示,与人类感知质量评级的相关性有了显著提高。
{"title":"No-Reference Image Quality Assessment Based on Machine Learning and Outlier Entropy Samples","authors":"Ana Gavrovska, Andreja Samčović, Dragi Dujković","doi":"10.1134/s105466182470007x","DOIUrl":"https://doi.org/10.1134/s105466182470007x","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>A growing research is focusing on approaches for assessing image quality as a result of advancements in digital imaging. Thus, there is an increasing demand for efficient no-reference image quality assessment methods, as many real-world, everyday applications lack distortion-free, i.e., pristine versions of images. This paper presents a new no-reference image quality outlier entropy perception evaluator method for the objective evaluation of real-world distorted images based on natural scene statistics and mean subtracted and contrast normalized coefficients. Distribution of the coefficients is found useful for no-reference image quality assessment, where their characteristics are investigated here. Moreover, entropies such as Shannon and approximate entropies are found suitable for quality estimation. Recent studies show perception-based approaches that demonstrate differences in correlation with subjective assessments. Similar variations are exhibited in entropy domain showing sample outliers compared to other distorted images with different distortion levels. In order to address these variations, this work presents outlier entropy perception evaluator model based on machine learning in order to describe the diversity of distortions affecting entropy and subjective scoring. Patch extraction is employed in the approach, where distortion level is estimated. The evaluatior model is found to be efficient presenting advantages using Shannon and approximate entropies and outlier detection over available perception-based image quality evaluators. The obtained results using proposed model show significant improvements in the correlation with human perceptual quality ratings.</p>","PeriodicalId":35400,"journal":{"name":"PATTERN RECOGNITION AND IMAGE ANALYSIS","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141546342","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}
引用次数: 0
Algorithms of Isomorphism of Elementary Conjunctions Checking 基本连接词同构检查算法
IF 1 Q3 Computer Science Pub Date : 2024-04-10 DOI: 10.1134/s1054661824010103
T. Kosovskaya, Juan Zhou

Abstract

When solving artificial intelligence problems related to the study of complex structured objects, a convenient tool for describing such objects is the language of predicate calculus. The paper presents two algorithms for checking the isomorphism of pairs of elementary conjunctions of predicate formulas (they coincide up to variable names and the order of conjunctive terms). The first of the algorithms checks elementary conjunctions containing a single predicate symbol for isomorphism. Furthermore, if the formulas are isomorphic, it finds a one-to-one correspondence between the arguments of these formulas. If all predicates are binary, the proposed algorithm is an algorithm for checking two directed graphs for isomorphism. The second algorithm checks elementary conjunctions containing multiple predicate symbols for isomorphism. Estimates of their time complexity are given for both algorithms.

摘要在解决与研究复杂结构对象有关的人工智能问题时,谓词微积分语言是描述这类对象的一个方便工具。本文提出了两种算法,用于检查谓词公式的基本连接词对的同构性(它们在变量名和连接词顺序上重合)。第一种算法检查包含单个谓词符号的基本连接词是否同构。此外,如果公式是同构的,它还会在这些公式的参数之间找到一一对应的关系。如果所有谓词都是二进制的,那么所提出的算法就是检查两个有向图是否同构的算法。第二种算法检查包含多个谓词符号的基本连接词是否同构。这两种算法都给出了时间复杂度的估计值。
{"title":"Algorithms of Isomorphism of Elementary Conjunctions Checking","authors":"T. Kosovskaya, Juan Zhou","doi":"10.1134/s1054661824010103","DOIUrl":"https://doi.org/10.1134/s1054661824010103","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>When solving artificial intelligence problems related to the study of complex structured objects, a convenient tool for describing such objects is the language of predicate calculus. The paper presents two algorithms for checking the isomorphism of pairs of elementary conjunctions of predicate formulas (they coincide up to variable names and the order of conjunctive terms). The first of the algorithms checks elementary conjunctions containing a single predicate symbol for isomorphism. Furthermore, if the formulas are isomorphic, it finds a one-to-one correspondence between the arguments of these formulas. If all predicates are binary, the proposed algorithm is an algorithm for checking two directed graphs for isomorphism. The second algorithm checks elementary conjunctions containing multiple predicate symbols for isomorphism. Estimates of their time complexity are given for both algorithms.</p>","PeriodicalId":35400,"journal":{"name":"PATTERN RECOGNITION AND IMAGE ANALYSIS","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140603108","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}
引用次数: 0
Unconditional Convergence of Sub-Gaussian Random Series 亚高斯随机序列的无条件收敛性
IF 1 Q3 Computer Science Pub Date : 2024-04-10 DOI: 10.1134/s1054661824010061
G. Giorgobiani, V. Kvaratskhelia, M. Menteshashvili

Abstract

In this paper we explore the basic properties of sub-Gaussian random variables and random elements. We also present various notions of subgaussianity (weak, ({mathbf{T}})- and ({mathbf{F}})-subgaussianity) of random elements with values in general Banach spaces. It is shown that the covariance operator of ({mathbf{T}})-subgaussian random element is Gaussian and some consequences of this result in spaces possessing certain geometric properties are noted. Moreover, the almost sure (a.s.) unconditional convergence of random series are considered and a sufficient condition of a.s. unconditional convergence of a random series of a special type with values in a Banach space with some geometric properties is proved. By the a.s. unconditional convergence of random series we understand the convergence of all rearrangements of the series on the same set of probability 1. With some effort, we prove one of the main results of the paper, which gives us a necessary condition for the a.s. unconditional convergence of random series of a special type in a general Banach space. For the proof, a lemma is used that establishes a connection between the moments of a random variable and which may be of independent interest.

摘要 本文探讨了亚高斯随机变量和随机元素的基本性质。我们还提出了在一般巴拿赫空间中取值的随机元素的亚高斯性(弱、({mathbf{T}})-和({mathbf{F}})-亚高斯性)的各种概念。研究表明,({mathbf{T}})-次高斯随机元素的协方差算子是高斯的,并指出了这一结果在具有某些几何性质的空间中的一些后果。此外,还考虑了随机数列的几乎确定(a.s. )无条件收敛,并证明了在具有某些几何性质的巴拿赫空间中取值的特殊类型随机数列的a.s. 无条件收敛的充分条件。通过随机数列的 a.s.无条件收敛,我们理解了在概率为 1 的同一集合上数列的所有重排的收敛。经过一番努力,我们证明了本文的主要结果之一,它给出了在一般巴拿赫空间中特殊类型随机数列无条件收敛的必要条件。为了证明这一点,我们使用了一个在随机变量的矩之间建立联系的 Lemma,它可能会引起我们的兴趣。
{"title":"Unconditional Convergence of Sub-Gaussian Random Series","authors":"G. Giorgobiani, V. Kvaratskhelia, M. Menteshashvili","doi":"10.1134/s1054661824010061","DOIUrl":"https://doi.org/10.1134/s1054661824010061","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>In this paper we explore the basic properties of sub-Gaussian random variables and random elements. We also present various notions of subgaussianity (weak, <span>({mathbf{T}})</span>- and <span>({mathbf{F}})</span>-subgaussianity) of random elements with values in general Banach spaces. It is shown that the covariance operator of <span>({mathbf{T}})</span>-subgaussian random element is Gaussian and some consequences of this result in spaces possessing certain geometric properties are noted. Moreover, the almost sure (a.s.) unconditional convergence of random series are considered and a sufficient condition of a.s. unconditional convergence of a random series of a special type with values in a Banach space with some geometric properties is proved. By the a.s. unconditional convergence of random series we understand the convergence of all rearrangements of the series on the same set of probability 1. With some effort, we prove one of the main results of the paper, which gives us a necessary condition for the a.s. unconditional convergence of random series of a special type in a general Banach space. For the proof, a lemma is used that establishes a connection between the moments of a random variable and which may be of independent interest.</p>","PeriodicalId":35400,"journal":{"name":"PATTERN RECOGNITION AND IMAGE ANALYSIS","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140590707","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}
引用次数: 0
AI-Based Drone Assisted Human Rescue in Disaster Environments: Challenges and Opportunities 灾难环境中基于人工智能的无人机辅助人类救援:挑战与机遇
IF 1 Q3 Computer Science Pub Date : 2024-04-10 DOI: 10.1134/s1054661824010152
Narek Papyan, Michel Kulhandjian, Hovannes Kulhandjian, Levon Aslanyan

Abstract

In this survey we are focusing on utilizing drone-based systems for the detection of individuals, particularly by identifying human screams and other distress signals. This study has significant relevance in post-disaster scenarios, including events such as earthquakes, hurricanes, military conflicts, wildfires, and more. These drones are capable of hovering over disaster-stricken areas that may be challenging for rescue teams to access directly, enabling them to pinpoint potential locations where people might be trapped. Drones can cover larger areas in shorter timeframes compared to ground-based rescue efforts or even specially trained search dogs. Unmanned aerial vehicles (UAVs), commonly referred to as drones, are frequently deployed for search-and-rescue missions during disaster situations. Typically, drones capture aerial images to assess structural damage and identify the extent of the disaster. They also employ thermal imaging technology to detect body heat signatures, which can help locate individuals. In some cases, larger drones are used to deliver essential supplies to people stranded in isolated disaster-stricken areas. In our discussions, we delve into the unique challenges associated with locating humans through aerial acoustics. The auditory system must distinguish between human cries and sounds that occur naturally, such as animal calls and wind. Additionally, it should be capable of recognizing distinct patterns related to signals like shouting, clapping, or other ways in which people attempt to signal rescue teams. To tackle this challenge, one solution involves harnessing artificial intelligence (AI) to analyze sound frequencies and identify common audio “signatures.” Deep learning-based networks, such as convolutional neural networks (CNNs), can be trained using these signatures to filter out noise generated by drone motors and other environmental factors. Furthermore, employing signal processing techniques like the direction of arrival (DOA) based on microphone array signals can enhance the precision of tracking the source of human noises.

摘要 在本研究中,我们将重点关注利用基于无人机的系统进行个人探测,特别是通过识别人类的尖叫声和其他求救信号。这项研究对灾后场景具有重要意义,包括地震、飓风、军事冲突、野火等事件。这些无人机能够在救援队难以直接进入的受灾地区上空盘旋,使他们能够确定人员可能被困的潜在地点。与地面救援工作甚至是经过专门训练的搜救犬相比,无人机可以在更短的时间内覆盖更大的区域。无人驾驶飞行器(UAV),通常被称为无人机,经常被部署在灾难情况下的搜救任务中。通常情况下,无人机会捕捉空中图像,以评估结构损坏情况并确定灾害范围。它们还采用热成像技术来探测人体热量特征,从而帮助确定人员位置。在某些情况下,大型无人机被用来向被困在偏僻灾区的人们运送必需品。在讨论中,我们深入探讨了通过航空声学定位人类所面临的独特挑战。听觉系统必须区分人类的叫声和自然发出的声音,如动物的叫声和风声。此外,它还应该能够识别与喊叫、鼓掌等信号相关的独特模式,或人们试图向救援队发出信号的其他方式。为了应对这一挑战,一种解决方案是利用人工智能(AI)来分析声音频率并识别常见的音频 "特征"。基于深度学习的网络,如卷积神经网络(CNN),可以利用这些特征进行训练,以过滤无人机马达和其他环境因素产生的噪音。此外,采用基于麦克风阵列信号的到达方向(DOA)等信号处理技术,可以提高追踪人类噪音来源的精度。
{"title":"AI-Based Drone Assisted Human Rescue in Disaster Environments: Challenges and Opportunities","authors":"Narek Papyan, Michel Kulhandjian, Hovannes Kulhandjian, Levon Aslanyan","doi":"10.1134/s1054661824010152","DOIUrl":"https://doi.org/10.1134/s1054661824010152","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>In this survey we are focusing on utilizing drone-based systems for the detection of individuals, particularly by identifying human screams and other distress signals. This study has significant relevance in post-disaster scenarios, including events such as earthquakes, hurricanes, military conflicts, wildfires, and more. These drones are capable of hovering over disaster-stricken areas that may be challenging for rescue teams to access directly, enabling them to pinpoint potential locations where people might be trapped. Drones can cover larger areas in shorter timeframes compared to ground-based rescue efforts or even specially trained search dogs. Unmanned aerial vehicles (UAVs), commonly referred to as drones, are frequently deployed for search-and-rescue missions during disaster situations. Typically, drones capture aerial images to assess structural damage and identify the extent of the disaster. They also employ thermal imaging technology to detect body heat signatures, which can help locate individuals. In some cases, larger drones are used to deliver essential supplies to people stranded in isolated disaster-stricken areas. In our discussions, we delve into the unique challenges associated with locating humans through aerial acoustics. The auditory system must distinguish between human cries and sounds that occur naturally, such as animal calls and wind. Additionally, it should be capable of recognizing distinct patterns related to signals like shouting, clapping, or other ways in which people attempt to signal rescue teams. To tackle this challenge, one solution involves harnessing artificial intelligence (AI) to analyze sound frequencies and identify common audio “signatures.” Deep learning-based networks, such as convolutional neural networks (CNNs), can be trained using these signatures to filter out noise generated by drone motors and other environmental factors. Furthermore, employing signal processing techniques like the direction of arrival (DOA) based on microphone array signals can enhance the precision of tracking the source of human noises.</p>","PeriodicalId":35400,"journal":{"name":"PATTERN RECOGNITION AND IMAGE ANALYSIS","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140590589","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}
引用次数: 0
Maximal k-Sum-Free Collections in an Abelian Group 阿贝尔群中的最大无和集合
IF 1 Q3 Computer Science Pub Date : 2024-04-10 DOI: 10.1134/s1054661824010188
Vahe Sargsyan

Abstract

Let (G) be an Abelian group of order n, let (k geqslant 2) be an integer, and ({{A}_{1}}, ldots ,{{A}_{k}}) be nonempty subsets of (G). The collection (left( {{{A}_{1}}, ldots ,{{A}_{k}}} right)) is called (k)-sum-free (abbreviated (k)-SFC) if the equation ({{x}_{1}} + ldots + {{x}_{k}} = 0) has no solutions in the collection (left( {{{A}_{1}}, ldots ,{{A}_{k}}} right),) where ({{x}_{1}} in {{A}_{1}}), …, ({{x}_{k}} in {{A}_{k}}). The family of (k)-SFC in (G) will be denoted by (SF{{C}_{k}}left( G right)). The collection (left( {{{A}_{1}}, ldots ,{{A}_{k}}} right) in SF{{C}_{k}}left( G right)) is called maximal by capacity if it is maximal by the sum of (left| {{{A}_{1}}} right| + ldots + left| {{{A}_{k}}} right|), and maximal by inclusion if for any (i in left{ {1,...,k} right}) and (x in G{kern 1pt} {{backslash }}{kern 1pt} {{A}_{i}},) the collection (left( {{{A}_{1}},...,{{A}_{{i - 1}}},{{A}_{i}} cup left{ x right},{{A}_{{i + 1}}},...,{{A}_{k}}} right)) ( notin ) (SF{{C}_{k}}left( G right).) Suppose ({{varrho }_{k}}left( G right) = left| {{{A}_{1}}} right| + ldots + left| {{{A}_{k}}} right|.) In this work, we study the problem of the maximal value of ({{varrho }_{k}}left( G right)). In particular, the maximal value of ({{varrho }_{k}}left( {{{Z}_{d}}} right)) for the cyclic group ({{Z}_{d}}) is determined. Upper and lower bounds for ({{varrho }_{k}}left( G right)) are obtained for the Abelian group (G.) The structure of the maximal k-sum-free collection by capacity (by inclusion) is described for an arbitrary cyclic group.

AbstractLet (G) be an Abelian group of order n, let (k geqslant 2) be an integer, and ({{A}_{1}}, ldots ,{{A}_{k}}) be nonempty subsets of (G).如果方程 ({{x}_{1}} + ldots + {{x}_{k}} = 0) 在集合 (left( {{A}_{1}}、ldots ,{{A}_{k}}} right),) where ({{x}_{1}} in {{A}_{1}}), ..., ({{x}_{k}} in {{A}_{k}}).在 (G) 中的(k)-SFC 族将用(SF{{C}_{k}}left( Gright)) 表示。如果 SF{{C}_{k}}left( {{A}_{1}}, ldots ,{{A}_{k}}} right) 中的集合 (left( {{A}_{1}}, ldots ,{{A}_{k}}} right) )是 (left| {{A}_{1}}} right| + ldots + left| {{A}_{k}}} right|) 的和的最大值,那么这个集合就称为容量最大集合、并且如果对于任何 (i in left{{1,....,k})和(x 在 G{kern 1pt} {{backslash }}{{kern 1pt} {{A}_{i}}, )的集合 (left( {{A}_{1}},...,{{A}_{i - 1}}}},{{A}_{i}})cup left{ x right},{{A}_{i + 1}}},...,{{A}_{k}}}})。right)( notin) (SF{{C}_{k}}}left( G right).)Suppose ({{varrho }_{k}}left( G right) = left| {{{A}_{1}}}right| + ldots + left| {{A}_{k}}}right|.)在这项工作中,我们将研究 ({{varrho }_{k}}left( G right)) 的最大值问题。特别是确定了循环群 ({{Z}_{d}}) 的 ({{varrho }_{k}}left( {{{Z}_{d}}} right)) 的最大值。对于阿贝尔群 (G.),得到了 ({{varrho }_{k}}left( {{{Z}_{d}}} right)) 的上界和下界。 对于任意循环群,通过容量(通过包含)描述了最大无 k 和集合的结构。
{"title":"Maximal k-Sum-Free Collections in an Abelian Group","authors":"Vahe Sargsyan","doi":"10.1134/s1054661824010188","DOIUrl":"https://doi.org/10.1134/s1054661824010188","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Let <span>(G)</span> be an Abelian group of order <i>n</i>, let <span>(k geqslant 2)</span> be an integer, and <span>({{A}_{1}}, ldots ,{{A}_{k}})</span> be nonempty subsets of <span>(G)</span>. The collection <span>(left( {{{A}_{1}}, ldots ,{{A}_{k}}} right))</span> is called <span>(k)</span>-sum-free (abbreviated <span>(k)</span>-<i>SFC</i>) if the equation <span>({{x}_{1}} + ldots + {{x}_{k}} = 0)</span> has no solutions in the collection <span>(left( {{{A}_{1}}, ldots ,{{A}_{k}}} right),)</span> where <span>({{x}_{1}} in {{A}_{1}})</span>, …, <span>({{x}_{k}} in {{A}_{k}})</span>. The family of <span>(k)</span>-<i>SFC</i> in <span>(G)</span> will be denoted by <span>(SF{{C}_{k}}left( G right))</span>. The collection <span>(left( {{{A}_{1}}, ldots ,{{A}_{k}}} right) in SF{{C}_{k}}left( G right))</span> is called maximal by capacity if it is maximal by the sum of <span>(left| {{{A}_{1}}} right| + ldots + left| {{{A}_{k}}} right|)</span>, and maximal by inclusion if for any <span>(i in left{ {1,...,k} right})</span> and <span>(x in G{kern 1pt} {{backslash }}{kern 1pt} {{A}_{i}},)</span> the collection <span>(left( {{{A}_{1}},...,{{A}_{{i - 1}}},{{A}_{i}} cup left{ x right},{{A}_{{i + 1}}},...,{{A}_{k}}} right))</span> <span>( notin )</span> <span>(SF{{C}_{k}}left( G right).)</span> Suppose <span>({{varrho }_{k}}left( G right) = left| {{{A}_{1}}} right| + ldots + left| {{{A}_{k}}} right|.)</span> In this work, we study the problem of the maximal value of <span>({{varrho }_{k}}left( G right))</span>. In particular, the maximal value of <span>({{varrho }_{k}}left( {{{Z}_{d}}} right))</span> for the cyclic group <span>({{Z}_{d}})</span> is determined. Upper and lower bounds for <span>({{varrho }_{k}}left( G right))</span> are obtained for the Abelian group <span>(G.)</span> The structure of the maximal <i>k</i>-sum-free collection by capacity (by inclusion) is described for an arbitrary cyclic group.</p>","PeriodicalId":35400,"journal":{"name":"PATTERN RECOGNITION AND IMAGE ANALYSIS","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140590808","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}
引用次数: 0
On Hamiltonian Cycles in a 2-Strong Digraphs with Large Degrees and Cycles 论具有大度数和大循环的二强图中的哈密顿循环
IF 1 Q3 Computer Science Pub Date : 2024-04-10 DOI: 10.1134/s105466182401005x
S. Kh. Darbinyan

Abstract

In this note we prove: let D be a 2-strong digraph of order (n) such that its (n - 1) vertices have degrees at least (n + k) and the remaining vertex (z) has degree at least (n - k - 4,) where (k) is a nonnegative integer. If (D) contains a cycle of length at least (n - k - 2) passing through (z,) then (D) is Hamiltonian. This result is best possible in some sense.

Abstract 在这篇笔记中我们证明:让D是一个阶为(n)的二强图,使得它的(n - 1) 顶点至少有(n + k) 度,剩下的顶点(z) 至少有(n - k - 4,)度,其中(k)是一个非负整数。如果(D)包含一个长度至少为(n - k - 2) 经过(z,)的循环,那么(D)就是哈密顿的。这个结果在某种意义上是最好的
{"title":"On Hamiltonian Cycles in a 2-Strong Digraphs with Large Degrees and Cycles","authors":"S. Kh. Darbinyan","doi":"10.1134/s105466182401005x","DOIUrl":"https://doi.org/10.1134/s105466182401005x","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>In this note we prove: let <i>D</i> be a 2-strong digraph of order <span>(n)</span> such that its <span>(n - 1)</span> vertices have degrees at least <span>(n + k)</span> and the remaining vertex <span>(z)</span> has degree at least <span>(n - k - 4,)</span> where <span>(k)</span> is a nonnegative integer. If <span>(D)</span> contains a cycle of length at least <span>(n - k - 2)</span> passing through <span>(z,)</span> then <span>(D)</span> is Hamiltonian. This result is best possible in some sense.</p>","PeriodicalId":35400,"journal":{"name":"PATTERN RECOGNITION AND IMAGE ANALYSIS","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140590435","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}
引用次数: 0
期刊
PATTERN RECOGNITION AND IMAGE ANALYSIS
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1