首页 > 最新文献

Journal of Ambient Intelligence and Humanized Computing最新文献

英文 中文
Intelligent fractional-order sliding mode control based maneuvering of an autonomous vehicle 基于智能分数阶滑动模式控制的自动驾驶汽车操纵系统
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-17 DOI: 10.1007/s12652-024-04770-6
Raghavendra M. Shet, Girish V. Lakhekar, Nalini C. Iyer

This article proposes a new intelligent trajectory tracking control law for the precise maneuvering of an autonomous vehicle in the presence of parametric uncertainties and external disturbances. The controller design includes a fuzzy sliding mode algorithm for smooth motion control subjected to steering saturation and curvature constraints. Along with the Salp Swarm Optimization technique, explored for optimal selection of surface coefficient in fractional order Proportional-Derivative type (P{D}^{alpha }) sliding manifold. The sliding variable on the surface approaches zero in a finite time. Further, the trajectory tracking control rule offers the stability of closed-loop tracking on the predetermined path and ensures finite time convergence to the sliding surface. In addition, to estimate the hitting gain in online mode, a supervisory fuzzy logic controller system is used. Therefore, it is not necessary to determine upper bounds on uncertainty in the dynamic parameters of autonomous vehicles. Lyapunov theory verifies the global asymptotic stability of the entire closed-loop control strategy. The major control issue is the input constraints arising primarily due to the capability of the steering actuating module, which causes significant deviation or vehicle instability. Consequently, it is desirable to design a robust adaptive stable controller, such as Adaptive Backstepping Control (ABC), even though it requires vehicle model information. Therefore, the proposed model-free intelligent sliding mode technique offers better tracking performance and vehicle stability in adverse conditions. Finally, the efficacy of the proposed control technique was confirmed through a comparative analysis based on numerical simulation using MATLAB/SIMULINK and experimental validation using Quanser’s self-driving car module. A quantitative study was conducted to elucidate the superior tracking performance of intelligent control over the traditional SMC and adaptive backstepping control methods.

