Pub Date : 2024-07-16DOI: 10.1109/TAI.2024.3429052
Qingtan Meng;Qian Ma
This article investigates the adaptive fuzzy control problem for singular systems with actuator saturation and nonlinear perturbation, where the system consists of two coupled differential and algebraic subsystems. To cope with the actuator saturation, a new auxiliary system whose order is the same as the differential subsystem is introduced. With the help of the backstepping method and adaptive fuzzy control method, an observer-based adaptive output feedback tracking control approach is utilized. Under the designed controller, it is proved that the closed-loop system is impulse-free and regular, and all the involved signals are bounded. Furthermore, it is ensured that the tracking error can be adjusted by the errors between the control inputs and the corresponding saturated inputs, as well as the design parameters. Finally, simulation studies demonstrate the validity of the control approach.
{"title":"Observer-Based Adaptive Fuzzy Control for Singular Systems with Nonlinear Perturbation and Actuator Saturation","authors":"Qingtan Meng;Qian Ma","doi":"10.1109/TAI.2024.3429052","DOIUrl":"https://doi.org/10.1109/TAI.2024.3429052","url":null,"abstract":"This article investigates the adaptive fuzzy control problem for singular systems with actuator saturation and nonlinear perturbation, where the system consists of two coupled differential and algebraic subsystems. To cope with the actuator saturation, a new auxiliary system whose order is the same as the differential subsystem is introduced. With the help of the backstepping method and adaptive fuzzy control method, an observer-based adaptive output feedback tracking control approach is utilized. Under the designed controller, it is proved that the closed-loop system is impulse-free and regular, and all the involved signals are bounded. Furthermore, it is ensured that the tracking error can be adjusted by the errors between the control inputs and the corresponding saturated inputs, as well as the design parameters. Finally, simulation studies demonstrate the validity of the control approach.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 10","pages":"5090-5099"},"PeriodicalIF":0.0,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142443115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-16DOI: 10.1109/TAI.2024.3429048
Xue Hu;Fabrizio Cutolo;Hisham Iqbal;Johann Henckel;Ferdinando Rodriguez y Baena
Conventional orthopedic navigation systems depend on marker-based tracking, which may introduce additional skin incisions, increase the risk and discomfort for the patient, and entail increased workflow complexity. The guidance is conveyed via 2-D monitors, which may distract the surgeon and increase the cognitive burden. This study presents an artificial intelligence (AI)—driven surgical navigation framework for knee replacement surgery. The system comprises an augmented reality (AR) interface that combines an occlusions-robust deep learning-based markerless bone tracking and registration algorithm with a commercial HoloLens 2 headset calibrated for the user's perspective on both eyes. The feasibility of such a system in navigating a bone drilling task is investigated with an experienced orthopedic surgeon on three cadaveric knees under realistic operating room (OR) conditions. After registering an implant model to computed tomography (CT) scans, the preoperative plans are determined based on the location of the fixation pins. Navigation accuracy is quantified using a highly accurate optical tracking system. The achieved drilling error is 7.88 $pm$ 2.41 mm in translation and 7.36 $pm$ 1.77 ${}^{boldsymbol{circ}}$ in orientation. The results demonstrate the viability of integrating AI and AR technology to navigate knee surgery.
{"title":"Artificial Intelligence-Driven Framework for Augmented Reality Markerless Navigation in Knee Surgery","authors":"Xue Hu;Fabrizio Cutolo;Hisham Iqbal;Johann Henckel;Ferdinando Rodriguez y Baena","doi":"10.1109/TAI.2024.3429048","DOIUrl":"https://doi.org/10.1109/TAI.2024.3429048","url":null,"abstract":"Conventional orthopedic navigation systems depend on marker-based tracking, which may introduce additional skin incisions, increase the risk and discomfort for the patient, and entail increased workflow complexity. The guidance is conveyed via 2-D monitors, which may distract the surgeon and increase the cognitive burden. This study presents an artificial intelligence (AI)—driven surgical navigation framework for knee replacement surgery. The system comprises an augmented reality (AR) interface that combines an occlusions-robust deep learning-based markerless bone tracking and registration algorithm with a commercial HoloLens 2 headset calibrated for the user's perspective on both eyes. The feasibility of such a system in navigating a bone drilling task is investigated with an experienced orthopedic surgeon on three cadaveric knees under realistic operating room (OR) conditions. After registering an implant model to computed tomography (CT) scans, the preoperative plans are determined based on the location of the fixation pins. Navigation accuracy is quantified using a highly accurate optical tracking system. The achieved drilling error is 7.88 \u0000<inline-formula><tex-math>$pm$</tex-math></inline-formula>\u0000 2.41 mm in translation and 7.36 \u0000<inline-formula><tex-math>$pm$</tex-math></inline-formula>\u0000 1.77\u0000<inline-formula><tex-math>${}^{boldsymbol{circ}}$</tex-math></inline-formula>\u0000 in orientation. The results demonstrate the viability of integrating AI and AR technology to navigate knee surgery.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 10","pages":"5205-5215"},"PeriodicalIF":0.0,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10599938","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142442962","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-16DOI: 10.1109/TAI.2024.3429050
Zihao Li;Pan Gao;Kang You;Chuan Yan;Manoranjan Paul
Previous studies have demonstrated the effectiveness of point-based neural models on the point cloud analysis task. However, there remains a crucial issue on producing the efficient input embedding for raw point coordinates. Moreover, another issue lies in the limited efficiency of neighboring aggregations, which is a critical component in the network stem. In this paper, we propose a global attention-guided dual-domain feature learning network (GAD) to address the above-mentioned issues. We first devise the contextual position-enhanced transformer (CPT) module, which is armed with an improved global attention mechanism, to produces a global-aware input embedding that serves as the guidance to subsequent aggregations. Then, the dual-domain K-nearest neighbor feature fusion (DKFF) is cascaded to conduct effective feature aggregation through novel dual-domain feature learning which appreciates both local geometric relations and long-distance semantic connections. Extensive experiments on multiple point cloud analysis tasks (e.g., classification, part segmentation, and scene semantic segmentation) demonstrate the superior performance of the proposed method and the efficacy of the devised modules.
以往的研究已经证明了基于点的神经模型在点云分析任务中的有效性。然而，为原始点坐标生成高效输入嵌入仍是一个关键问题。此外，另一个问题在于邻近聚合的效率有限，而邻近聚合是网络干系中的关键组成部分。在本文中，我们提出了一种全局注意力引导的双域特征学习网络（GAD）来解决上述问题。我们首先设计了上下文位置增强变换器（CPT）模块，该模块采用改进的全局注意力机制，生成全局感知输入嵌入，作为后续聚合的指导。然后，级联双域 K 近邻特征融合（DKFF），通过新颖的双域特征学习（既重视局部几何关系，又重视长距离语义联系）进行有效的特征聚合。在多个点云分析任务（如分类、部件分割和场景语义分割）上的广泛实验证明了所提方法的卓越性能和所设计模块的功效。
{"title":"Global Attention-Guided Dual-Domain Point Cloud Feature Learning for Classification and Segmentation","authors":"Zihao Li;Pan Gao;Kang You;Chuan Yan;Manoranjan Paul","doi":"10.1109/TAI.2024.3429050","DOIUrl":"10.1109/TAI.2024.3429050","url":null,"abstract":"Previous studies have demonstrated the effectiveness of point-based neural models on the point cloud analysis task. However, there remains a crucial issue on producing the efficient input embedding for raw point coordinates. Moreover, another issue lies in the limited efficiency of neighboring aggregations, which is a critical component in the network stem. In this paper, we propose a global attention-guided dual-domain feature learning network (GAD) to address the above-mentioned issues. We first devise the contextual position-enhanced transformer (CPT) module, which is armed with an improved global attention mechanism, to produces a global-aware input embedding that serves as the guidance to subsequent aggregations. Then, the dual-domain K-nearest neighbor feature fusion (DKFF) is cascaded to conduct effective feature aggregation through novel dual-domain feature learning which appreciates both local geometric relations and long-distance semantic connections. Extensive experiments on multiple point cloud analysis tasks (e.g., classification, part segmentation, and scene semantic segmentation) demonstrate the superior performance of the proposed method and the efficacy of the devised modules.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 10","pages":"5167-5178"},"PeriodicalIF":0.0,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141655081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-16DOI: 10.1109/TAI.2024.3428510
Jiakai Gong;Nuo Yu;Fen Han;Bin Tang;Haolong Wu;Yuan Ge
Microgrids (MGs) are essential for enhancing energy efficiency and minimizing power usage through the regulation of energy storage systems. Nevertheless, privacy-related concerns obstruct the real-time precise regulation of these systems due to unavailable state-of-charge (SOC) data. This article introduces a self-adaptive energy scheduling optimization framework for MGs that operates without SOC information, utilizing a partially observable Markov game (POMG) to decrease energy usage. Furthermore, to develop an optimal energy scheduling strategy, a MG system optimization approach using recurrent multiagent deep deterministic policy gradient (RMADDPG) is presented. This method is evaluated against other existing techniques such as MADDPG, deterministic recurrent policy gradient (DRPG), and independent Q-learning (IQL), demonstrating reductions in electrical energy consumption by 4.29%, 5.56%, and 12.95%, respectively, according to simulation outcomes.
{"title":"Energy Scheduling Optimization for Microgrids Based on Partially Observable Markov Game","authors":"Jiakai Gong;Nuo Yu;Fen Han;Bin Tang;Haolong Wu;Yuan Ge","doi":"10.1109/TAI.2024.3428510","DOIUrl":"https://doi.org/10.1109/TAI.2024.3428510","url":null,"abstract":"Microgrids (MGs) are essential for enhancing energy efficiency and minimizing power usage through the regulation of energy storage systems. Nevertheless, privacy-related concerns obstruct the real-time precise regulation of these systems due to unavailable state-of-charge (SOC) data. This article introduces a self-adaptive energy scheduling optimization framework for MGs that operates without SOC information, utilizing a partially observable Markov game (POMG) to decrease energy usage. Furthermore, to develop an optimal energy scheduling strategy, a MG system optimization approach using recurrent multiagent deep deterministic policy gradient (RMADDPG) is presented. This method is evaluated against other existing techniques such as MADDPG, deterministic recurrent policy gradient (DRPG), and independent Q-learning (IQL), demonstrating reductions in electrical energy consumption by 4.29%, 5.56%, and 12.95%, respectively, according to simulation outcomes.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 11","pages":"5371-5380"},"PeriodicalIF":0.0,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-16DOI: 10.1109/TAI.2024.3428513
Sen Yan;Noel E. O’Connor;Mingming Liu
Electric shared micromobility services (ESMSs) has become a vital element within the mobility as a service framework, contributing to sustainable transportation systems. However, existing ESMS face notable design challenges such as shortcomings in integration, transparency, and user-centered approaches, resulting in increased operational costs and decreased service quality. A key operational issue for ESMS revolves around parking, particularly ensuring the availability of parking spaces as users approach their destinations. For instance, a recent study illustrated that nearly 13% of shared e-bike users in Dublin, Ireland, encounter difficulties parking their e-bikes due to inadequate planning and guidance. In response, we introduce U-Park, a user-centric smart parking recommendation system designed for ESMS, providing tailored recommendations to users by analyzing their historical mobility data, trip trajectory, and parking space availability. We present the system architecture, implement it, and evaluate its performance using real-world data from an Irish-based shared e-bike provider, MOBY Bikes. Our results illustrate U-Park's ability to predict a user's destination within a shared e-bike system, achieving an approximate accuracy rate of over 97.60%, all without requiring direct user input. Experiments have proven that this predictive capability empowers U-Park to suggest the optimal parking station to users based on the availability of predicted parking spaces, improving the probability of obtaining a parking spot by 24.91% on average and 29.66% on maximum when parking availability is limited.
{"title":"U-Park: A User-Centric Smart Parking Recommendation System for Electric Shared Micromobility Services","authors":"Sen Yan;Noel E. O’Connor;Mingming Liu","doi":"10.1109/TAI.2024.3428513","DOIUrl":"https://doi.org/10.1109/TAI.2024.3428513","url":null,"abstract":"Electric shared micromobility services (ESMSs) has become a vital element within the mobility as a service framework, contributing to sustainable transportation systems. However, existing ESMS face notable design challenges such as shortcomings in integration, transparency, and user-centered approaches, resulting in increased operational costs and decreased service quality. A key operational issue for ESMS revolves around parking, particularly ensuring the availability of parking spaces as users approach their destinations. For instance, a recent study illustrated that nearly 13% of shared e-bike users in Dublin, Ireland, encounter difficulties parking their e-bikes due to inadequate planning and guidance. In response, we introduce U-Park, a user-centric smart parking recommendation system designed for ESMS, providing tailored recommendations to users by analyzing their historical mobility data, trip trajectory, and parking space availability. We present the system architecture, implement it, and evaluate its performance using real-world data from an Irish-based shared e-bike provider, MOBY Bikes. Our results illustrate U-Park's ability to predict a user's destination within a shared e-bike system, achieving an approximate accuracy rate of over 97.60%, all without requiring direct user input. Experiments have proven that this predictive capability empowers U-Park to suggest the optimal parking station to users based on the availability of predicted parking spaces, improving the probability of obtaining a parking spot by 24.91% on average and 29.66% on maximum when parking availability is limited.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 10","pages":"5179-5193"},"PeriodicalIF":0.0,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10599560","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142442964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-15DOI: 10.1109/TAI.2024.3428519
Kamal Acharya;Alvaro Velasquez;Houbing Herbert Song
This survey article delves into the emerging and critical area of symbolic knowledge distillation in large language models (LLMs). As LLMs such as generative pretrained transformer-3 (GPT-3) and bidirectional encoder representations from transformers (BERT) continue to expand in scale and complexity, the challenge of effectively harnessing their extensive knowledge becomes paramount. This survey concentrates on the process of distilling the intricate, often implicit knowledge contained within these models into a more symbolic, explicit form. This transformation is crucial for enhancing the interpretability, efficiency, and applicability of LLMs. We categorize the existing research based on methodologies and applications, focusing on how symbolic knowledge distillation can be used to improve the transparency and functionality of smaller, more efficient artificial intelligence (AI) models. The survey discusses the core challenges, including maintaining the depth of knowledge in a comprehensible format, and explores the various approaches and techniques that have been developed in this field. We identify gaps in current research and potential opportunities for future advancements. This survey aims to provide a comprehensive overview of symbolic knowledge distillation in LLMs, spotlighting its significance in the progression toward more accessible and efficient AI systems.
{"title":"A Survey on Symbolic Knowledge Distillation of Large Language Models","authors":"Kamal Acharya;Alvaro Velasquez;Houbing Herbert Song","doi":"10.1109/TAI.2024.3428519","DOIUrl":"https://doi.org/10.1109/TAI.2024.3428519","url":null,"abstract":"This survey article delves into the emerging and critical area of symbolic knowledge distillation in large language models (LLMs). As LLMs such as generative pretrained transformer-3 (GPT-3) and bidirectional encoder representations from transformers (BERT) continue to expand in scale and complexity, the challenge of effectively harnessing their extensive knowledge becomes paramount. This survey concentrates on the process of distilling the intricate, often implicit knowledge contained within these models into a more symbolic, explicit form. This transformation is crucial for enhancing the interpretability, efficiency, and applicability of LLMs. We categorize the existing research based on methodologies and applications, focusing on how symbolic knowledge distillation can be used to improve the transparency and functionality of smaller, more efficient artificial intelligence (AI) models. The survey discusses the core challenges, including maintaining the depth of knowledge in a comprehensible format, and explores the various approaches and techniques that have been developed in this field. We identify gaps in current research and potential opportunities for future advancements. This survey aims to provide a comprehensive overview of symbolic knowledge distillation in LLMs, spotlighting its significance in the progression toward more accessible and efficient AI systems.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 12","pages":"5928-5948"},"PeriodicalIF":0.0,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-15DOI: 10.1109/TAI.2024.3428520
Han Wu;Sareh Rowlands;Johan Wahlström
Object detection systems using deep learning models have become increasingly popular in robotics thanks to the rising power of central processing units (CPUs) and graphics processing units (GPUs) in embedded systems. However, these models are susceptible to adversarial attacks. While some attacks are limited by strict assumptions on access to the detection system, we propose a novel hardware attack inspired by Man-in-the-Middle attacks in cryptography. This attack generates a universal adversarial perturbations (UAPs) and injects the perturbation between the universal serial bus (USB) camera and the detection system via a hardware attack. Besides, prior research is misled by an evaluation metric that measures the model accuracy rather than the attack performance. In combination with our proposed evaluation metrics, we significantly increased the strength of adversarial perturbations. These findings raise serious concerns for applications of deep learning models in safety-critical systems, such as autonomous driving.
{"title":"A Human-in-the-Middle Attack Against Object Detection Systems","authors":"Han Wu;Sareh Rowlands;Johan Wahlström","doi":"10.1109/TAI.2024.3428520","DOIUrl":"https://doi.org/10.1109/TAI.2024.3428520","url":null,"abstract":"Object detection systems using deep learning models have become increasingly popular in robotics thanks to the rising power of central processing units (CPUs) and graphics processing units (GPUs) in embedded systems. However, these models are susceptible to adversarial attacks. While some attacks are limited by strict assumptions on access to the detection system, we propose a novel hardware attack inspired by Man-in-the-Middle attacks in cryptography. This attack generates a universal adversarial perturbations (UAPs) and injects the perturbation between the universal serial bus (USB) camera and the detection system via a hardware attack. Besides, prior research is misled by an evaluation metric that measures the model accuracy rather than the attack performance. In combination with our proposed evaluation metrics, we significantly increased the strength of adversarial perturbations. These findings raise serious concerns for applications of deep learning models in safety-critical systems, such as autonomous driving.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 10","pages":"4884-4892"},"PeriodicalIF":0.0,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142443113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-12DOI: 10.1109/TAI.2024.3427068
Zidong Cao;Hao Ai;Athanasios V. Vasilakos;Lin Wang
To predict high-resolution (HR) omnidirectional depth maps, existing methods typically leverage HR omnidirectional image (ODI) as the input via fully supervised learning. However, in practice, taking HR ODI as input is undesired due to resource-constrained devices. In addition, depth maps are often with lower resolution than color images. Therefore, in this article, we explore for the first time to estimate the HR omnidirectional depth directly from a low-resolution (LR) ODI, when no HR depth ground truth (GT) map is available. Our key idea is to transfer the scene structural knowledge from the HR image modality and the corresponding LR depth maps to achieve the goal of HR depth estimation without any extra inference cost. Specifically, we introduce ODI super-resolution (SR) as an auxiliary task and train both tasks collaboratively in a weakly supervised manner to boost the performance of HR depth estimation. The ODI SR task extracts the scene structural knowledge via uncertainty estimation. Buttressed by this, a scene structural knowledge transfer (SSKT) module is proposed with two key components. First, we employ a cylindrical implicit interpolation function (CIIF) to learn cylindrical neural interpolation weights for feature up-sampling and share the parameters of CIIFs between the two tasks. Then, we propose a feature distillation (FD) loss that provides extra structural regularization to help the HR depth estimation task learn more scene structural knowledge. Extensive experiments demonstrate that our weakly supervised method outperforms baseline methods, and even achieves comparable performance with the fully supervised methods.
为了预测高分辨率（HR）全向深度图，现有方法通常通过完全监督学习，利用 HR 全向图像（ODI）作为输入。然而，在实际应用中，由于设备资源有限，将高分辨率全向图像作为输入是不可取的。此外，深度图的分辨率通常低于彩色图像。因此，在本文中，我们首次探索了在没有高清深度地面实况（GT）图的情况下，直接从低分辨率（LR）ODI 估算高清全向深度的方法。我们的主要想法是从高分辨率图像模式和相应的低分辨率深度图中转移场景结构知识，以实现高分辨率深度估计的目标，而无需任何额外的推理成本。具体来说，我们引入 ODI 超分辨率（SR）作为辅助任务，并以弱监督的方式对两个任务进行协同训练，以提高 HR 深度估计的性能。ODI SR 任务通过不确定性估计提取场景结构知识。在此基础上，我们提出了一个场景结构知识转移（SSKT）模块，该模块由两个关键部分组成。首先，我们采用圆柱隐式插值函数（CIIF）来学习用于特征上采样的圆柱神经插值权重，并在两个任务之间共享 CIIF 的参数。然后，我们提出了一种提供额外结构正则化的特征蒸馏（FD）损失，以帮助 HR 深度估计任务学习更多场景结构知识。大量实验证明，我们的弱监督方法优于基线方法，甚至达到了与完全监督方法相当的性能。
{"title":"360° High-Resolution Depth Estimation via Uncertainty-Aware Structural Knowledge Transfer","authors":"Zidong Cao;Hao Ai;Athanasios V. Vasilakos;Lin Wang","doi":"10.1109/TAI.2024.3427068","DOIUrl":"https://doi.org/10.1109/TAI.2024.3427068","url":null,"abstract":"To predict high-resolution (HR) omnidirectional depth maps, existing methods typically leverage HR omnidirectional image (ODI) as the input via fully supervised learning. However, in practice, taking HR ODI as input is undesired due to resource-constrained devices. In addition, depth maps are often with lower resolution than color images. Therefore, in this article, we explore for the first time to estimate the HR omnidirectional depth directly from a low-resolution (LR) ODI, when no HR depth ground truth (GT) map is available. Our key idea is to transfer the scene structural knowledge from the HR image modality and the corresponding LR depth maps to achieve the goal of HR depth estimation without any extra inference cost. Specifically, we introduce ODI super-resolution (SR) as an auxiliary task and train both tasks collaboratively in a weakly supervised manner to boost the performance of HR depth estimation. The ODI SR task extracts the scene structural knowledge via uncertainty estimation. Buttressed by this, a scene structural knowledge transfer (SSKT) module is proposed with two key components. First, we employ a cylindrical implicit interpolation function (CIIF) to learn cylindrical neural interpolation weights for feature up-sampling and share the parameters of CIIFs between the two tasks. Then, we propose a feature distillation (FD) loss that provides extra structural regularization to help the HR depth estimation task learn more scene structural knowledge. Extensive experiments demonstrate that our weakly supervised method outperforms baseline methods, and even achieves comparable performance with the fully supervised methods.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 11","pages":"5392-5402"},"PeriodicalIF":0.0,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-11DOI: 10.1109/TAI.2024.3426408
José Luis Corcuera Bárcena;Francesco Marcelloni;Alessandro Renda;Alessio Bechini;Pietro Ducange
Federated clustering lets multiple data owners collaborate in discovering patterns from distributed data without violating privacy requirements. The federated versions of traditional clustering algorithms proposed so far are, however, “lossy” since they fail to identify exactly the same clusters as the original versions executed on the merged data stored in a centralized server, as would happen if no privacy constraint occurred. In this article, we propose federated procedures for losslessly executing the C-means (CM) and the fuzzy C-means (FCM) algorithms in both horizontally and vertically partitioned data scenarios, while preserving data privacy. We formally prove that the proposed federated procedures identify the same clusters determined by applying the algorithms to the union of all local data. Further, we present an extensive experimental analysis for characterizing the behavior of the proposed approach in a typical federated learning scenario, that is, as the fraction of participants in the federation changes. We focus on the federated FCM and the horizontally partitioned data, which is the most interesting scenario. We show that the proposed procedure is effective and is able to achieve competitive performance with respect to two recently proposed versions of federated FCM for horizontally partitioned data.
{"title":"Federated $c$-Means and Fuzzy $c$-Means Clustering Algorithms for Horizontally and Vertically Partitioned Data","authors":"José Luis Corcuera Bárcena;Francesco Marcelloni;Alessandro Renda;Alessio Bechini;Pietro Ducange","doi":"10.1109/TAI.2024.3426408","DOIUrl":"https://doi.org/10.1109/TAI.2024.3426408","url":null,"abstract":"Federated clustering lets multiple data owners collaborate in discovering patterns from distributed data without violating privacy requirements. The federated versions of traditional clustering algorithms proposed so far are, however, “lossy” since they fail to identify exactly the same clusters as the original versions executed on the merged data stored in a centralized server, as would happen if no privacy constraint occurred. In this article, we propose federated procedures for losslessly executing the C-means (CM) and the fuzzy C-means (FCM) algorithms in both horizontally and vertically partitioned data scenarios, while preserving data privacy. We formally prove that the proposed federated procedures identify the same clusters determined by applying the algorithms to the union of all local data. Further, we present an extensive experimental analysis for characterizing the behavior of the proposed approach in a typical federated learning scenario, that is, as the fraction of participants in the federation changes. We focus on the federated FCM and the horizontally partitioned data, which is the most interesting scenario. We show that the proposed procedure is effective and is able to achieve competitive performance with respect to two recently proposed versions of federated FCM for horizontally partitioned data.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 12","pages":"6426-6441"},"PeriodicalIF":0.0,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10595840","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：