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

arXiv 2024年

作者： Huang, Yanyong Yang, Li Wang, Dongjie Li, Ke Yi, Xiuwen Lv, Fengmao Li, Tianrui Joint Laboratory of Data Science and Business Intelligence School of Statistics Southwestern University of Finance and Economics Chengdu611130 China Department of Electrical Engineering and Computer Science University of Kansas LawrenceKS66045 United States JD Intelligent Cities Research and JD Intelligent Cities Business Unit Beijing100176 China School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China

Semi-supervised multi-label feature selection has recently been developed to solve the curse of dimensionality problem in high-dimensional multi-label data with certain samples missing labels. Although many efforts have been made, most existing methods use a predefined graph approach to capture the sample similarity or the label correlation. In this manner, the presence of noise and outliers within the original feature space can undermine the reliability of the resulting sample similarity graph. It also fails to precisely depict the label correlation due to the existence of unknown labels. Besides, these methods only consider the discriminative power of selected features, while neglecting their redundancy. In this paper, we propose an Adaptive Collaborative Correlation lEarning-based Semi-Supervised Multi-label Feature Selection (Access-MFS) method to address these issues. Specifically, a generalized regression model equipped with an extended uncorrelated constraint is introduced to select discriminative yet irrelevant features and maintain consistency between predicted and ground-truth labels in labeled data, simultaneously. Then, the instance correlation and label correlation are integrated into the proposed regression model to adaptively learn both the sample similarity graph and the label similarity graph, which mutually enhance feature selection performance. Extensive experimental results demonstrate the superiority of the proposed Access-MFS over other state-of-the-art methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

FaceOri: Tracking Head Position and Orientation Using Ultrasonic Ranging on Earphones

arXiv

引用

arXiv 2022年

作者： Wang, Yuntao Ding, Jiexin Chatterjee, Ishan Parizi, Farshid Salemi Zhuang, Yuzhou Yan, Yukang Patel, Shwetak Shi, Yuanchun Key Laboratory of Pervasive Computing Ministry of Education Department of Computer Science and Technology Tsinghua University Beijing China Institute Tsinghua University Beijing China Paul G. Allen School of Computer Science and Engineering University of Washington SeattleWA United States Electrical and Computer Engineering University of Washington SeattleWA United States Department of Computer Science and Technology Tsinghua University Beijing China

Face orientation can often indicate users' intended interaction target. In this paper, we propose FaceOri, a novel face tracking technique based on acoustic ranging using earphones. FaceOri can leverage the speaker on a commodity device to emit an ultrasonic chirp, which is picked up by the set of microphones on the user's earphone, and then processed to calculate the distance from each microphone to the device. These measurements are used to derive the user's face orientation and distance with respect to the device. We conduct a ground truth comparison and user study to evaluate FaceOri's performance. The results show that the system can determine whether the user orients to the device at a 93.5% accuracy within a 1.5 meters range. Furthermore, FaceOri can continuously track user's head orientation with a median absolute error of 10.9 mm in the distance, 3.7◦ in yaw, and 5.8◦ in pitch. FaceOri can allow for convenient hands-free control of devices and produce more intelligent context-aware interactions. Copyright © 2022, The Authors. All rights reserved.

关键词： Ultrasonic applications

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-Based Object Pose Estimation: A Comprehensive Survey

arXiv

引用

arXiv 2024年

作者： Liu, Jian Sun, Wei Yang, Hui Zeng, Zhiwen Liu, Chongpei Zheng, Jin Liu, Xingyu Rahmani, Hossein Sebe, Nicu Mian, Ajmal The National Engineering Research Center for Robot Visual Perception and Control Technology College of Electrical and Information Engineering the State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body Hunan University Changsha410082 China The School of Architecture and Art Central South University Changsha410082 China The Department of Automation Tsinghua University Beijing100084 China The School of Computing and Communications Lancaster University LA1 4YW United Kingdom The Department of Information Engineering and Computer Science University of Trento Trento38123 Italy The Department of Computer Science The University of Western Australia WA6009 Australia

