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

arXiv 2024年

作者： Huan, Ouwen Luo, Tao Chen, Mingzhe Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing100876 China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States

In this paper, a multi-modal vehicle positioning framework that jointly localizes vehicles with channel state information (CSI) and images is designed. In particular, we consider an outdoor scenario where each vehicle can communicate with only one BS, and hence, it can upload its estimated CSI to only its associated BS. Each BS is equipped with a set of cameras, such that it can collect a small number of labeled CSI, a large number of unlabeled CSI, and the images taken by cameras. To exploit the unlabeled CSI data and position labels obtained from images, we design an meta-learning based hard expectation-maximization (EM) algorithm. Specifically, since we do not know the corresponding relationship between unlabeled CSI and the multiple vehicle locations in images, we formulate the calculation of the training objective as a minimum matching problem. To reduce the impact of label noises caused by incorrect matching between unlabeled CSI and vehicle locations obtained from images and achieve better convergence, we introduce a weighted loss function on the unlabeled datasets, and study the use of a meta-learning algorithm for computing the weighted loss. Subsequently, the model parameters are updated according to the weighted loss function of unlabeled CSI samples and their matched position labels obtained from images. Simulation results show that the proposed method can reduce the positioning error by up to 61% compared to a baseline that does not use images and uses only CSI fingerprint for vehicle positioning. Copyright © 2024, The Authors. All rights reserved.

关键词： Expectation maximization algorithm

来源：评论

学校读者我要写书评

暂无评论

A Strong Privacy-Preserving and Efficient Fingerprint Authentication via Clustering

A Strong Privacy-Preserving and Efficient Fingerprint Authen...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Jingwei Liu Zihan Zhou Rong Sun Xiaojiang Du Mohsen Guizani Shaanxi Key Laboratory of Blockchain and Secure Computing Xidian University Xi'an China State Key Laboratory of ISN Xidian University Xi'an China Department of Electrical and Computer Engineering Stevens Institute of Technology Hoboken USA Department of Computer Science and Engineering Qatar University Doha Qatar

With the advancement of cloud technology, the storage and computing overhead in large-scale biometric authentication is mitigated by outsourcing data to the cloud. Since biometric features serve as a unique identifier bound to each individual, transmitting them directly to the cloud may bring about serious privacy disclosure risks. To guarantee users' biometric features, there are many solutions have been proposed. However, most of them neglect to protect identity security. In light of the challenges, this paper proposes a strong privacy-preserving fingerprint authentication via clustering. Besides safeguarding fingerprint features, the scheme also blurs the identities of users to enable anonymity of identity. Meanwhile, the authentication efficiency of the proposed scheme is improved by vector processing of fingerprints and fast retrieval of clustered identities. Furthermore, a dual-server matching architecture effectively reduces the communication overhead of the service provider. The security analysis and experimental results indicate that the proposed scheme provides strong privacy preservation while maintaining high efficiency.

关键词：

来源：评论

学校读者我要写书评

暂无评论

View-decoupled Transformer for Person Re-identification under Aerial-ground Camera Network

View-decoupled Transformer for Person Re-identification unde...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Quan Zhang Lei Wang Vishal M. Patel Xiaohua Xie Jianhuang Lai School of Computer Science and Engineering Sun Yat-Sen University China Department of Electrical and Computer Engineering Johns Hopkins University USA Pazhou Lab (HuangPu) Guangdong China Guangdong Province Key Laboratory of Information Security Technology Guangdong China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Existing person re-identification methods have achieved remarkable advances in appearance-based identity association across homogeneous cameras, such as ground-ground matching. However, as a more practical scenario, aerial-ground person re-identification (AGPReID) among heterogeneous cameras has received minimal attention. To alleviate the disruption of discriminative identity representation by dramatic view discrepancy as the most significant challenge in AGPReID, the view-decoupled transformer (VDT) is proposed as a simple yet effective framework. Two major components are designed in VDT to decouple view-related and view-unrelated features, namely hierarchical subtractive separation and orthogonal loss, where the former separates these two features inside the VDT, and the latter constrains these two to be independent. In addition, we contribute a large-scale AGPReID dataset called CARGO, consisting of five/eight aerial/ground cameras, 5,000 identities, and 108,563 images. Experiments on two datasets show that VDT is a feasible and effective solution for AGPReID, surpassing the previous method on mAP/Rank1 by up to 5.0%/2.7% on CARGO and 3.7%/5.2% on AG-ReID, keeping the same magnitude of computational complexity. Our project is available at https://***/LinlyAC/VDT-AGPReID.

