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

Visible Light Positioning Based on a Single Luminaire: A Novel Visual Odometry Assisted Algorithm

学校读者我要写书评

暂无评论

Visible Light Positioning Based on a Single Luminaire: A Nov...

IEEE International Conference on Communications (ICC)

作者： Zhiyu Zhu Yang Yang Mingzhe Chen Caili Guo Yipeng Bai Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering 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 Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China

Visible light positioning (VLP) is a promising positioning technique, which, however, typically requires multiple luminaires to achieve accurate positioning. This paper proposes a novel visual odometry (VO) assisted visible light positioning algorithm (VO-VLP) in achieving positioning with only a single luminaire. In the considered model, a user equipped with a camera jointly uses geometric features in the captured images and coordinates information obtained via visible light communication (VLC) for positioning. The proposed VLP algorithm does not rely on any extra inertial measurement unit and relaxes the tilted angle limitation at the user. In particular, VO-VLP first uses the circle feature of a luminaire to obtain dual normal vectors of the luminaire. Then, the basic principle of VO is used to eliminate the wrong normal vector by exploiting the geometric features in two consecutive images captured when the user moves. Finally, the pose and location of the user are obtained by using an artificially marked point on the luminaire's contour. VO-VLP can achieve accurate positioning with only a single luminaire and a camera. Simulation results show that the proposed indoor positioning algorithm can achieve a 97th-percentile positioning accuracy of around 10 cm.

关键词：

Satisfaction-Aware Incentive Scheme for Federated Learning in Industrial Metaverse: DRL-Based Stackbelberg Game Approach

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Xiaohuan Qin, Shaowen Tang, Xin Kang, Jiawen Ye, Jin Zhao, Zhonghua Niyato, Dusit Guangxi University Key Laboratory of Intelligent Networking and Scenario System School of Information and Communication Guilin University of Electronic Technology Guilin541004 China Nanning530001 China School of Automation Guangdong University of Technology Guangzhou510006 China Guangxi Key Laboratory of Multimedia Communications and Network Technology Nanning530000 China School of Computer and Electronic Information Guangxi University Nanning530000 China College of Computing and Data Science Nanyang Technological University Singapore

Industrial Metaverse leverages the Industrial Internet of Things (IIoT) to integrate data from diverse devices, employing federated learning and meta-computing to train models in a distributed manner while ensuring data privacy. Achieving an immersive experience for industrial Metaverse necessitates maintaining a balance between model quality and training latency. Consequently, a primary challenge in federated learning tasks is optimizing overall system performance by balancing model quality and training latency. This paper designs a satisfaction function that accounts for data size, Age of information (AoI), and training latency. Additionally, the satisfaction function is incorporated into the utility functions to incentivize node participation in model training. We model the utility functions of servers and nodes as a two-stage Stackelberg game and employ a deep reinforcement learning approach to learn the Stackelberg equilibrium. This approach ensures balanced rewards and enhances the applicability of the incentive scheme for industrial Metaverse. Simulation results demonstrate that, under the same budget constraints, the proposed incentive scheme improves at least 23.7% utility compared to existing schemes without compromising model accuracy. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

A Drug Box Recognition System Based on Deep Learning and Cloud-Edge Collaboration for Pharmacy Automation

学校读者我要写书评

暂无评论

A Drug Box Recognition System Based on Deep Learning and Clo...

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Honglei Zhu Anming Dong Jiguo Yu Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Key Laboratory of Computing Power Network and Information Security Qilu University of Technology (Shandong Academy of Sciences) Jinan China School of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Big Data Institute Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

Drug box recognition is an integral part of the pharmacy automation system (PAS), which checks for discrepancies between the drugs provided by the system and the doctor’s prescription with the help of modern image recognition techniques. Although deep learning has facilitated the development of pharmacy automation systems, practical applications still face challenges. First, pharmacies update drugs frequently, and many pharmacies across the country are trained independently, which requires consuming massive computational resources. Secondly, the equipment performance of pharmacies is poor, and it’s hard to guarantee the real-time and accuracy of recognition. Therefore, we propose a cloud-side collaborative drug box recognition system. When new drugs are added, the new model is trained in the cloud and uniformly distributed to each edge through this architecture. In terms of real-time recognition, an improved lightweight YOLOv5 model is added to the edge part, and a text recognition module is deployed in the cloud to validate the recognition results at the edge. This cloud-edge collaboration architecture not only ensures the accuracy of recognition, but also reduces the burden on the compute edge, ensures the real-time *** results show that the proposed cloud-edge architecture reduces the recognition latency by 37.18% and achieves a precision of 97.47%. The improved YOLOv5 model reduces GFLOPs by 45% while achieving a 1.6% precision improvement.

