检索结果-内蒙古大学图书馆

arXiv 2024年

作者： Yenduri, Gokul Ramalingam, M. Maddikunta, Praveen Kumar Reddy Gadekallu, Thippa Reddy Jhaveri, Rutvij H. Bandi, Ajay Chen, Junxin Wang, Wei Shirawalmath, Adarsh Arunkumar Ravishankar, Raghav Wang, Weizheng School of Computer Science and Engineering VIT-AP University Andhra Pradesh Amaravati522237 India School of Computer Science Engineering and Information Systems Vellore Institute of Technology TamilNadu 632014 India Zhongda Group Haiyan County Zhejiang Province Jiaxing City314312 China College of Information Science and Engineering Jiaxing University Jiaxing314001 China Division of Research and Development Lovely Professional University Phagwara India Department of Computer Science and Engineering School of Technology Pandit Deendayal Energy University Gandhinagar India School of Computer Science and Information Systems Northwest Missouri State University 800 University Dr MaryvilleMO64468 United States School of Software Dalian University of Technology Dalian116621 China Guangdong-Hong Kong-Macao Joint Laboratory for Emotional Intelligence and Pervasive Computing Artificial Intelligence Research Institute Shenzhen MSU-BIT University Guangdong Shenzhen518172 China School of Medical Technology Beijing Institute of Technology Beijing100081 China School of Computer Science and Engineering Vellore Institute of Technology TamilNadu 632014 India Department of Computer Science City University of Hong Kong Hong Kong

Spatial computing is a technological advancement that facilitates the seamless integration of devices into the physical environment, resulting in a more natural and intuitive digital world user experience. Spatial computing has the potential to become a significant advancement in the field of computing. From GPS and location-based services to healthcare, spatial computing technologies have influenced and improved our interactions with the digital world. The use of spatial computing in creating interactive digital environments has become increasingly popular and effective. This is explained by its increasing significance among researchers and industrial organisations, which motivated us to conduct this review. This review provides a detailed overview of spatial computing, including its enabling technologies and its impact on various applications. Projects related to spatial computing are also discussed. In this review, we also explored the potential challenges and limitations of spatial computing. Furthermore, we discuss potential solutions and future directions. Overall, this paper aims to provide a comprehensive understanding of spatial computing, its enabling technologies, their impact on various applications, emerging challenges, and potential solutions. © 2024, CC BY.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

Complementing Event Streams and RGB Frames for Hand Mesh Reconstruction

arXiv

引用

arXiv 2024年

作者： Jiang, Jianping Zhou, Xinyu Wang, Bingxuan Deng, Xiaoming Xu, Chao Shi, Boxin National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University China National Engineering Research Center of Visual Technology School of Computer Science Peking University China AI Innovation Center School of Computer Science Peking University China National Key Lab of General AI School of Intelligence Science and Technology Peking University China Institute of Software Chinese Academy of Sciences China University of Chinese Academy of Sciences China

Reliable hand mesh reconstruction (HMR) from commonly-used color and depth sensors is challenging especially under scenarios with varied illuminations and fast motions. Event camera is a highly promising alternative for its high dynamic range and dense temporal resolution properties, but it lacks salient texture appearance for hand mesh reconstruction. In this paper, we propose EvRGBHand – the first approach for 3D hand mesh reconstruction with an event camera and an RGB camera compensating for each other. By fusing two modalities of data across time, space, and information dimensions, EvRGBHand can tackle overexposure and motion blur issues in RGB-based HMR and foreground scarcity as well as background overflow issues in event-based HMR. We further propose EvRGBDegrader, which allows our model to generalize effectively in challenging scenes, even when trained solely on standard scenes, thus reducing data acquisition costs. Experiments on real-world data demonstrate that EvRGBHand can effectively solve the challenging issues when using either type of camera alone via retaining the merits of both, and shows the potential of generalization to outdoor scenes and another type of event camera. For code, models, and dataset, please refer to https://***/***/. Copyright © 2024, The Authors. All rights reserved.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Exploring Flat Minima for Domain Generalization with Large Learning Rates

arXiv

引用

arXiv 2023年

作者： Zhang, Jian Qi, Lei Shi, Yinghuan Gao, Yang the State Key Laboratory for Novel Software Technology National Institute of Healthcare Data Science Nanjing University Nanjing210023 China The School of Computer Science and Engineering Southeast University Nanjing211189 China