Object pose estimation is a fundamental computer vision problem with broad applications in augmented reality and robotics. Over the past decade, deep learning models, due to their superior accuracy and robustness, have increasingly supplanted conventional algorithms reliant on engineered point pair features. Nevertheless, several challenges persist in contemporary methods, including their dependency on labeled training data, model compactness, robustness under challenging conditions, and their ability to generalize to novel unseen objects. A recent survey discussing the progress made on different aspects of this area, outstanding challenges, and promising future directions, is missing. To fill this gap, we discuss the recent advances in deep learning-based object pose estimation, covering all three formulations of the problem, i.e., instance-level, category-level, and unseen object pose estimation. Our survey also covers multiple input data modalities, degrees-of-freedom of output poses, object properties, and downstream tasks, providing the readers with a holistic understanding of this field. Additionally, it discusses training paradigms of different domains, inference modes, application areas, evaluation metrics, and benchmark datasets, as well as reports the performance of current state-of-the-art methods on these benchmarks, thereby facilitating the readers in selecting the most suitable method for their application. Finally, the survey identifies key challenges, reviews the prevailing trends along with their pros and cons, and identifies promising directions for future research. We also keep tracing the latest works at Awesome-Object-Pose-Estimation. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Investigation of traffic radar coverage efficiency under different placement strategies

Investigation of traffic radar coverage efficiency under dif...

引用

International Conference on Internet of Things 2024 (ICIoT 2024)

作者： Shun Yao Jin Zhou David Chieng Chiew Foong Kwong Boon Giin Lee Jianqiang Li Yusen Chen Next-Generation Internet of Everything Laboratory Department of Electrical and Electronic Engineering University of Nottingham Ningbo People's Republic of China School of Computer Science University of Nottingham Ningbo People's Republic of China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen People's Republic of China Zhejiang Communication Investment Group Co. Ltd. Zhejiang People's Republic of China

ISBN: (数字)9781837242177

This paper presents a comprehensive investigation of traffic radar coverage efficiency under different placement strategies in collaboration with Zhejiang Communications Investment Group Company Limited (CICO). The overall goal is to maximise coverage while minimising blind spots and the number of radars, given the constraints of the road. The NSGA-II multi-objective optimisation algorithm is found to be capable of generating a set of optimal solutions for the proposed radar placement configurations. When aiming for 100% coverage, the results indicate that a multi-antenna radar configuration requires the lowest radar density. Overall, this study provides valuable insights to transportation infrastructure owners in determining the best radar placement strategies for road traffic monitoring.

关键词：

来源：评论

学校读者我要写书评

暂无评论

APPFLx: Providing Privacy-Preserving Cross-Silo Federated Learning as a Service

APPFLx: Providing Privacy-Preserving Cross-Silo Federated Le...

引用

IEEE International Conference on e-science and Grid computing

作者： Zilinghan Li Shilan He Pranshu Chaturvedi Trung-Hieu Hoang Minseok Ryu E. A. Huerta Volodymyr Kindratenko Jordan Fuhrman Maryellen Giger Ryan Chard Kibaek Kim Ravi Madduri Data Science and Learning Division Argonne National Laboratory Lemont IL USA Department of Computer Science University of Illinois at Urbana-Champaign Urbana IL USA National Center for Supercomputing Applications University of Illinois at Urbana-Champaign Urbana IL USA Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign Urbana IL USA School of Computing and Augmented Intelligence Arizona State University Tempe AZ USA Department of Physics University of Illinois at Urbana-Champaign Urbana IL USA Department of Computer Science The University of Chicago Chicago IL USA Mathematics and Computer Science Division Argonne National Laboratory Lemont IL USA University of Chicago Consortium for Advanced Science and Engineering Chicago IL USA