关键词：

Multi-modal data based Semi-Supervised Learning for Vehicle Positioning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Huan, Ouwen Yang, Yang 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 Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China

In this paper, a multi-modal data based semisupervised learning (SSL) framework that jointly use channel state information (CSI) data and RGB images for vehicle positioning is designed. In particular, an outdoor positioning system where the vehicle locations are determined by a base station (BS) is considered. The BS equipped with several cameras can collect a large amount of unlabeled CSI data and a small number of labeled CSI data of vehicles, and the images taken by cameras. Although the collected images contain partial information of vehicles (i.e. azimuth angles of vehicles), the relationship between the unlabeled CSI data and its azimuth angle, and the distances between the BS and the vehicles captured by images are both unknown. Therefore, the images cannot be directly used as the labels of unlabeled CSI data to train a positioning model. To exploit unlabeled CSI data and images, a SSL framework that consists of a pretraining stage and a downstream training stage is proposed. In the pretraining stage, the azimuth angles obtained from the images are considered as the labels of unlabeled CSI data to pretrain the positioning model. In the downstream training stage, a small sized labeled dataset in which the accurate vehicle positions are considered as labels is used to retrain the model. Simulation results show that the proposed method can reduce the positioning error by up to 30% compared to a baseline where the model is not pretrained. Copyright © 2024, The Authors. All rights reserved.

关键词： Self-supervised learning

Distilled Transformers with Locally Enhanced Global Representations for Face Forgery Detection

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Yaning Li, Qiufu Yu, Zitong Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Guangdong Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Shenzhen518129 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Guangdong Shenzhen518060 China School of Computing and Information Technology Great Bay University Guangdong Dongguan523000 China

Face forgery detection (FFD) is devoted to detecting the authenticity of face images. Although current CNN-based works achieve outstanding performance in FFD, they are susceptible to capturing local forgery patterns generated by various manipulation methods. Though transformer-based detectors exhibit improvements in modeling global dependencies, they are not good at exploring local forgery artifacts. Hybrid transformer-based networks are designed to capture local and global manipulated traces, but they tend to suffer from the attention collapse issue as the transformer block goes deeper. Besides, soft labels are rarely available. In this paper, we propose a distilled transformer network (DTN) to capture both rich local and global forgery traces and learn general and common representations for different forgery faces. Specifically, we design a mixture of expert (MoE) module to mine various robust forgery embeddings. Moreover, a locally-enhanced vision transformer (LEVT) module is proposed to learn locally-enhanced global representations. We design a lightweight multi-attention scaling (MAS) module to avoid attention collapse, which can be plugged and played in any transformer-based models with only a slight increase in computational costs. In addition, we propose a deepfake self-distillation (DSD) scheme to provide the model with abundant soft label information. Extensive experiments show that the proposed method surpasses the state of the arts on five deepfake datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Face recognition

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-Sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright © 2024, The Authors. All rights reserved.

关键词： Object detection

Joint Sparsification and Quantization for Wireless Federated Learning under Communication Constraints

学校读者我要写书评

暂无评论

Joint Sparsification and Quantization for Wireless Federated...

IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Junshen Su Xijun Wang Xiang Chen Ray-Guang Cheng School of Electronics and Information Technology Sun Yat-Sen University Guangzhou China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China Department of Electronic and Computer Engineering National Taiwan University of Science and Technology Taipei Taiwan

Communication efficiency is one of the key bottlenecks in Federated Learning (FL). Compression techniques, such as sparsification and quantization, are used to reduce communication overhead. However, joint designs of these techniques under communication constraints are not well-explored. This paper investigates the joint uplink compression problem in communication-constrained FL systems. We propose a Block-TopK sparsification scheme to reduce the proportion of bits used for locating entries of a sparsified vector. Considering the communication constraints, an optimization formulation is proposed to minimize the compression error. By solving the optimization problem, our joint compression method provides a better trade-off between sparsity budget and bit width. Numerical results demonstrate that our approach achieves 99.96% of baseline accuracy with only 1.56% of the baseline communication overhead when training ResNet-18 on CIFAR-10.