关键词： computer vision Cameras Transformers Pattern recognition Computational complexity Identification of persons

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Granule Density-Based Outlier Detection with Multi-Scale Granular Balls

arXiv

引用

arXiv 2025年

作者： Gao, Can Tan, Xiaofeng Zhou, Jie Ding, Weiping Pedrycz, Witold The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The School of Artificial Intelligence and Computer Science Nantong University Nantong226019 China The Faculty of Data Science City University of Macau Macau999078 China The Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland The Department of Electrical and Computer Engineering King Abdulaziz University Jeddah Saudi Arabia The Department of Computer Engineering Istinye University Istanbul Turkey

Outlier detection refers to the identification of anomalous samples that deviate significantly from the distribution of normal data and has been extensively studied and used in a variety of practical tasks. However, most unsupervised outlier detection methods are carefully designed to detect specified outliers, while real-world data may be entangled with different types of outliers. In this study, we propose a fuzzy rough sets-based multi-scale outlier detection method to identify various types of outliers. Specifically, a novel fuzzy rough sets-based method that integrates relative fuzzy granule density is first introduced to improve the capability of detecting local outliers. Then, a multi-scale view generation method based on granular-ball computing is proposed to collaboratively identify group outliers at different levels of granularity. Moreover, reliable outliers and inliers determined by the three-way decision are used to train a weighted support vector machine to further improve the performance of outlier detection. The proposed method innovatively transforms unsupervised outlier detection into a semi-supervised classification problem and for the first time explores the fuzzy rough sets-based outlier detection from the perspective of multi-scale granular balls, allowing for high adaptability to different types of outliers. Extensive experiments carried out on both artificial and UCI datasets demonstrate that the proposed outlier detection method significantly outperforms the state-of-the-art methods, improving the results by at least 8.48% in terms of the Area Under the ROC Curve (AUROC) index. The source codes are released at https://***/Xiaofeng-Tan/MGBOD. © 2025, CC BY.

关键词： Granulation

来源：评论

学校读者我要写书评

暂无评论

Diff9D: Diffusion-Based Domain-Generalized Category-Level 9-DoF Object Pose Estimation

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第7期47卷 5520-5537页

作者： Jian Liu Wei Sun Hui Yang Pengchao Deng Chongpei Liu Nicu Sebe Hossein Rahmani Ajmal Mian National Engineering Research Center for Robot Visual Perception and Control Technology College of Electrical and Information Engineering School of Robotics and the State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body Hunan University Changsha China Institute of Artificial Intelligence and Robotics Xi’an Jiaotong University Xi’an China Department of Information Engineering and Computer Science University of Trento Trento Italy School of Computing and Communications Lancaster University Lancaster U.K. Department of Computer Science The University of Western Australia Crawley WA Australia

Nine-degrees-of-freedom (9-DoF) object pose and size estimation is crucial for enabling augmented reality and robotic manipulation. Category-level methods have received extensive research attention due to their potential for generalization to intra-class unknown objects. However, these methods require manual collection and labeling of large-scale real-world training data. To address this problem, we introduce a diffusion-based paradigm for domain-generalized category-level 9-DoF object pose estimation. Our motivation is to leverage the latent generalization ability of the diffusion model to address the domain generalization challenge in object pose estimation. This entails training the model exclusively on rendered synthetic data to achieve generalization to real-world scenes. We propose an effective diffusion model to redefine 9-DoF object pose estimation from a generative perspective. Our model does not require any 3D shape priors during training or inference. By employing the Denoising Diffusion Implicit Model, we demonstrate that the reverse diffusion process can be executed in as few as 3 steps, achieving near real-time performance. Finally, we design a robotic grasping system comprising both hardware and software components. Through comprehensive experiments on two benchmark datasets and the real-world robotic system, we show that our method achieves state-of-the-art domain generalization performance.

关键词： Shape Solid modeling Three-dimensional displays Pose estimation Training Robots Grasping Diffusion models Real-time systems Point cloud compression