Cross-silo privacy-preserving federated learning (PPFL) is a powerful tool to collaboratively train robust and generalized machine learning (ML) models without sharing sensitive (e.g., healthcare of financial) local data. To ease and accelerate the adoption of PPFL, we introduce APPFLx, a ready-to-use platform that provides privacy-preserving cross-silo federated learning as a service. APPFLx employs Globus authentication to allow users to easily and securely invite trustworthy collaborators for PPFL, implements several synchronous and asynchronous FL algorithms, streamlines the FL experiment launch process, and enables tracking and visualizing the life cycle of FL experiments, allowing domain experts and ML practitioners to easily orchestrate and evaluate cross-silo FL under one platform. APPFLx is available online at https://***

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Adaptive Fault-Tolerant Output Regulation of Heterogeneous Multi-Agent Systems With Coupling Uncertainties and Actuator Faults

引用

IEEE/CAA Journal of Automatica Sinica 2020年第4期7卷 1098-1106页

作者： Chao Deng Weinan Gao Weiwei Che the School of Electrical and Electronic Engineering Nanyang Technological UniversitySingapore 639798Singapore the Department of Electrical and Computer Engineering Allen E.Paulson College of Engineering and ComputingGeorgia Southern UniversityStatesboroGA 30460 USA the State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and ControlZhejiang UniversityHangzhou 310027 the Institute of Complexity Science Qingdao UniversityQingdao 266071China

In this paper, we consider the distributed adaptive fault-tolerant output regulation problem for heterogeneous multiagent systems with matched system uncertainties and mismatched coupling uncertainties among subsystems under the influence of actuator faults. First, distributed finite-time observers are proposed for all subsystems to observe the state of the exosystem. Then, a novel fault-tolerant controller is designed to compensate for the influence of matched system uncertainties and actuator faults. By using the linear matrix inequality technique, a sufficient condition is provided to guarantee the solvability of the considered problem in the presence of mismatched coupling uncertainties. Moreover, it is shown that the system in closed-loop with the developed controller can achieve output regulation by using the Lyapunov stability theory and cyclic-small-gain ***, a numerical example is given to illustrate the effectiveness of the obtained result.

关键词： Adaptive control cyclic-small-gain fault-tolerant control multi-agent systems(MASs)

来源：评论

学校读者我要写书评

暂无评论

Decentralized Nonconvex Robust Optimization over Unsafe Multiagent Systems: System Modeling, Utility, Resilience, and Privacy Analysis

arXiv

引用

arXiv 2024年

作者： Hu, Jinhui Chen, Guo Li, Huaqing Cheng, Huqiang Guo, Xiaoyu Huang, Tingwen School of Automation Central South University Changsha410083 China Department of Biomedical Engineering City University of Hong Kong Kowloon Hong Kong School of Electrical Engineering and Telecommunications University of New South Wales SydneyNSW2052 Australia Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China Key Laboratory of Dependable Services Computing in Cyber Physical Society Ministry of Education College of Computer Science Chongqing University Chongqing400044 China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518055 China

Privacy leakage and Byzantine failures are two adverse factors to the intelligent decision-making process of multiagent systems (MASs). Considering an unsafe MAS with these two issues, this paper targets the resolution of a class of nonconvex optimization problems under the Polyak-Lojasiewicz (P-L) condition. To address this problem, we first identify and construct the unsafe MAS model. Under this kind of unfavorable MASs, we mask the local gradients with Gaussian noises and adopt a resilient aggregation method self-centered clipping (SCC) to design a differentially private (DP) decentralized Byzantine-resilient algorithm, namely DP-SCC-PL, which simultaneously achieves differential privacy and Byzantine resilience. The convergence analysis of DP-SCC-PL is challenging since the convergence error can be contributed jointly by privacy-preserving and Byzantine-resilient mechanisms, as well as the nonconvex relaxation, which is addressed via seeking the contraction relationships among the disagreement measure of reliable agents before and after SCC aggregation, together with the optimal gap. Theoretical results reveal that DP-SCC-PL achieves consensus among all reliable agents and sublinear (inexact) convergence with well-designed step-sizes. It has also been proved that if there are no privacy issues and Byzantine agents, then the asymptotic exact convergence can be recovered. Numerical experiments verify the utility, resilience, and differential privacy of DP-SCC-PL by tackling a nonconvex optimization problem satisfying the P-L condition under various Byzantine attacks. Copyright © 2024, The Authors. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Fusing Bluetooth with Pedestrian Dead Reckoning: A Floor Plan-Assisted Positioning Approach