Domain Generalization (DG) aims to generalize to arbitrary unseen domains. A promising approach to improve model generalization in DG is the identification of flat minima. One typical method for this task is SWAD, which involves averaging weights along the training trajectory. However, the success of weight averaging depends on the diversity of weights, which is limited when training with a small learning rate. Instead, we observe that leveraging a large learning rate can simultaneously promote weight diversity and facilitate the identification of flat regions in the loss landscape. However, employing a large learning rate suffers from the convergence problem, which cannot be resolved by simply averaging the training weights. To address this issue, we introduce a training strategy called Lookahead which involves the weight interpolation, instead of average, between fast and slow weights. The fast weight explores the weight space with a large learning rate, which is not converged while the slow weight interpolates with it to ensure the convergence. Besides, weight interpolation also helps identify flat minima by implicitly optimizing the local entropy loss that measures flatness. To further prevent overfitting during training, we propose two variants to regularize the training weight with weighted averaged weight or with accumulated history weight. Taking advantage of this new perspective, our methods achieve state-of-the-art performance on both classification and semantic segmentation domain generalization benchmarks. The code is available at https://***/koncle/DG-with-Large-LR. Copyright © 2023, The Authors. All rights reserved.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

FedCPSO: Federated Learning with Combined Particle Swarm Optimization

FedCPSO: Federated Learning with Combined Particle Swarm Opt...

引用

Chinese Automation Congress (CAC)

作者： Hongjian Shi Ruhui Ma Haibing Guan Weishan Zhang School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Qingdao Institute of Software College of Computer Science and Technology China University of Petroleum (East China) Qingdao China

The development of the Internet of Things (IoT) has allowed devices to collect massive amounts of data, and Artificial Intelligence (AI) provides the ability to analyze those data. Moreover, researchers adopt Distributed Machine Learning (DML) methods to train neural networks collaboratively using different users' data. However, DML suffers from privacy issues, and Federated Learning (FL) has been an effective solution. FL transfers the model instead of the data to protect privacy, but the trained models have low accuracies over local datasets due to statistical heterogeneity. Thus, personalized FL (pFL) algorithms have been proposed to handle such heterogeneous data distribution. However, the communication overhead in the pFL algorithms is significant as it requires transmitting additional information. Thus, we propose Federated Learning with Com-bined Particle Swarm Optimization (FedCPSO) in this paper. FedCPSO replaces the aggregation process of FL algorithms with PSO, and we design a velocity in PSO specifically for FL algorithms, using the best global model, the best client models, and the best neighbor models. In addition, we also implement magnitude pruning to reduce the communication volume. The experimental results illustrate that FedCPSO can reduce up to 50% communication volume while having less than a 2% accuracy drop compared with the State-of-the-art (SOTA) pFL algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Generalizable Decision Boundaries: Dualistic Meta-Learning for Open Set Domain Generalization

Generalizable Decision Boundaries: Dualistic Meta-Learning f...

引用

International Conference on computer Vision (ICCV)

作者： Xiran Wang Jian Zhang Lei Qi Yinghuan Shi Nanjing University State Key Laboratory for Novel Software Technology and National Institute of Healthcare Data Science Nanjing University China Southeast University School of Computer Science and Engineering Southeast University China

Domain generalization (DG) is proposed to deal with the issue of domain shift, which occurs when statistical differences exist between source and target domains. However, most current methods do not account for a common realistic scenario where the source and target domains have different classes. To overcome this deficiency, open set domain generalization (OSDG) then emerges as a more practical setting to recognize unseen classes in unseen domains. An intuitive approach is to use multiple one-vs-all classifiers to define decision boundaries for each class and reject the outliers as unknown. However, the significant class imbalance between positive and negative samples often causes the boundaries biased towards positive ones, resulting in misclassification for known samples in the unseen target domain. In this paper, we propose a novel meta-learning-based framework called dualistic MEta-learning with joint DomaIn-Class matching (MEDIC), which considers gradient matching towards inter-domain and inter-class splits simultaneously to find a generalizable boundary balanced for all tasks. Experimental results demonstrate that MEDIC not only outperforms previous methods in open set scenarios, but also maintains competitive close set generalization ability at the same time. Our code is available at https://***/zzwdx/MEDIC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Instance-aware Dynamic Prompt Tuning for Pre-trained Point Cloud Models

Instance-aware Dynamic Prompt Tuning for Pre-trained Point C...

引用

International Conference on computer Vision (ICCV)

作者： Yaohua Zha Jinpeng Wang Tao Dai Bin Chen Zhi Wang Shu-Tao Xia Tsinghua Shenzhen International Graduate School Tsinghua University College of Computer Science and Software Engineering Shenzhen University Harbin Institute of Technology Shenzhen Research Center of Artificial Intelligence Peng Cheng Laboratory