本文提出了一种新的智能轨迹跟踪控制法,用于在存在参数不确定性和外部干扰的情况下精确操纵自主车辆。控制器设计包括一种模糊滑动模式算法,用于在转向饱和度和曲率约束条件下进行平滑运动控制。与 Salp Swarm Optimization 技术一起,探索了在分数阶比例-派生类型(P{D}^{alpha } )滑动流形中表面系数的最优选择。表面上的滑动变量在有限的时间内趋近零。此外,轨迹跟踪控制规则提供了在预定路径上闭环跟踪的稳定性,并确保在有限时间内收敛到滑动曲面。此外,在在线模式下,为了估算打击增益,使用了监督模糊逻辑控制器系统。因此,无需确定自动驾驶车辆动态参数不确定性的上限。李亚普诺夫理论验证了整个闭环控制策略的全局渐近稳定性。主要的控制问题是输入限制,这主要是由于转向执行模块的能力造成的,它会导致重大偏差或车辆不稳定。因此,设计一种鲁棒的自适应稳定控制器(如自适应逆向控制 (ABC))是可取的,尽管它需要车辆模型信息。因此,所提出的无模型智能滑模技术能在不利条件下提供更好的跟踪性能和车辆稳定性。最后,通过使用 MATLAB/SIMULINK 进行数值模拟,并使用 Quanser 的自动驾驶汽车模块进行实验验证,对比分析证实了所提出的控制技术的有效性。通过定量研究,阐明了智能控制的跟踪性能优于传统的 SMC 和自适应反步进控制方法。
{"title":"Intelligent fractional-order sliding mode control based maneuvering of an autonomous vehicle","authors":"Raghavendra M. Shet, Girish V. Lakhekar, Nalini C. Iyer","doi":"10.1007/s12652-024-04770-6","DOIUrl":"https://doi.org/10.1007/s12652-024-04770-6","url":null,"abstract":"<p>This article proposes a new intelligent trajectory tracking control law for the precise maneuvering of an autonomous vehicle in the presence of parametric uncertainties and external disturbances. The controller design includes a fuzzy sliding mode algorithm for smooth motion control subjected to steering saturation and curvature constraints. Along with the Salp Swarm Optimization technique, explored for optimal selection of surface coefficient in fractional order Proportional-Derivative type <span>(P{D}^{alpha })</span> sliding manifold. The sliding variable on the surface approaches zero in a finite time. Further, the trajectory tracking control rule offers the stability of closed-loop tracking on the predetermined path and ensures finite time convergence to the sliding surface. In addition, to estimate the hitting gain in online mode, a supervisory fuzzy logic controller system is used. Therefore, it is not necessary to determine upper bounds on uncertainty in the dynamic parameters of autonomous vehicles. Lyapunov theory verifies the global asymptotic stability of the entire closed-loop control strategy. The major control issue is the input constraints arising primarily due to the capability of the steering actuating module, which causes significant deviation or vehicle instability. Consequently, it is desirable to design a robust adaptive stable controller, such as Adaptive Backstepping Control (ABC), even though it requires vehicle model information. Therefore, the proposed model-free intelligent sliding mode technique offers better tracking performance and vehicle stability in adverse conditions. Finally, the efficacy of the proposed control technique was confirmed through a comparative analysis based on numerical simulation using MATLAB/SIMULINK and experimental validation using Quanser’s self-driving car module. A quantitative study was conducted to elucidate the superior tracking performance of intelligent control over the traditional SMC and adaptive backstepping control methods.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140610065","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
Wavelet scattering transform and deep features for automated classification and grading of dates fruit 用于枣果自动分类和分级的小波散射变换和深度特征
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-16 DOI: 10.1007/s12652-024-04786-y
Newlin Shebiah Russel, Arivazhagan Selvaraj

Date fruit, a vital agricultural product in the Middle East area, is harvested annually in millions of metric tons and is renowned for its abundant nutrients. With computer vision and machine learning techniques, automatic date fruit classification enables farmers and supermarkets to differentiate between various varieties and qualities of date fruits within their inventory. Date fruits have unique physical characteristics, such as shape, size, color, texture, and skin type that are important in determining their variety and quality. These characteristics can vary significantly depending on the cultivar, growing conditions, and ripening stage of the date fruits. This paper presents a novel date fruit type classification and grading system achieved through the feature-level fusion of deep learning features and wavelet scattering features. Wavelet scattering features are extracted at varying levels of decomposition; enabling reliable extraction of information from diverse channels. To extract deep features this study utilizes pre-trained architectures, including Alexnet, Googlenet, Resnet, and MobileNetV2. The proposed methodology has been experimentally evaluated with the Date Fruit in Controlled Environment dataset, which has nine classes, and has yielded an accuracy of 95.9% for date species classification. Various date fruit species from the TU-DG dataset were graded, and for Ajwa species, the accuracy is 97.8%, for Mabroom, 92.6% accuracy, and for Sukkary, 99.5% accuracy.

椰枣果是中东地区的重要农产品,每年收获量达数百万吨,以其丰富的营养而闻名。利用计算机视觉和机器学习技术,椰枣果实自动分类技术可帮助果农和超市区分库存中不同品种和品质的椰枣果实。椰枣果实具有独特的物理特征,如形状、大小、颜色、质地和果皮类型,这些对确定其品种和质量非常重要。这些特征会因枣果的栽培品种、生长条件和成熟阶段的不同而有很大差异。本文通过深度学习特征和小波散射特征的特征级融合,提出了一种新颖的枣果类型分类和分级系统。小波散射特征是在不同的分解级别上提取的,可以从不同的通道中可靠地提取信息。为了提取深度特征,本研究使用了预先训练好的架构,包括 Alexnet、Googlenet、Resnet 和 MobileNetV2。所提出的方法已在包含九个类别的 "受控环境中的枣果 "数据集上进行了实验评估,枣果种类分类的准确率达到 95.9%。对 TU-DG 数据集中的各种椰枣果实种类进行了分级,对 Ajwa 种类的准确率为 97.8%,对 Mabroom 的准确率为 92.6%,对 Sukkary 的准确率为 99.5%。
{"title":"Wavelet scattering transform and deep features for automated classification and grading of dates fruit","authors":"Newlin Shebiah Russel, Arivazhagan Selvaraj","doi":"10.1007/s12652-024-04786-y","DOIUrl":"https://doi.org/10.1007/s12652-024-04786-y","url":null,"abstract":"<p>Date fruit, a vital agricultural product in the Middle East area, is harvested annually in millions of metric tons and is renowned for its abundant nutrients. With computer vision and machine learning techniques, automatic date fruit classification enables farmers and supermarkets to differentiate between various varieties and qualities of date fruits within their inventory. Date fruits have unique physical characteristics, such as shape, size, color, texture, and skin type that are important in determining their variety and quality. These characteristics can vary significantly depending on the cultivar, growing conditions, and ripening stage of the date fruits. This paper presents a novel date fruit type classification and grading system achieved through the feature-level fusion of deep learning features and wavelet scattering features. Wavelet scattering features are extracted at varying levels of decomposition; enabling reliable extraction of information from diverse channels. To extract deep features this study utilizes pre-trained architectures, including Alexnet, Googlenet, Resnet, and MobileNetV2. The proposed methodology has been experimentally evaluated with the Date Fruit in Controlled Environment dataset, which has nine classes, and has yielded an accuracy of 95.9% for date species classification. Various date fruit species from the TU-DG dataset were graded, and for Ajwa species, the accuracy is 97.8%, for Mabroom, 92.6% accuracy, and for Sukkary, 99.5% accuracy.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570427","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
User gait biometrics in smart ambient applications through wearable accelerometer signals: an analysis of the influence of training setup on recognition accuracy 通过可穿戴加速度计信号在智能环境应用中进行用户步态生物识别:分析训练设置对识别准确率的影响
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-15 DOI: 10.1007/s12652-024-04790-2
Maria De Marsico, Andrea Palermo

Gait recognition can exploit the signals from wearables, e.g., the accelerometers embedded in smart devices. At present, this kind of recognition mostly underlies subject verification: the incoming probe is compared only with the templates in the system gallery that belong to the claimed identity. For instance, several proposals tackle the continuous recognition of the device owner to detect possible theft or loss. In this case, assuming a short time between the gallery template acquisition and the probe is reasonable. This work rather investigates the viability of a wider range of applications including identification (comparison with a whole system gallery) in the medium-long term. The first contribution is a procedure for extraction and two-phase selection of the most relevant aggregate features from a gait signal. A model is trained for each identity using Logistic Regression. The second contribution is the experiments investigating the effect of the variability of the gait pattern in time. In particular, the recognition performance is influenced by the benchmark partition into training and testing sets when more acquisition sessions are available, like in the exploited ZJU-gaitacc dataset. When close-in-time acquisition data is only available, the results seem to suggest re-identification (short time among captures) as the most promising application for this kind of recognition. The exclusive use of different dataset sessions for training and testing can rather better highlight the dramatic effect of trait variability on the measured performance. This suggests acquiring enrollment data in more sessions when the intended use is in medium-long term applications of smart ambient intelligence.

步态识别可以利用来自可穿戴设备的信号,例如智能设备中嵌入的加速度计。目前,这种识别主要用于主体验证:输入的探针只与系统图库中属于声称身份的模板进行比较。例如,有几项建议涉及对设备所有者的持续识别,以检测可能的盗窃或丢失。在这种情况下,假设图库模板获取和探测之间的时间很短是合理的。这项工作更倾向于研究更广泛应用的可行性,包括中长期识别(与整个系统图库进行比较)。第一项贡献是从步态信号中提取并分两阶段选择最相关的总体特征的程序。使用逻辑回归法为每个特征训练一个模型。第二个贡献是实验研究了步态模式在时间上的可变性的影响。特别是,当有更多的采集会话时,识别性能会受到将基准划分为训练集和测试集的影响,比如在利用的 ZJU-gaitacc 数据集中。当只有近时采集数据时,结果似乎表明重新识别(短时间采集)是这种识别最有前途的应用。完全使用不同的数据集进行训练和测试,可以更好地突出性状变异对测量性能的巨大影响。这就建议在智能环境智能的中长期应用中获取更多时段的注册数据。
{"title":"User gait biometrics in smart ambient applications through wearable accelerometer signals: an analysis of the influence of training setup on recognition accuracy","authors":"Maria De Marsico, Andrea Palermo","doi":"10.1007/s12652-024-04790-2","DOIUrl":"https://doi.org/10.1007/s12652-024-04790-2","url":null,"abstract":"<p>Gait recognition can exploit the signals from wearables, e.g., the accelerometers embedded in smart devices. At present, this kind of recognition mostly underlies subject verification: the incoming probe is compared only with the templates in the system gallery that belong to the claimed identity. For instance, several proposals tackle the continuous recognition of the device owner to detect possible theft or loss. In this case, assuming a short time between the gallery template acquisition and the probe is reasonable. This work rather investigates the viability of a wider range of applications including identification (comparison with a whole system gallery) in the medium-long term. The first contribution is a procedure for extraction and two-phase selection of the most relevant aggregate features from a gait signal. A model is trained for each identity using Logistic Regression. The second contribution is the experiments investigating the effect of the variability of the gait pattern in time. In particular, the recognition performance is influenced by the benchmark partition into training and testing sets when more acquisition sessions are available, like in the exploited ZJU-gaitacc dataset. When close-in-time acquisition data is only available, the results seem to suggest re-identification (short time among captures) as the most promising application for this kind of recognition. The exclusive use of different dataset sessions for training and testing can rather better highlight the dramatic effect of trait variability on the measured performance. This suggests acquiring enrollment data in more sessions when the intended use is in medium-long term applications of smart ambient intelligence.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570487","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
Distributed versus centralized computing of coverage in mobile crowdsensing 移动人群感应中覆盖范围的分布式计算与集中式计算
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-14 DOI: 10.1007/s12652-024-04788-w
Michele Girolami, Alexander Kocian, Stefano Chessa

The expected spatial coverage of a crowdsensing platform is an important parameter that derives from the mobility data of the crowdsensing platform users. We tackle the challenge of estimating the anticipated coverage while adhering to privacy constraints, where the platform is restricted from accessing detailed mobility data of individual users. Specifically, we model the coverage as the probability that a user detours to a point of interest if the user is present in a certain region around that point. Following this approach, we propose and evaluate a centralized as well as a distributed implementation model. We examine real-world mobility data employed for assessing the coverage performance of the two models, and we show that the two implementation models provide different privacy requirements but are equivalent in terms of their outputs.

众感应平台的预期空间覆盖范围是一个重要参数,它来源于众感应平台用户的移动数据。我们要解决的难题是,在估算预期覆盖范围的同时,还要遵守隐私限制,即平台不得获取单个用户的详细移动数据。具体来说,我们将覆盖范围建模为:如果用户出现在兴趣点周围的某个区域,则该用户绕道该兴趣点的概率。按照这种方法,我们提出并评估了集中式和分布式实施模型。我们研究了真实世界的移动数据,用于评估这两种模型的覆盖性能,结果表明这两种实现模型提供了不同的隐私要求,但在输出方面是等效的。
{"title":"Distributed versus centralized computing of coverage in mobile crowdsensing","authors":"Michele Girolami, Alexander Kocian, Stefano Chessa","doi":"10.1007/s12652-024-04788-w","DOIUrl":"https://doi.org/10.1007/s12652-024-04788-w","url":null,"abstract":"<p>The expected spatial coverage of a crowdsensing platform is an important parameter that derives from the mobility data of the crowdsensing platform users. We tackle the challenge of estimating the anticipated coverage while adhering to privacy constraints, where the platform is restricted from accessing detailed mobility data of individual users. Specifically, we model the coverage as the probability that a user detours to a point of interest if the user is present in a certain region around that point. Following this approach, we propose and evaluate a centralized as well as a distributed implementation model. We examine real-world mobility data employed for assessing the coverage performance of the two models, and we show that the two implementation models provide different privacy requirements but are equivalent in terms of their outputs.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570426","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 improved blockchain framework for ORAP verification and data security in healthcare 用于医疗保健领域 ORAP 验证和数据安全的改进型区块链框架
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-12 DOI: 10.1007/s12652-024-04780-4
Parag Rastogi, Devendra Singh, Sarabjeet Singh Bedi

Currently, the move from traditional healthcare to smart healthcare systems is greatly aided by current technology. Healthcare proposes a new healthcare model that is patient-centered using advancements in wearable sensors, connectivity, and the Internet of Things (IoT). The administration of enormous amounts of data, including reports and pictures of every individual, increases human labour requirements and security hazards. This study shows how a blockchain-based Internet of Things might improve patient care while lowering costs by using medical resources more wisely. Initially, Resource Provider’s IoT data will be sensed and encrypts using Diffie Hellman Galois–Elliptic-curve cryptography (DHG-ECC). Next, from the extracted attributes, the optimal features will be selected by using Pearson Correlation Coefficient based Sand Cat Optimization Algorithm (PCC-SCOA). After that, the selected optimal features will be combined and converted into hashcode using the Digit Folding–Streebog Hashing algorithm. This hashcode will be constructed in the form of Smart Contract. Next, the Resource Requester (Doctor or Nurse) sends the Role Request with the Combined Linear Congruential Generator–Digital Signature Algorithm (CLCG-DSA). The next Resource Requester will be matching the hashed access policy with Blockchain. The proposed models are used to compare the performance of proposed design using feature selection time, Encryption time, Decryption time, security level, signature creation time and signature verification time. Our proposed method DHGECC approach achieves 96.123% higher security.

目前,从传统医疗保健向智能医疗保健系统的转变在很大程度上得益于当前的技术。医疗保健提出了一种新的医疗保健模式,即利用可穿戴传感器、连接性和物联网(IoT)的进步,以患者为中心。海量数据(包括每个人的报告和照片)的管理增加了人力需求和安全隐患。本研究展示了基于区块链的物联网如何通过更合理地使用医疗资源来改善患者护理,同时降低成本。首先,将感知资源提供者的物联网数据,并使用 Diffie Hellman Galois-Elliptic-curve 加密算法(DHG-ECC)进行加密。接下来,将使用基于皮尔逊相关系数的沙猫优化算法(PCC-SCOA)从提取的属性中选出最佳特征。然后,利用数字折叠-Streebog 散列算法将选出的最优特征组合起来并转换成散列码。该散列码将以智能合约的形式构建。接下来,资源需求者(医生或护士)通过组合线性公有生成器-数字签名算法(CLCG-DSA)发送角色请求。下一个资源需求者将把散列访问策略与区块链进行匹配。建议的模型使用特征选择时间、加密时间、解密时间、安全级别、签名创建时间和签名验证时间来比较建议设计的性能。我们提出的 DHGECC 方法的安全性提高了 96.123%。
{"title":"An improved blockchain framework for ORAP verification and data security in healthcare","authors":"Parag Rastogi, Devendra Singh, Sarabjeet Singh Bedi","doi":"10.1007/s12652-024-04780-4","DOIUrl":"https://doi.org/10.1007/s12652-024-04780-4","url":null,"abstract":"<p>Currently, the move from traditional healthcare to smart healthcare systems is greatly aided by current technology. Healthcare proposes a new healthcare model that is patient-centered using advancements in wearable sensors, connectivity, and the Internet of Things (IoT). The administration of enormous amounts of data, including reports and pictures of every individual, increases human labour requirements and security hazards. This study shows how a blockchain-based Internet of Things might improve patient care while lowering costs by using medical resources more wisely. Initially, Resource Provider’s IoT data will be sensed and encrypts using Diffie Hellman Galois–Elliptic-curve cryptography (DHG-ECC). Next, from the extracted attributes, the optimal features will be selected by using Pearson Correlation Coefficient based Sand Cat Optimization Algorithm (PCC-SCOA). After that, the selected optimal features will be combined and converted into hashcode using the Digit Folding–Streebog Hashing algorithm. This hashcode will be constructed in the form of Smart Contract. Next, the Resource Requester (Doctor or Nurse) sends the Role Request with the Combined Linear Congruential Generator–Digital Signature Algorithm (CLCG-DSA). The next Resource Requester will be matching the hashed access policy with Blockchain. The proposed models are used to compare the performance of proposed design using feature selection time, Encryption time, Decryption time, security level, signature creation time and signature verification time. Our proposed method DHGECC approach achieves 96.123% higher security.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570402","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
Automatic design of W-operators using membership functions: a case study in brain MRI segmentation 使用成员函数自动设计 W 运算器:脑磁共振成像分割案例研究
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-11 DOI: 10.1007/s12652-024-04789-9
Emilio José Robalino Trujillo, Agustina Bouchet, Virginia Laura Ballarin, Juan Ignacio Pastore

A W-operator is an image transformation that is locally defined inside a window W, invariant to translations. The automatic design of the W-operators consists of the design of functions, whose domain is a set of patterns or vectors obtained by translating a window through training images and the output of each vector is a class or label. The main difficulty to consider when designing W-operators is the generalization problem that occurs due to lack of training images. In this work, we propose the use of membership functions to solve the generalization problem in gray level images. Membership functions are defined from the training images to model regions that are often inaccurate due to ambiguous gray levels in the images. This proposal was applied to brain magnetic resonance image segmentation to test its performance in a field of interest in biomedical images. The experiments were carried out with different numbers of training and test images, windows sizes of (3times 3), (5times 5), (7times 7), (11times 11), and (15times 15), and images with noise levels at 0, 1, 3, 5, 7, and 9(%). To calculate the performance of each designed W-operator, the classification error, sensitivity, and specificity were used. From the experimental results, it was concluded that the best performance is achieved with a window of size (3times 3). In images with noise levels from 1 to 5(%), the classification error is less than 4(%) and the sensitivity and specificity are greater than 94 and 98(%), respectively.

W 运算符是在 W 窗口内局部定义的图像变换,对平移不变。W 运算符的自动设计包括函数的设计,其域是通过训练图像平移窗口获得的一组模式或向量,每个向量的输出是一个类别或标签。设计 W 运算符时需要考虑的主要困难是由于缺乏训练图像而产生的泛化问题。在这项工作中,我们建议使用成员函数来解决灰度图像中的泛化问题。成员函数是根据训练图像定义的,用于对由于图像中模糊的灰度级而经常不准确的区域进行建模。我们将这一建议应用于脑磁共振图像分割,以测试其在生物医学图像领域的性能。实验使用了不同数量的训练图像和测试图像,窗口大小分别为(3乘以3)、(5乘以5)、(7乘以7)、(11乘以11)和(15乘以15),图像的噪声水平分别为0、1、3、5、7和9(%)。为了计算所设计的 W 操作符的性能,使用了分类误差、灵敏度和特异性。从实验结果中可以得出结论,使用大小为 (3times 3 )的窗口可以获得最佳性能。在噪声水平为1到5的图像中,分类误差小于4,灵敏度和特异性分别大于94和98。
{"title":"Automatic design of W-operators using membership functions: a case study in brain MRI segmentation","authors":"Emilio José Robalino Trujillo, Agustina Bouchet, Virginia Laura Ballarin, Juan Ignacio Pastore","doi":"10.1007/s12652-024-04789-9","DOIUrl":"https://doi.org/10.1007/s12652-024-04789-9","url":null,"abstract":"<p>A W-operator is an image transformation that is locally defined inside a window W, invariant to translations. The automatic design of the W-operators consists of the design of functions, whose domain is a set of patterns or vectors obtained by translating a window through training images and the output of each vector is a class or label. The main difficulty to consider when designing W-operators is the generalization problem that occurs due to lack of training images. In this work, we propose the use of membership functions to solve the generalization problem in gray level images. Membership functions are defined from the training images to model regions that are often inaccurate due to ambiguous gray levels in the images. This proposal was applied to brain magnetic resonance image segmentation to test its performance in a field of interest in biomedical images. The experiments were carried out with different numbers of training and test images, windows sizes of <span>(3times 3)</span>, <span>(5times 5)</span>, <span>(7times 7)</span>, <span>(11times 11)</span>, and <span>(15times 15)</span>, and images with noise levels at 0, 1, 3, 5, 7, and 9<span>(%)</span>. To calculate the performance of each designed W-operator, the classification error, sensitivity, and specificity were used. From the experimental results, it was concluded that the best performance is achieved with a window of size <span>(3times 3)</span>. In images with noise levels from 1 to 5<span>(%)</span>, the classification error is less than 4<span>(%)</span> and the sensitivity and specificity are greater than 94 and 98<span>(%)</span>, respectively.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570409","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
Special issue on advancements in ambient assisted living: integrating technology and human-centered design for enhancing user well-being and care 环境辅助生活的进步特刊:整合技术和以人为本的设计,提高用户福祉和护理水平
3区 计算机科学 Q1 Computer Science Pub Date : 2024-04-09 DOI: 10.1007/s12652-024-04799-7
A. Monteriù, A. Freddi, S. Longhi
{"title":"Special issue on advancements in ambient assisted living: integrating technology and human-centered design for enhancing user well-being and care","authors":"A. Monteriù, A. Freddi, S. Longhi","doi":"10.1007/s12652-024-04799-7","DOIUrl":"https://doi.org/10.1007/s12652-024-04799-7","url":null,"abstract":"","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140722801","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
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":null,"pages":null},"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":null,"pages":null},"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":null,"pages":null},"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
期刊
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