来源：评论

学校读者我要写书评

暂无评论

Edge Graph Intelligence: Reciprocally Empowering Edge Networks With Graph Intelligence

引用

IEEE Communications Surveys and Tutorials 2025年

作者： Zeng, Liekang Ye, Shengyuan Chen, Xu Zhang, Xiaoxi Ren, Ju Tang, Jian Yang, Yang Shen, Xuemin Sherman Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Guangzhou511453 China Ministry of Education School of Computer Science and Engineering Sun Yat-sen University The Key Laboratory of Machine Intelligence and Advanced Computing Guangzhou510275 China Tsinghua University Department of Computer Science and Technology Beijing100084 China Midea Group Shanghai201702 China Guangzhou511453 China Peng Cheng Laboratory Shenzhen518055 China Terminus Group Beijing100027 China University of Waterloo Department of Electrical and Computer Engineering WaterlooONN2L 3G1 Canada

Recent years have witnessed a thriving growth of computing facilities connected at the network edge, cultivating edge networks as a fundamental infrastructure for supporting miscellaneous intelligent services. Meanwhile, Artificial Intelligence (AI) frontiers have extrapolated to the graph domain and promoted Graph Intelligence (GI). Given the inherent relation between graphs and networks, the interdiscipline of graph learning and edge networks, i.e., Edge GI or EGI, has revealed a novel interplay between them - GI aids in optimizing edge networks, while edge networks facilitate GI model deployment. Driven by this delicate closed-loop, EGI is recognized as a promising solution to fully unleash the potential of edge computing power and is garnering growing attention. Nevertheless, research on EGI remains nascent, and there is a soaring demand within both the communications and AI communities for a dedicated venue to share recent advancements. To this end, this paper promotes the concept of EGI, explores its scope and core principles, and conducts a comprehensive survey concerning recent research efforts on this emerging field. Specifically, this paper introduces and discusses: 1) fundamentals of edge computing and graph learning, 2) emerging techniques centering on the closed loop between graph intelligence and edge networks, and 3) open challenges and research opportunities of future EGI. By bridging the gap across communication, networking, and graph learning areas, we believe that this survey can garner increased attention, foster meaningful discussions, and inspire further research ideas in EGI. © 1998-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

MIMO Beamforming and Signal Modulation Design for Federated Learning Optimization

MIMO Beamforming and Signal Modulation Design for Federated ...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Nuocheng Yang Sihua Wang Mingzhe Chen Cong Shen Changchuan Yin Christopher G. Brinton Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA Charles L. Brown Department of Electrical and Computer Engineering University of Virginia Charlottesville VA USA School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

In this paper, we consider the optimization of federated learning (FL) over a realistic wireless multiple-input multiple-output (MIMO) communication system with digital modulation and over-the-air computation (AirComp). In such a system, MIMO devices transmit their locally trained FL models to a parameter server (PS) using beamforming to maximize the number of devices scheduled for transmission. AirComp enables efficient wireless model aggregation by the PS in bandwidth-limited settings. However, wireless channel fading can produce distortions in AirComp-based FL. To tackle this challenge, we develop a novel aggregation scheme that combines digital modulation with AirComp to mitigate wireless fading while ensuring communication efficiency. We formulate this as a joint transmit-receive beamforming design optimization problem which dynamically adjusts the beamforming matrices to minimize the FL training loss with transmission errors. To solve this problem based on limited information at the PS, we employ an artificial neural network (ANN) to estimate the local FL models of all devices. Then, we derive a closed-form optimal design of the transmit and receive beamforming matrices based on predicted FL models. Numerical evaluations validate the advantages of the proposed methodology in terms of model training performance compared with baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Probabilistic Semantic Communication over Space-Air-Ground Integrated Networks

arXiv

引用

arXiv 2024年

作者： Zhao, Zhouxiang Yang, Zhaohui Chen, Mingzhe Zhang, Zhaoyang Xu, Wei Huang, Kaibin College of Information Science and Electronic Engineering Zhejiang University China Hangzhou310027 China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States National Mobile Communications Research Laboratory Southeast University Nanjing211189 China The Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong

Space-air-ground integrated networks (SAGINs) are emerging as a pivotal element in the evolution of future wireless networks. Despite their potential, the joint design of communication and computation within SAGINs remains a formidable challenge. In this paper, the problem of energy efficiency in SAGIN-enabled probabilistic semantic communication (PSC) system is investigated. In the considered model, a satellite needs to transmit data to multiple ground terminals (GTs) via an unmanned aerial vehicle (UAV) acting as a relay. During transmission, the satellite and the UAV can use PSC technique to compress the transmitting data, while the GTs can automatically recover the missing information. The PSC is underpinned by shared probability graphs that serve as a common knowledge base among the transceivers, allowing for resource-saving communication at the expense of increased computation resource. Through analysis, the computation overhead function in PSC is a piecewise function with respect to the semantic compression ratio. Therefore, it is important to make a balance between communication and computation to achieve optimal energy efficiency. The joint communication and computation problem is formulated as an optimization problem aiming to minimize the total communication and computation energy consumption of the network under latency, power, computation capacity, bandwidth, semantic compression ratio, and UAV location constraints. To solve this non-convex non-smooth problem, we propose an iterative algorithm where the closed-form solutions for computation capacity allocation and UAV altitude are obtained at each iteration. Numerical results show the effectiveness of the proposed algorithm. Copyright © 2024, The Authors. All rights reserved.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Public-Key Encryption with Ensuring Data Integrity in Cloud computing

A Probabilistic Public-Key Encryption with Ensuring Data Int...

引用

International Conference on Control, Artificial Intelligence, Robotics & Optimization (ICCAIRO)

作者： Mostefa Kara Konstantinos Karampidis Giorgos Papadourakis Abdelkader Laouid Muath AlShaikh LIAP Laboratory University of El Oued El Oued El Oued Algeria Department of Electrical and Computer Engineering Hellenic Mediterranean University Greece Computer Science Department College of Computing and Informatics Saudi Electronic University Riyadh KSA

Researchers are working hard to face various challenges in the fast-moving field of network security and data exchange. When it comes to encryption techniques, efforts vary to address multiple issues such as computational speed, data size requirements, application scope, etc. that are driven by the purposes of collecting and sharing sensitive data that must be stored and processed securely. This paper proposes an efficient asymmetric cryptosystem that bases on the multiplication of plaintext by a variable public key. The origin of this key is constant, but for each encryption, a random number must be added to it. Therefore, a new public key each time is generated; in other words, a simulation of a one-time pad system. For each message, the sender generates a new secret twin of the public key; The receiver can decrypt all messages encrypted by different twins with a single private key. The proposed probabilistic scheme is linear coding and hence is lightweight, easy to execute, and practical in many areas. We consider the cloud to be an untrusted part that tries to disclose data when decoded by systems, the proposed method provides the additive homomorphic property and ensures data integrity when a homomorphic operation is performed by the cloud; thus, we realize verifiable partial homomorphic encryption.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preserving and Byzantine Robust Collaborative Federated Learning Method Design

A Privacy Preserving and Byzantine Robust Collaborative Fede...

引用

IEEE International Conference on Communications (ICC)

作者： Nuocheng Yang Sihua Wang Mingzhe Chen Changchuan Yin Christopher G. Brinton Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Collaborative federated learning (CFL) enables device cooperation in training shared machine learning models without reliance on a parameter server. However, the absence of a parameter server also impacts vulnerabilities associated with adversarial attacks, including privacy inference and Byzantine attacks. In this context, this paper introduces a novel CFL framework that enables each device to individually determine the subset of devices to transmit FL parameters to over the wireless network, based on its neighboring devices' location, current loss, and connection information, to achieve privacy protection and robust aggregation. This is formulated as an optimization problem whose goal is to minimize CFL training loss while satisfying the privacy preservation, robust aggregation, and transmission delay requirements. To solve this problem, a proximal policy optimization (PPO)-based reinforcement learning (RL) algorithm integrated with a graph neural network (GNN) is proposed. Compared to traditional algorithms that use global information with high computational complexity, the proposed GNN-RL method can be deployed on devices based on neighboring information with lower computational overhead. Simulation results show that the proposed algorithm can protect data privacy and increase identification accuracy by 15% compared to an algorithm in which devices are partially clustered for model aggregation.

关键词： Training Privacy Federated learning Simulation Collaboration Clustering algorithms Propagation losses

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：