关键词：

Exact Fit Attention in Node-Holistic Graph Convolutional Network for Improved EEG-Based Driver Fatigue Detection

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Xu, Meiyan Chen, Qingqing Chen, Duo Ding, Yi Wang, Jingyuan Gu, Peipei Pan, Yijie Huang, Deshuang Guo, Jiayang Zhang, Xun Department of Computer Science The Institute of Human Factors Engineering Minnan Normal University Zhangzhou363000 China School of Artificial Intelligence and Information Technology Nanjing University of Chinese Medicine Nanjing210023 China College of Computing and Data Science Nanyang Technological University Singapore School of Digital Media and Design Arts Beijing University of Posts and Telecommunications Beijing100088 China College of Software Engineering Zhengzhou University of Light Industry Zhengzhou450000 China Department of Computer Science and Technology Tsinghua University Beijing100084 China Eastern Institute for Advanced Study Eastern Institute of Technology Ningbo315200 China Ningbo Institute of Digital Twin Eastern Institute of Technology Ningbo315200 China National Institute for Data Science in Health and Medicine Xiamen University Xiamen361005 China

EEG-based fatigue monitoring can effectively reduce the incidence of related traffic accidents. In the past decade, with the advancement of deep learning, convolutional neural networks (CNN) have been increasingly used for EEG signal processing. However, due to the data’s non-Euclidean characteristics, existing CNNs may lose important spatial information from EEG, specifically channel correlation. Thus, we propose the node-holistic graph convolutional network (NHGNet), a model that uses graphic convolution to dynamically learn each channel’s features. With exact fit attention optimization, the network captures inter-channel correlations through a trainable adjacency matrix. The interpretability is enhanced by revealing critical areas of brain activity and their interrelations in various mental states. In validations on two public datasets, NHGNet outperforms the SOTAs. Specifically, in the intra-subject, NHGNet improved detection accuracy by at least 2.34% and 3.42%, and in the inter-subjects, it improved by at least 2.09% and 15.06%. Visualization research on the model revealed that the central parietal area plays an important role in detecting fatigue levels, whereas the frontal and temporal lobes are essential for maintaining vigilance. Copyright © 2025, The Authors. All rights reserved.

关键词： Electroencephalography

Optimal kernel choice for score function-based causal discovery 24

学校读者我要写书评

暂无评论

Optimal kernel choice for score function-based causal discov...

Proceedings of the 41st International Conference on Machine Learning

作者： Wenjie Wang Biwei Huang Feng Liu Xinge You Tongliang Liu Kun Zhang Mingming Gong School of Mathematics and Statistics The University of Melbourne Australia and Department of Machine Learning Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Halicioğlu Data Science Institute (HDSI) University of California San Diego School of Computing and Information Systems The University of Melbourne Australia Huazhong University of Science and Technology China School of Computer Science Faculty of Engineering The University of Sydney Australia Department of Machine Learning Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates and Department of Philosophy Carnegie Mellon University

Score-based methods have demonstrated their effectiveness in discovering causal relationships by scoring different causal structures based on their goodness of fit to the data. Recently, Huang et al. (2018) proposed a generalized score function that can handle general data distributions and causal relationships by modeling the relations in reproducing kernel Hilbert space (RKHS). The selection of an appropriate kernel within this score function is crucial for accurately characterizing causal relationships and ensuring precise causal discovery. However, the current method involves manual heuristic selection of kernel parameters, making the process tedious and less likely to ensure optimality. In this paper, we propose a kernel selection method within the generalized score function that automatically selects the optimal kernel that best fits the data. Specifically, we model the generative process of the variables involved in each step of the causal graph search procedure as a mixture of independent noise variables. Based on this model, we derive an automatic kernel selection method by maximizing the marginal likelihood of the variables involved in each search step. We conduct experiments on both synthetic data and real-world benchmarks, and the results demonstrate that our proposed method outperforms heuristic kernel selection methods.

关键词：