arXiv

引用

arXiv 2025年

作者： Pan, Wenxuan Yang, Yang Chen, Mingzhe Wei, Dong Guo, Caili Mao, Shiwen Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Department of Electrical and Computer Engineering the Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Wireless Engineering Research and Education Center Auburn University AuburnAL36849 United States

Floor plans can provide valuable prior information that helps enhance the accuracy of indoor positioning systems. However, existing research typically faces challenges in efficiently leveraging floor plan information and applying it to complex indoor layouts. To fully exploit information from floor plans for positioning, we propose a floor plan-assisted fusion positioning algorithm (FP-BP) using Bluetooth low energy (BLE) and pedestrian dead reckoning (PDR). In the considered system, a user holding a smartphone walks through a positioning area with BLE beacons installed on the ceiling, and can locate himself in real time. In particular, FP-BP consists of two phases. In the offline phase, FP-BP programmatically extracts map features from a stylized floor plan based on their binary masks, and constructs a mapping function to identify the corresponding map feature of any given position on the map. In the online phase, FP-BP continuously computes BLE positions and PDR results from BLE signals and smartphone sensors, where a novel grid-based maximum likelihood estimation (GML) algorithm is introduced to enhance BLE positioning. Then, a particle filter is used to fuse them and obtain an initial estimate. Finally, FP-BP performs post-position correction to obtain the final position based on its specific map feature. Experimental results show that FP-BP can achieve a real-time mean positioning accuracy of 1.19 m, representing an improvement of over 28% compared to existing floor plan-fused baseline algorithms. Copyright © 2025, The Authors. All rights reserved.

关键词： Photomapping

来源：评论

学校读者我要写书评

暂无评论

Optimizing Generative AI Networking: A Dual Perspective with Multi-Agent Systems and Mixture of Experts

arXiv

引用

arXiv 2024年

作者： Zhang, Ruichen Du, Hongyang Niyato, Dusit Kang, Jiawen Xiong, Zehui Zhang, Ping Kim, Dong In The College of Computing and Data Science Nanyang Technological University Singapore The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

In the continued development of next-generation networking and artificial intelligence content generation (AIGC) services, the integration of multi-agent systems (MAS) and the mixture of experts (MoE) frameworks is becoming increasingly important. Motivated by this, this article studies the contrasting and converging of MAS and MoE in AIGC-enabled networking. First, we discuss the architectural designs, operational procedures, and inherent advantages of using MAS and MoE in generative AI to explore its functionality and applications fully. Next, we review the applications of MAS and MoE frameworks in content generation and resource allocation, emphasizing their impact on networking operations. Subsequently, we propose a novel multi-agent-enabled MoE-proximal policy optimization (MoE-PPO) framework for 3D object generation and data transfer scenarios. The framework uses MAS for dynamic task coordination of each network service provider agent and MoE for expert-driven execution of respective tasks, thereby improving overall system efficiency and adaptability. The simulation results demonstrate the effectiveness of our proposed framework and significantly improve the performance indicators under different network conditions. Finally, we outline potential future research directions. © 2024, CC BY.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Touchstone benchmark: are we on the right way for evaluating AI algorithms for medical segmentation? 24

