首页 > 最新文献

Journal of Ambient Intelligence and Humanized Computing最新文献

英文 中文
Decision making using novel Fermatean fuzzy divergence measure and weighted aggregation operators 利用新型费尔马特模糊分歧度量和加权聚合算子进行决策
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-08 DOI: 10.1007/s12652-024-04774-2
Adeeba Umar, Ram Naresh Saraswat

The fuzzy set theory was introduced to handle uncertainty due to imprecision, vagueness and partial information. Then, its extensions such as intuitionistic fuzzy set, intuitionistic interval-valued fuzzy set, Pythagorean fuzzy set were introduced and applied successfully in many fields. Then another extension of orthopair fuzzy set was introduced as Fermatean fuzzy set which is characterized by membership degree and non-membership degree which makes it to provide an excellent tool to present imprecise opinions of humans in decision-making processes. This study is devoted to construct a novel Fermatean fuzzy divergence measure along with its evidence of legitimacy and to deliberate its key properties. The proposed divergence measure for Fermatean fuzzy sets with weighted aggregation operators is applied to fix decision-making problems through numerical illustrations. A comparative study is given between the proposed Fermatean fuzzy divergence measure and the extant methods to test its effectiveness, viability and expediency. Their results were compared in order to check the superiority of the proposed measure.