Pre-trained point cloud models have found extensive applications in 3D understanding tasks like object classification and part segmentation. However, the prevailing strategy of full fine-tuning in downstream tasks leads to large per-task storage overhead for model parameters, which limits the efficiency when applying large-scale pre-trained models. Inspired by the recent success of visual prompt tuning (VPT), this paper attempts to explore prompt tuning on pre-trained point cloud models, to pursue an elegant balance between performance and parameter efficiency. We find while instance-agnostic static prompting, e.g. VPT, shows some efficacy in downstream transfer, it is vulnerable to the distribution diversity caused by various types of noises in real-world point cloud data. To conquer this limitation, we propose a novel Instance-aware Dynamic Prompt Tuning (IDPT) strategy for pre-trained point cloud models. The essence of IDPT is to develop a dynamic prompt generation module to perceive semantic prior features of each point cloud instance and generate adaptive prompt tokens to enhance the model's robustness. Notably, extensive experiments demonstrate that IDPT outperforms full finetuning in most tasks with a mere 7% of the trainable parameters, providing a promising solution to parameter-efficient learning for pre-trained point cloud models. Code is available at https://***/zyh16143998882/ICCV23-IDPT.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhancing Sovereign Allocation of Resources in Cloud Milieus Using a Causal Dilated Geometric Algebra Approach for Dynamic Scalability 2

Enhancing Sovereign Allocation of Resources in Cloud Milieus...

引用

2nd International Conference on Machine Learning and Autonomous Systems, ICMLAS 2025

作者： Katru, Chandrasekhar Rao Srinivasan, Sathish Kumar, Mohan Yadwad, Sunita Satish, G. Maranan, Ramya Lead Software Engineer Indian LandSC29707 United States Machine Learning & AI Development Oracle Cloud Infrastructure Division San FranciscoCA United States Nitte Meenakshi Institute of Technology Department of Information Science and Engineering Karnataka Bengaluru India Parul institute of Engineering and Technology Parul University Computer science and Engineering Faculty of Engineering and Technology Gujarat India Sree Dattha Institute of Engineering and Science Department of Electrical and Electronics Engineering Telangana Sheriguda India Saveetha School of Engineering SIMATS Department of Research and Innovation Tamil Nadu Chennai India

ISBN: (纸本)9798331505745

Cloud environments utilize availability and usage of resources as crucial components in order to produce scalability, reliability and low cost. Such resource capabilities require autonomous systems that can handle these resources dynamically in spite of fluctuating workloads and service delivery requirements. Static models of resource management suffer from scalability and inability to react on the fly and accurately predict the demand thus causing Service Level Agreement (SLA) breaches and affecting the Quality of Service (QoS) as well as energy consumption profile. Advanced and elaborative cloud workloads require an intelligent system that can analyse the temporal and spatial patterns without impacting the overall system's performance significantly. Inspired by these challenges, this research proposes a Causal Dilated Geometric Algebra Convolutional Transformer Network (CATNet) along with the Prairie-Dog Optimizer (P-DogO), referred to as CAT-DogNet to learn and predict the dynamic scalability. CATNet integrates Causal Dilated Convolutional Networks in time domain for temporal structure capturing and Geometric Algebra Transformer for spatial resource coding. P-DogO adjusts weight parameters and losses for resource allocation, enhancing them depending on a work environment. A set of comprehensive assessments demonstrate a 0.85% SLA violation rate, average response time of less than 10ms, and overall 12.3% less energy consumption than baseline methods. The system had favourable predictability rates over 99.4% for the resource demand estimate. CAT-DogN et presents a sound and agnostic architecture for autonomous resource allocation in cloud environment, which indeed extend the state of art by considering flexibility, power consumption and QoS compliance. © 2025 IEEE.

关键词： Infrastructure as a service (IaaS)

来源：评论

学校读者我要写书评

暂无评论

F2A2: flexible fully-decentralized approximate actor-critic for cooperative multi-agent reinforcement learning

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2023年第1期24卷 8447-8521页

作者： Wenhao Li Bo Jin Xiangfeng Wang Junchi Yan Hongyuan Zha School of Data Science The Chinese University of Hong Kong Shenzhen Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China School of Software Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China School of Computer Science and Technology Key Laboratory of Mathematics and Engineering Applications Ministry of Education East China Normal University Shanghai China Department of Computer Science and Engineering Key Laboratory of Artificial Intelligence Ministry of Education Shanghai Jiao Tong University Shanghai China