Touchstone benchmark: are we on the right way for evaluating...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Pedro R. A. S. Bassi Wenxuan Li Yucheng Tang Fabian Isensee Zifu Wang Jieneng Chen Yu-Cheng Chou Saikat Roy Yannick Kirchhoff Maximilian Rokuss Ziyan Huang Jin Ye Junjun He Tassilo Wald Constantin Ulrich Michael Baumgartner Klaus H. Maier-Hein Paul Jaeger Yiwen Ye Yutong Xie Jianpeng Zhang Ziyang Chen Yong Xia Zhaohu Xing Lei Zhu Yousef Sadegheih Afshin Bozorgpour Pratibha Kumari Reza Azad Dorit Merhof Pengcheng Shi Ting Ma Yuxin Du Fan Bai Tiejun Huang Bo Zhao Haonan Wang Xiaomeng Li Hanxue Gu Haoyu Dong Jichen Yang Maciej A. Mazurowski Saumya Gupta Linshan Wu Jiaxin Zhuang Hao Chen Holger Roth Daguang Xu Matthew B. Blaschko Sergio Decherchi Andrea Cavalli Alan L. Yuille Zongwei Zhou Department of Computer Science Johns Hopkins University and Department of Pharmacy and Biotechnology University of Bologna and Center for Biomolecular Nanotechnologies Istituto Italiano di Tecnologia Department of Computer Science Johns Hopkins University NVIDIA Division of Medical Image Computing German Cancer Research Center (DKFZ) and Helmholtz Imaging German Cancer Research Center (DKFZ) ESAT-PSI KU Leuven Division of Medical Image Computing German Cancer Research Center (DKFZ) and Faculty of Mathematics and Computer Science Heidelberg University Division of Medical Image Computing German Cancer Research Center (DKFZ) and Faculty of Mathematics and Computer Science Heidelberg University and HIDSS4Health - Helmholtz Information and Data Science School for Health Shanghai Jiao Tong University Shanghai Artificial Intelligence Laboratory Division of Medical Image Computing German Cancer Research Center (DKFZ) Division of Medical Image Computing German Cancer Research Center (DKFZ) and Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Helmholtz Imaging German Cancer Research Center (DKFZ) and Interactive Machine Learning Group (IML) DKFZ School of Computer Science and Engineering Northwestern Polytechnical University Australian Institute for Machine Learning The University of Adelaide College of Computer Science and Technology Zhejiang University Hong Kong University of Science and Technology (Guangzhou) Hong Kong University of Science and Technology (Guangzhou) and Hong Kong University of Science and Technology Faculty of Informatics and Data Science University of Regensburg Faculty of Electrical Engineering and Information Technology RWTH Aachen University Faculty of Informatics and Data Science University of Regensburg and Fraunhofer Institute for Digital Medicine MEVIS Electronic & Information Engineering School Harbin Institute of Technology (Shenzhen) Shanghai Jiao Tong University and Beijing Academy of Artificial Intelligence (BAAI) S

ISBN: (纸本)9798331314385

How can we test AI performance? This question seems trivial, but it isn't. Standard benchmarks often have problems such as in-distribution and small-size test sets, oversimplified metrics, unfair comparisons, and short-term outcome pressure. As a consequence, good performance on standard benchmarks does not guarantee success in real-world scenarios. To address these problems, we present Touchstone, a large-scale collaborative segmentation benchmark of 9 types of abdominal organs. This benchmark is based on 5,195 training CT scans from 76 hospitals around the world and 5,903 testing CT scans from 11 additional hospitals. This diverse test set enhances the statistical significance of benchmark results and rigorously evaluates AI algorithms across out-of-distribution scenarios. We invited 14 inventors of 19 AI algorithms to train their algorithms, while our team, as a third party, independently evaluated these algorithms. In addition, we also evaluated pre-existing AI frameworks—which, differing from algorithms, are more flexible and can support different algorithms—including MONAI from NVIDIA, nnU-Net from DKFZ, and numerous other open-source frameworks. We are committed to expanding this benchmark to encourage more innovation of AI algorithms for the medical domain.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：