模糊集理论的提出是为了处理由于不精确、模糊和部分信息造成的不确定性。随后,它的扩展集,如直观模糊集、直观区间值模糊集、毕达哥拉斯模糊集被引入并成功应用于许多领域。正交模糊集的另一个扩展是费马特模糊集,它具有成员度和非成员度的特征,这使它成为在决策过程中呈现人类不精确意见的绝佳工具。本研究致力于构建一种新的费马泰尔模糊分歧度量及其合法性证据,并探讨其关键属性。所提出的带有加权聚合算子的费马泰尔模糊集分歧度量被应用于通过数字说明解决决策问题。对所提出的费马特模糊分歧度量和现有方法进行了比较研究,以检验其有效性、可行性和便利性。通过对它们的结果进行比较,检验了所提方法的优越性。
{"title":"Decision making using novel Fermatean fuzzy divergence measure and weighted aggregation operators","authors":"Adeeba Umar, Ram Naresh Saraswat","doi":"10.1007/s12652-024-04774-2","DOIUrl":"https://doi.org/10.1007/s12652-024-04774-2","url":null,"abstract":"<p>The fuzzy set theory was introduced to handle uncertainty due to imprecision, vagueness and partial information. Then, its extensions such as intuitionistic fuzzy set, intuitionistic interval-valued fuzzy set, Pythagorean fuzzy set were introduced and applied successfully in many fields. Then another extension of orthopair fuzzy set was introduced as Fermatean fuzzy set which is characterized by membership degree and non-membership degree which makes it to provide an excellent tool to present imprecise opinions of humans in decision-making processes. This study is devoted to construct a novel Fermatean fuzzy divergence measure along with its evidence of legitimacy and to deliberate its key properties. The proposed divergence measure for Fermatean fuzzy sets with weighted aggregation operators is applied to fix decision-making problems through numerical illustrations. A comparative study is given between the proposed Fermatean fuzzy divergence measure and the extant methods to test its effectiveness, viability and expediency. Their results were compared in order to check the superiority of the proposed measure.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"43 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bayesian inference in the framework of uncertainty theory 不确定性理论框架下的贝叶斯推理
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-07 DOI: 10.1007/s12652-024-04785-z

Abstract

Bayesian inference is one of the important topics in modern statistics. The information of the parameter in Bayesian statistics which is regarded as some random variable will be updated by that of the posterior distribution. In other words, all the inferences in Bayesian statistics are based on the updated posterior information, which has been proven to be a very powerful technique. In this paper, we study the Bayesian inference in the framework of uncertainty theory based on the uncertain Bayesian rule developed by Lio and Kang in 2022. To be more precise, issues on the point estimation, credible intervals and hypothesis testing in Bayesian statistics under uncertain theory are explored, and one application of our method in an IQ test problem is also given in this paper.

摘要 贝叶斯推理是现代统计学的重要课题之一。在贝叶斯统计中,被视为某种随机变量的参数的信息将由后验分布的信息更新。换句话说,贝叶斯统计中的所有推断都是基于更新的后验信息,这已被证明是一种非常强大的技术。本文以 Lio 和 Kang 于 2022 年提出的不确定贝叶斯规则为基础,研究不确定理论框架下的贝叶斯推断。更准确地说,本文探讨了不确定理论下贝叶斯统计中的点估计、可信区间和假设检验等问题,并给出了我们的方法在智商测试问题中的一个应用。
{"title":"Bayesian inference in the framework of uncertainty theory","authors":"","doi":"10.1007/s12652-024-04785-z","DOIUrl":"https://doi.org/10.1007/s12652-024-04785-z","url":null,"abstract":"<h3>Abstract</h3> <p>Bayesian inference is one of the important topics in modern statistics. The information of the parameter in Bayesian statistics which is regarded as some random variable will be updated by that of the posterior distribution. In other words, all the inferences in Bayesian statistics are based on the updated posterior information, which has been proven to be a very powerful technique. In this paper, we study the Bayesian inference in the framework of uncertainty theory based on the uncertain Bayesian rule developed by Lio and Kang in 2022. To be more precise, issues on the point estimation, credible intervals and hypothesis testing in Bayesian statistics under uncertain theory are explored, and one application of our method in an IQ test problem is also given in this paper.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"37 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A reinforcement learning based mobile charging sequence scheduling algorithm for optimal sensing coverage in wireless rechargeable sensor networks 基于强化学习的移动充电序列调度算法,用于优化无线充电传感器网络中的传感覆盖范围
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-06 DOI: 10.1007/s12652-024-04781-3

Abstract

Mobile charging provides a new way for energy replenishment in the Wireless Rechargeable Sensor Network (WRSN), where the Mobile Charger (MC) is employed for charging nodes sequentially via wireless energy transfer according to the mobile charging sequence scheduling result. Mobile Charging Sequence Scheduling for Optimal Sensing Coverage (MCSS-OSC) is a critical problem for providing network application performance; it aims to maximize the Quality of Sensing Coverage (QSC) of the network by optimizing the MC’s mobile charging sequence and remains a challenging problem due to its NP-completeness in nature. In this paper, we propose a novel Improved Q-learning Algorithm (IQA) for MCSS-OSC, where MC is taken as an agent to continuously learn the space of mobile charging strategies through approximate estimation and improve the charging strategy by interacting with the network environment. A novel reward function is designed according to the network sensing coverage contribution to evaluate the MC charging action at each charging time step. In addition, an efficient exploration strategy is also designed by introducing an optimal experience-strengthening mechanism to record the current optimal mobile charging sequence regularly. Extensive simulation results via Matlab2021 software show that IQA is superior to existing heuristic algorithms in network QSC, especially for large-scale networks. This paper provides an efficient solution for WRSN energy management and new ideas for performance optimization of reinforcement learning algorithms.

摘要 移动充电为无线可充电传感器网络(WRSN)提供了一种新的能量补充方式,根据移动充电序列调度结果,移动充电器(MC)通过无线能量传输按顺序为节点充电。优化传感覆盖的移动充电序列调度(MCSS-OSC)是提供网络应用性能的一个关键问题;它旨在通过优化 MC 的移动充电序列,最大限度地提高网络的传感覆盖质量(QSC)。在本文中,我们针对 MCSS-OSC 提出了一种新颖的改进 Q-learning 算法(IQA),将 MC 作为一个代理,通过近似估计不断学习移动充电策略空间,并通过与网络环境的交互改进充电策略。根据网络感知覆盖贡献设计了一种新的奖励函数,用于评估 MC 在每个充电时间步的充电行动。此外,还设计了一种高效的探索策略,通过引入最佳经验强化机制,定期记录当前最佳移动充电序列。通过 Matlab2021 软件进行的大量仿真结果表明,在网络 QSC 中,IQA 优于现有的启发式算法,尤其是在大规模网络中。本文为 WRSN 能量管理提供了有效的解决方案,也为强化学习算法的性能优化提供了新思路。
{"title":"A reinforcement learning based mobile charging sequence scheduling algorithm for optimal sensing coverage in wireless rechargeable sensor networks","authors":"","doi":"10.1007/s12652-024-04781-3","DOIUrl":"https://doi.org/10.1007/s12652-024-04781-3","url":null,"abstract":"<h3>Abstract</h3> <p>Mobile charging provides a new way for energy replenishment in the Wireless Rechargeable Sensor Network (WRSN), where the Mobile Charger (MC) is employed for charging nodes sequentially via wireless energy transfer according to the mobile charging sequence scheduling result. Mobile Charging Sequence Scheduling for Optimal Sensing Coverage (MCSS-OSC) is a critical problem for providing network application performance; it aims to maximize the Quality of Sensing Coverage (QSC) of the network by optimizing the MC’s mobile charging sequence and remains a challenging problem due to its NP-completeness in nature. In this paper, we propose a novel Improved Q-learning Algorithm (IQA) for MCSS-OSC, where MC is taken as an agent to continuously learn the space of mobile charging strategies through approximate estimation and improve the charging strategy by interacting with the network environment. A novel reward function is designed according to the network sensing coverage contribution to evaluate the MC charging action at each charging time step. In addition, an efficient exploration strategy is also designed by introducing an optimal experience-strengthening mechanism to record the current optimal mobile charging sequence regularly. Extensive simulation results via Matlab2021 software show that IQA is superior to existing heuristic algorithms in network QSC, especially for large-scale networks. This paper provides an efficient solution for WRSN energy management and new ideas for performance optimization of reinforcement learning algorithms.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ensemble deep learning for high-precision classification of 90 rice seed varieties from hyperspectral images 利用高光谱图像对 90 个水稻种子品种进行高精度分类的集合深度学习
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-05 DOI: 10.1007/s12652-024-04782-2
AmirMasoud Taheri, Hossein Ebrahimnezhad, Mohammadhossein Sedaaghi

To develop rice varieties with better nutritional qualities, it is important to classify rice seeds accurately. Hyperspectral imaging can be used to extract spectral information from rice seeds, which can then be used to classify them into different varieties. The challenges of precise classification increase when there are many classes and few training samples. In this paper, we present a novel method for high-precision Hyperspectral Image (HSI) classification of 90 different classes of rice seeds using ensemble deep learning. Our method first employs band selection techniques to select the optimal hyperspectral bands for rice seed classification. Then, a deep neural network is trained with the selected hyperspectral and RGB data from rice seed images to obtain different models for different bands. Finally, an ensemble of deep learning models is employed to classify rice seed images and improve classification accuracy. The proposed method achieves an overall precision ranging from 92.73 to 96.17% despite a large number of classes and low data samples for each class and with only 15 selected hyperspectral bands. This precision is significantly higher than the state-of-the-art classical machine learning methods like random forest, confirming the effectiveness of the proposed method in classifying hyperspectral images of rice seeds.

要培育出营养品质更好的水稻品种,必须对水稻种子进行准确分类。高光谱成像技术可用于提取水稻种子的光谱信息,然后将其分为不同的品种。当类别多而训练样本少时,精确分类所面临的挑战就会增加。在本文中,我们提出了一种利用集合深度学习对 90 种不同类别的水稻种子进行高精度高光谱图像(HSI)分类的新方法。我们的方法首先采用波段选择技术,为水稻种子分类选择最佳的高光谱波段。然后,利用从水稻种子图像中选择的高光谱和 RGB 数据训练深度神经网络,以获得不同波段的不同模型。最后,利用深度学习模型的集合对水稻种子图像进行分类,提高分类精度。尽管分类数量大、每类数据样本少,而且只选择了 15 个高光谱波段,但所提出的方法实现了 92.73% 至 96.17% 的总体精度。这一精确度明显高于随机森林等最先进的经典机器学习方法,证实了所提方法在水稻种子高光谱图像分类中的有效性。
{"title":"Ensemble deep learning for high-precision classification of 90 rice seed varieties from hyperspectral images","authors":"AmirMasoud Taheri, Hossein Ebrahimnezhad, Mohammadhossein Sedaaghi","doi":"10.1007/s12652-024-04782-2","DOIUrl":"https://doi.org/10.1007/s12652-024-04782-2","url":null,"abstract":"<p>To develop rice varieties with better nutritional qualities, it is important to classify rice seeds accurately. Hyperspectral imaging can be used to extract spectral information from rice seeds, which can then be used to classify them into different varieties. The challenges of precise classification increase when there are many classes and few training samples. In this paper, we present a novel method for high-precision Hyperspectral Image (HSI) classification of 90 different classes of rice seeds using ensemble deep learning. Our method first employs band selection techniques to select the optimal hyperspectral bands for rice seed classification. Then, a deep neural network is trained with the selected hyperspectral and RGB data from rice seed images to obtain different models for different bands. Finally, an ensemble of deep learning models is employed to classify rice seed images and improve classification accuracy. The proposed method achieves an overall precision ranging from 92.73 to 96.17% despite a large number of classes and low data samples for each class and with only 15 selected hyperspectral bands. This precision is significantly higher than the state-of-the-art classical machine learning methods like random forest, confirming the effectiveness of the proposed method in classifying hyperspectral images of rice seeds.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"65 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Software security with natural language processing and vulnerability scoring using machine learning approach 利用自然语言处理和机器学习方法进行漏洞评分的软件安全性
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-03 DOI: 10.1007/s12652-024-04778-y
Birendra Kumar Verma, Ajay Kumar Yadav

As software gets more complicated, diverse, and crucial to people’s daily lives, exploitable software vulnerabilities constitute a major security risk to the computer system. These vulnerabilities allow unauthorized access, which can cause losses in banking, energy, the military, healthcare, and other key infrastructure systems. Most vulnerability scoring methods employ Natural Language Processing to generate models from descriptions. These models ignore Impact scores, Exploitability scores, Attack Complexity and other statistical features when scoring vulnerabilities. A feature vector for machine learning models is created from a description, impact score, exploitability score, attack complexity score, etc. We score vulnerabilities more precisely than we categorize them. The Decision Tree Regressor, Random Forest Regressor, AdaBoost Regressor, K-nearest Neighbors Regressor, and Support Vector Regressor have been evaluated using the metrics explained variance, r-squared, mean absolute error, mean squared error, and root mean squared error. The tenfold cross-validation method verifies regressor test results. The research uses 193,463 Common Vulnerabilities and Exposures from the National Vulnerability Database. The Random Forest regressor performed well on four of the five criteria, and the tenfold cross-validation test performed even better (0.9968 vs. 0.9958).

随着软件变得越来越复杂、多样,而且对人们的日常生活越来越重要,可利用的软件漏洞对计算机系统构成了重大的安全风险。这些漏洞允许未经授权的访问,会给银行、能源、军事、医疗保健和其他关键基础设施系统造成损失。大多数漏洞评分方法都采用自然语言处理技术,从描述中生成模型。这些模型在对漏洞进行评分时会忽略影响得分、可开发性得分、攻击复杂性和其他统计特征。机器学习模型的特征向量由描述、影响得分、可利用性得分、攻击复杂性得分等创建。我们对漏洞的评分比对漏洞的分类更精确。使用解释方差、r 平方、平均绝对误差、平均平方误差和均方根误差等指标对决策树回归器、随机森林回归器、AdaBoost 回归器、K-近邻回归器和支持向量回归器进行了评估。十倍交叉验证法验证了回归器的测试结果。研究使用了国家脆弱性数据库中的 193,463 个常见脆弱性和暴露。随机森林回归器在五项标准中的四项上表现良好,十倍交叉验证测试的表现甚至更好(0.9968 对 0.9958)。
{"title":"Software security with natural language processing and vulnerability scoring using machine learning approach","authors":"Birendra Kumar Verma, Ajay Kumar Yadav","doi":"10.1007/s12652-024-04778-y","DOIUrl":"https://doi.org/10.1007/s12652-024-04778-y","url":null,"abstract":"<p>As software gets more complicated, diverse, and crucial to people’s daily lives, exploitable software vulnerabilities constitute a major security risk to the computer system. These vulnerabilities allow unauthorized access, which can cause losses in banking, energy, the military, healthcare, and other key infrastructure systems. Most vulnerability scoring methods employ Natural Language Processing to generate models from descriptions. These models ignore Impact scores, Exploitability scores, Attack Complexity and other statistical features when scoring vulnerabilities. A feature vector for machine learning models is created from a description, impact score, exploitability score, attack complexity score, etc. We score vulnerabilities more precisely than we categorize them. The Decision Tree Regressor, Random Forest Regressor, AdaBoost Regressor, K-nearest Neighbors Regressor, and Support Vector Regressor have been evaluated using the metrics explained variance, r-squared, mean absolute error, mean squared error, and root mean squared error. The tenfold cross-validation method verifies regressor test results. The research uses 193,463 Common Vulnerabilities and Exposures from the National Vulnerability Database. The Random Forest regressor performed well on four of the five criteria, and the tenfold cross-validation test performed even better (0.9968 vs. 0.9958).</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"28 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Existence of fixed points in soft metric spaces with application to boundary value problem 软度量空间中定点的存在及其在边界值问题中的应用
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-03 DOI: 10.1007/s12652-024-04772-4
Vishal Gupta, Aanchal Gondhi

In this paper, we have proved fixed point results for a pair of soft fuzzy maps in complete ordered soft metric spaces. We have also given some useful corollaries to our main result along with examples. Moreover, the application is also presented in this communication to show the validity of new results.

本文证明了完全有序软度量空间中一对软模糊映射的定点结果。我们还给出了主要结果的一些有用推论,并举例说明。此外,本文还介绍了应用,以说明新结果的有效性。
{"title":"Existence of fixed points in soft metric spaces with application to boundary value problem","authors":"Vishal Gupta, Aanchal Gondhi","doi":"10.1007/s12652-024-04772-4","DOIUrl":"https://doi.org/10.1007/s12652-024-04772-4","url":null,"abstract":"<p>In this paper, we have proved fixed point results for a pair of soft fuzzy maps in complete ordered soft metric spaces. We have also given some useful corollaries to our main result along with examples. Moreover, the application is also presented in this communication to show the validity of new results.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Static video summarization with multi-objective constrained optimization 利用多目标约束优化进行静态视频总结
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-01 DOI: 10.1007/s12652-024-04777-z

Abstract

Video summarization is an emerging research field. In particular, static video summarization plays a major role in abstraction and indexing of video repositories. It extracts the vital events in a video such that it covers the entire content of the video. Frames having those important events are called keyframes which are eventually used in video indexing. It also helps in giving an abstract view of the video content such that the internet users are aware of the events present in the video before watching it completely. The proposed research work is focused on efficient static video summarization by extracting various visual features namely color, texture and shape features. These features are aggregated and clustered using a Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. In order to produce good video summary by clustering, the parameters of DBSCAN algorithm are optimized by using a meta heuristic population based optimization called Artificial Algae Algorithm (AAA). The experimental results on two public datasets namely VSUMM and OVP dataset show that the proposed Static Video Summarization with Multi-objective Constrained Optimization (SVS_MCO) achieves better results when compared to existing methods.

摘要 视频摘要是一个新兴的研究领域。其中,静态视频摘要在视频库的抽象和索引中发挥着重要作用。它能提取视频中的重要事件,从而涵盖视频的全部内容。包含这些重要事件的帧称为关键帧,最终用于视频索引。它还有助于提供视频内容的抽象视图,使互联网用户在完整观看视频之前就能了解视频中出现的事件。拟议的研究工作侧重于通过提取各种视觉特征(即颜色、纹理和形状特征)来实现高效的静态视频摘要。使用基于密度的带噪声应用空间聚类(DBSCAN)算法对这些特征进行聚合和聚类。为了通过聚类产生良好的视频摘要,DBSCAN 算法的参数采用了一种名为人工藻类算法(AAA)的基于群体的元启发式优化方法进行优化。在两个公共数据集(即 VSUMM 和 OVP 数据集)上的实验结果表明,与现有方法相比,所提出的多目标约束优化静态视频摘要算法(SVS_MCO)取得了更好的效果。
{"title":"Static video summarization with multi-objective constrained optimization","authors":"","doi":"10.1007/s12652-024-04777-z","DOIUrl":"https://doi.org/10.1007/s12652-024-04777-z","url":null,"abstract":"<h3>Abstract</h3> <p>Video summarization is an emerging research field. In particular, static video summarization plays a major role in abstraction and indexing of video repositories. It extracts the vital events in a video such that it covers the entire content of the video. Frames having those important events are called keyframes which are eventually used in video indexing. It also helps in giving an abstract view of the video content such that the internet users are aware of the events present in the video before watching it completely. The proposed research work is focused on efficient static video summarization by extracting various visual features namely color, texture and shape features. These features are aggregated and clustered using a Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. In order to produce good video summary by clustering, the parameters of DBSCAN algorithm are optimized by using a meta heuristic population based optimization called Artificial Algae Algorithm (AAA). The experimental results on two public datasets namely VSUMM and OVP dataset show that the proposed Static Video Summarization with Multi-objective Constrained Optimization (SVS_MCO) achieves better results when compared to existing methods.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"50 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An intelligent auction-based capacity allocation algorithm in shared railways 共享铁路中基于拍卖的智能运力分配算法
3区 计算机科学 Q1 Computer Science Pub Date : 2024-03-30 DOI: 10.1007/s12652-024-04773-3
Mohsen Shahmohammadi, M. Fakhrzad, H. H. Nasab, S. F. Ghannadpour
{"title":"An intelligent auction-based capacity allocation algorithm in shared railways","authors":"Mohsen Shahmohammadi, M. Fakhrzad, H. H. Nasab, S. F. Ghannadpour","doi":"10.1007/s12652-024-04773-3","DOIUrl":"https://doi.org/10.1007/s12652-024-04773-3","url":null,"abstract":"","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"54 34","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140363238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Visualization of movements in sports training based on multimedia information processing technology 基于多媒体信息处理技术的运动训练动作可视化
3区 计算机科学 Q1 Computer Science Pub Date : 2024-03-28 DOI: 10.1007/s12652-024-04767-1
Yanle Li

The rapid development of multimedia information processing technology provides development opportunities for digitization in sports, among which motion capture technology, as the latest achievement of multimedia information processing technology, has gradually gained the attention of scholars and started to be used for visualization of sports movements. Therefore, this paper introduces a monocular video motion capture method and optimizes it for the problems of reconstructing human movements such as floating, ground penetration and sliding, which provides a technical path for the specific application of motion capture technology in the field of sports training and also provides a technical guarantee for the visualization of sports training movements. Introduced a new motion capture optimization method. This method captures human motion trajectories from monocular videos, and trajectory operations combine human pose estimation and physical constraints. The proposed method uses foot contact judgment to obtain foot contact events for each motion frame. Then, it optimizes the overall body motion trajectory of the key points based on the obtained contact conditions, making the generated motion visually closer to reality. This article proposes LiteHumanPose Net with a inference speed of up to 22FPS, and conducts experimental analysis and comparison of several popular pose estimation methods from the perspectives of frame rate and average accuracy, such as Sim pleBaseline, HRNet, and Hourglass Net. LiteHumanPose Net outperforms Hourglass Net in terms of frame rate and accuracy, while HRNet has high accuracy due to its multiple parameters but low frame rate. The LiteHumanPose network proposed in this article has a good balance between accuracy and frame rate, and has obvious landing advantages.

多媒体信息处理技术的飞速发展为体育数字化提供了发展契机,其中动作捕捉技术作为多媒体信息处理技术的最新成果,逐渐受到学者们的关注,并开始应用于体育动作的可视化。因此,本文介绍了一种单目视频动作捕捉方法,并针对浮体、穿地、滑步等人体动作的重构问题对其进行了优化,为动作捕捉技术在体育训练领域的具体应用提供了技术路径,也为体育训练动作的可视化提供了技术保障。引入新的动作捕捉优化方法。该方法从单目视频中捕捉人体运动轨迹,轨迹运算结合了人体姿态估计和物理约束。该方法利用脚接触判断来获取每个运动帧的脚接触事件。然后,根据获得的接触条件优化关键点的整体身体运动轨迹,使生成的运动在视觉上更接近现实。本文提出了推理速度高达 22FPS 的 LiteHumanPose Net,并从帧率和平均精度的角度对 Sim pleBaseline、HRNet 和 Hourglass Net 等几种流行的姿势估计方法进行了实验分析和比较。结果表明,LiteHumanPose 网络在帧率和准确率方面都优于 Hourglass Net,而 HRNet 因其多参数而具有较高的准确率,但帧率较低。本文提出的 LiteHumanPose 网络在精度和帧速率之间取得了良好的平衡,具有明显的着陆优势。
{"title":"Visualization of movements in sports training based on multimedia information processing technology","authors":"Yanle Li","doi":"10.1007/s12652-024-04767-1","DOIUrl":"https://doi.org/10.1007/s12652-024-04767-1","url":null,"abstract":"<p>The rapid development of multimedia information processing technology provides development opportunities for digitization in sports, among which motion capture technology, as the latest achievement of multimedia information processing technology, has gradually gained the attention of scholars and started to be used for visualization of sports movements. Therefore, this paper introduces a monocular video motion capture method and optimizes it for the problems of reconstructing human movements such as floating, ground penetration and sliding, which provides a technical path for the specific application of motion capture technology in the field of sports training and also provides a technical guarantee for the visualization of sports training movements. Introduced a new motion capture optimization method. This method captures human motion trajectories from monocular videos, and trajectory operations combine human pose estimation and physical constraints. The proposed method uses foot contact judgment to obtain foot contact events for each motion frame. Then, it optimizes the overall body motion trajectory of the key points based on the obtained contact conditions, making the generated motion visually closer to reality. This article proposes LiteHumanPose Net with a inference speed of up to 22FPS, and conducts experimental analysis and comparison of several popular pose estimation methods from the perspectives of frame rate and average accuracy, such as Sim pleBaseline, HRNet, and Hourglass Net. LiteHumanPose Net outperforms Hourglass Net in terms of frame rate and accuracy, while HRNet has high accuracy due to its multiple parameters but low frame rate. The LiteHumanPose network proposed in this article has a good balance between accuracy and frame rate, and has obvious landing advantages.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"63 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140325797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A study of learning models for COVID-19 disease prediction COVID-19 疾病预测学习模型研究
3区 计算机科学 Q1 Computer Science Pub Date : 2024-03-28 DOI: 10.1007/s12652-024-04775-1
Sakshi Jain, Pradeep Kumar Roy

Coronavirus belongs to the family of Coronaviridae. It is responsible for COVID-19 communicable disease, which has affected 213 countries and territories worldwide. Researchers in computational fields have been active in proposing techniques to filter the information and recommendations about this disease and provide surveillance in controlling this outbreak. Researchers used Chest X-ray images, abdominal Computed Tomography scans, and Tweet datasets for building machine learning and deep learning-based models for COVID-19 predictions and forecasting purposes. Accuracy, sensitivity, specificity, precision, and F1-measure are the five primary evaluation criteria researchers employ to evaluate the quality of their study. This article summarises research works on COVID-19 based on machine learning and deep learning models. The analysis of these research works, along with their limitations and source of datasets, will give a quick start for future research to arrive at a defined direction.

冠状病毒属于冠状病毒科。它是 COVID-19 传染病的元凶,已影响到全球 213 个国家和地区。计算领域的研究人员一直在积极提出技术,以过滤有关该疾病的信息和建议,并为控制疫情提供监控。研究人员利用胸部 X 光图像、腹部计算机断层扫描和 Tweet 数据集,建立了基于机器学习和深度学习的模型,用于 COVID-19 的预测和预报。准确性、灵敏度、特异性、精确度和 F1 测量是研究人员评估研究质量的五个主要评价标准。本文总结了基于机器学习和深度学习模型的 COVID-19 研究工作。对这些研究成果及其局限性和数据集来源的分析,将为未来的研究提供一个快速起点,从而确定研究方向。
{"title":"A study of learning models for COVID-19 disease prediction","authors":"Sakshi Jain, Pradeep Kumar Roy","doi":"10.1007/s12652-024-04775-1","DOIUrl":"https://doi.org/10.1007/s12652-024-04775-1","url":null,"abstract":"<p>Coronavirus belongs to the family of Coronaviridae. It is responsible for COVID-19 communicable disease, which has affected 213 countries and territories worldwide. Researchers in computational fields have been active in proposing techniques to filter the information and recommendations about this disease and provide surveillance in controlling this outbreak. Researchers used Chest X-ray images, abdominal Computed Tomography scans, and Tweet datasets for building machine learning and deep learning-based models for COVID-19 predictions and forecasting purposes. Accuracy, sensitivity, specificity, precision, and F1-measure are the five primary evaluation criteria researchers employ to evaluate the quality of their study. This article summarises research works on COVID-19 based on machine learning and deep learning models. The analysis of these research works, along with their limitations and source of datasets, will give a quick start for future research to arrive at a defined direction.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"45 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140325799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Ambient Intelligence and Humanized Computing
全部 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