Traditional centralized multi-agent reinforcement learning (MARL) algorithms are sometimes unpractical in complicated applications due to non-interactivity between agents, the curse of dimensionality, and computation complexity. Hence, several decentralized MARL algorithms are motivated. However, existing decentralized methods only handle the fully cooperative setting where massive information needs to be transmitted in training. The block coordinate gradient descent scheme they used for successive independent actor and critic steps can simplify the calculation, but it causes serious bias. This paper proposes a exible fully decentralized actor-critic MARL framework, which can combine most of the actor-critic methods and handle large-scale general cooperative multi-agent settings. A primal-dual hybrid gradient descent type algorithm framework is designed to learn individual agents separately for decentralization. From the perspective of each agent, policy improvement and value evaluation are jointly optimized, which can stabilize multi-agent policy learning. Furthermore, the proposed framework can achieve scalability and stability for the large-scale environment. This framework also reduces information transmission by the parameter sharing mechanism and novel modeling-other-agents methods based on theory-of-mind and online supervised learning. Sufficient experiments in cooperative Multi-agent Particle Environment and StarCraft II show that the proposed decentralized MARL instantiation algorithms perform competitively against conventional centralized and decentralized methods.

关键词： cooperative MARL decentralized actor-critic primal-dual method

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Graph Interaction Transformer with Dynamic Token Clustering for Camouflaged Object Detection

arXiv

引用

arXiv 2024年

作者： Yao, Siyuan Sun, Hao Xiang, Tian-Zhu Wang, Xiao Cao, Xiaochun School of Computer Science National Pilot Software Engineering School Beijing University of Posts and Telecommunications Beijing100876 China Inception Institute of Artificial Intelligence G42 Bayanat Abu Dhabi United Arab Emirates School of Software Beihang University Beijing100083 China School of Cyber Science and Technology Sun Yat-sen University Shenzhen Campus Shenzhen518107 China

Camouflaged object detection (COD) aims to identify the objects that seamlessly blend into the surrounding backgrounds. Due to the intrinsic similarity between the camouflaged objects and the background region, it is extremely challenging to precisely distinguish the camouflaged objects by existing approaches. In this paper, we propose a hierarchical graph interaction network termed HGINet for camouflaged object detection, which is capable of discovering imperceptible objects via effective graph interaction among the hierarchical tokenized features. Specifically, we first design a region-aware token focusing attention (RTFA) with dynamic token clustering to excavate the potentially distinguishable tokens in the local region. Afterwards, a hierarchical graph interaction transformer (HGIT) is proposed to construct bi-directional aligned communication between hierarchical features in the latent interaction space for visual semantics enhancement. Furthermore, we propose a decoder network with confidence aggregated feature fusion (CAFF) modules, which progressively fuses the hierarchical interacted features to refine the local detail in ambiguous regions. Extensive experiments conducted on the prevalent datasets, i.e. COD10K, CAMO, NC4K and CHAMELEON demonstrate the superior performance of HGINet compared to existing state-of-the-art methods. Our code is available at https://***/Garyson1204/HGINet. Copyright © 2024, The Authors. All rights reserved.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Discrete Shuffled Frog Leading Algorithm for Multiple-product Human-robot Collaborative Disassembly Line Balancing Problem

Discrete Shuffled Frog Leading Algorithm for Multiple-produc...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Fan, ChenYang Wang, JiaCun Guo, XiWang Qin, ShuJin Zhou, MengChu Qi, Liang Engineering of Liaoning Petrochemical University School of Information and Control Fushun China Engineering of Monmouth University Dept. Computer Science and Software West Long Branch United States Liaoning Petrochemical University Fushun China Monmouth University West Long Branch United States College of Economics and Management of Shangqiu Normal University Shangqiu China Dept. Electrical and Computer Engineering of New Jersey Institute of Technology Newark United States Tech of Shandong University of Science and Technology Dept. Computer Intelligent Sci. & Qingdao China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

With the rapid development of recycling and remanufacturing technologies, disassembly line balancing problems (DLBP) have drawn great attention. Considering the limitation of disassembly by humans or robots alone, this paper focuses on human-robot collaborative disassembly lines. Specifically, this work proposes a multi-product human-robot collaborative disassembly line balancing model to tackle the inflexibility of single product disassembly and inconsistency in recovery values of different product components. Its objective is to maximize disassembly profit. As a commercially available solver, IBM's CPLEX is used to obtain the exact solution of DLBP and verify the correctness of the proposed mathematical model. A discrete shuffled frog leading algorithm is newly designed to solve the sizable problems. Experimental results show that the proposed algorithm has a fast convergence rate and can find solutions consistent with those with CPLEX but requires much less time than the latter, thus advancing the field of disassembly automation. © 2022 IEEE.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：