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

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1203-1216页

作者： Li, Changping Wang, Bingshu Zheng, Jiangbin Zhang, Yongjun Chen, C.L. Philip Northwestern Polytechnical University School of Software Xi’an710129 China Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security Shenzhen518060 China Guizhou University State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang550025 China South China University of Technology School of Computer Science and Engineering Guangzhou510641 China

Frequent road incidents cause significant physical harm and economic losses globally. The key to ensuring road safety lies in accurately perceiving surrounding road incidents. However, the highly dynamic nature of traffic introduces significant challenges, particularly in detecting sudden and temporary incidents. In this article, we propose a novel detection framework, multihead attention ResNet with dynamic bottleneck (DB_RESNET_MHA), to identify physical unsigned road incidents. Our approach introduces three key innovations. First, we develop a tailored data augmentation strategy to create images that closely mimic the complex variations found in real-world road environments. Second, we enhance model expressiveness by employing attention mechanisms to nonlinearly integrate convolutional kernels within the residual network. Furthermore, we refine the prediction head by applying spatially distinct attention weights, enabling the model to capture intricate correlations between different features more effectively. To demonstrate the effectiveness of our method, we create a dataset for unsigned road incidents (UnsignRI), comprising a total of 16 323 images that capture 12 distinct types of incidents. It stands out as the most comprehensive dataset in the field, encompassing a wide range of geographical features and incident categories. Experimental results show that DB_RESNET_MHA achieves an average accuracy of 96.2% and a f1-score of 0.955 across various categories of unsigned incidents, surpassing other models. © 2020 IEEE.

关键词： Highway accidents

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Compression, Transmission and Computation for Cooperative Perception Aided Intelligent Vehicular Networks

引用

IEEE Transactions on Vehicular technology 2025年第5期74卷 8201-8214页

作者： Lu, Binbin Huang, Xumin Wu, Yuan Qian, Liping Zhou, Sheng Niyato, Dusit University of Macau State Key Laboratory of Internet of Things for Smart City The Department of Computer and Information Science Macau China Guangdong University of Technology School of Automation Guangzhou510006 China University of Macau State Key Lab of Internet of Things for Smart City Macau China University of Macau State Key Laboratory of Internet of Things for Smart City The Department of Computer Information Science Macau China Zhuhai UM Science and Technology AQ2 Research Institute Zhuhai519301 China Zhejiang University of Technology Institute of Cyberspace Security Hangzhou310023 China Tsinghua University Beijing National Research Center for Information Science and Technology Department of Electronic Engineering Beijing100084 China Nanyang Technological University School of Computer Science and Engineering Singapore

Cooperative perception is a promising paradigm to tackle the perception limitations of a single intelligent vehicle (IV) to enhance the driving safety and efficiency in intelligent vehicular networks. However, the real-time transmission and computation-intensive fusion of raw sensing data raise new challenges for satisfying the stringent delay requirement of delay-sensitive applications. In this paper, we formulate a joint optimization problem of the cooperative IV selection, compression ratio selection, transmit power control, task offloading decision and computation allocation to minimize the end-to-end delay consisting of compression, transmission and computation. In particular, to meet the perception probability requirement, the quality and quantity-aware matching algorithm is proposed to optimize the cooperative IV selection. To guarantee the queue stability of offloading tasks, we develop the Lyapunov optimization algorithm to determine the upper bound of the offloading tasks and the corresponding optimal computation allocation. The Lyapunov aided deep reinforcement learning algorithm is further proposed to dynamically adjust the task offloading decision and compression ratio selection to minimize the end-to-end delay with the transmit power control being optimized by the successive convex approximation algorithm. Simulation results demonstrate that, compared to several benchmark algorithms, our proposed algorithm achieves the lowest end-to-end delay while guaranteeing the requirements on perception probability and queue stability effectively. © 1967-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

EPRFL:An Efficient Privacy-Preserving and Robust Federated Learning Scheme for Fog Computing

引用

China Communications 2025年第4期22卷 202-222页

作者： Ke Zhijie Xie Yong Syed Hamad Shirazi Li Haifeng School of Computer Technology and Application Qinghai UniversityXining 810016China School of Computer and Information Science Qinghai Institute of TechnologyXining 810016China Guangdong Key Laboratory of Blockchain Security Guangzhou UniversityGuangzhou 510006China Department of Information Technology Hazara UniversityBaffa 21110Pakistan Qinghai Provincial Key Laboratory of Big Data in Finance and Artificial Intelligence Application Technology Xining 810016China

Federated learning(FL)is a distributed machine learning paradigm that excels at preserving data privacy when using data from multiple *** combined with Fog Computing,FL offers enhanced capabilities for machine learning applications in the Internet of Things(IoT).However,implementing FL across large-scale distributed fog networks presents significant challenges in maintaining privacy,preventing collusion attacks,and ensuring robust data *** address these challenges,we propose an Efficient Privacy-preserving and Robust Federated Learning(EPRFL)scheme for fog computing ***,we first propose an efficient secure aggregation strategy based on the improved threshold homomorphic encryption algorithm,which is not only resistant to model inference and collusion attacks,but also robust to fog node ***,we design a dynamic gradient filtering method based on cosine similarity to further reduce the communication *** minimize training delays,we develop a dynamic task scheduling strategy based on comprehensive *** analysis demonstrates that EPRFL offers robust security and low *** experimental results indicate that EPRFL outperforms similar strategies in terms of privacy preserving,model performance,and resource efficiency.

关键词： federated learning fog computing internet of things privacy-preserving robustness

来源：评论

学校读者我要写书评

暂无评论

A comprehensive survey on shadow removal from document images: datasets, methods, and opportunities

引用

Vicinagearth 2025年第1期2卷 1-18页

作者： Wang, Bingshu Li, Changping Zou, Wenbin Zhang, Yongjun Chen, Xuhang Chen, C.L. Philip School of Software Northwestern Polytechnical University Xi’an China Guangdong Provincial Key Laboratory of Intelligent Information Processing & Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing College of Electronics and Information Engineering Shenzhen University Shenzhen China Yongjun Zhang is with the State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China School of Computer Science and Engineering Huizhou University Huizhou China School of Computer Science and Engineering South China University of Technology and Pazhou Lab Guangzhou China

With the rapid development of document digitization, people have become accustomed to capturing and processing documents using electronic devices such as smartphones. However, the captured document images often suffer from issues like shadows and noise due to environmental factors, which can affect their readability. To improve the quality of captured document images, researchers have proposed a series of models or frameworks and applied them in distinct scenarios such as image enhancement, and document information extraction. In this paper, we primarily focus on shadow removal methods and open-source datasets. We concentrate on recent advancements in this area, first organizing and analyzing nine availab.e datasets. Then, the methods are categorized into conventional methods and neural network-based methods. Conventional methods use manually designed features and include shadow map-based approaches and illumination-based approaches. Neural network-based methods automatically generate features from data and are divided into single-stage approaches and multi-stage approaches. We detail representative algorithms and briefly describe some typical techniques. Finally, we analyze and discuss experimental results, identifying the limitations of datasets and methods. Future research directions are discussed, and nine suggestions for shadow removal from document images are proposed. To our knowledge, this is the first survey of shadow removal methods and related datasets from document images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PGD-Imp: Rethinking and Unleashing Potential of Classic PGD with Dual Strategies for Imperceptible Adversarial Attacks

PGD-Imp: Rethinking and Unleashing Potential of Classic PGD ...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Jin Li Zitong Yu Ziqiang He Z. Jane Wang Xiangui Kang Guangdong Key Lab of Information Security School of Computer Science and Engineering Sun Yat-Sen University School of Computing and Information Technology Great Bay University Electrical and Computer Engineering Dept University of British Columbia

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Imperceptible adversarial attacks have recently attracted increasing research interests. Existing methods typically incorporate external modules or loss terms other than a simple l p -norm into the attack process to achieve imperceptibility, while we argue that such additional designs may not be necessary. In this paper, we rethink the essence of imperceptible attacks and propose two simple yet effective strategies to unleash the potential of PGD, the common and classical attack, for imperceptibility from an optimization perspective. Specifically, the Dynamic Step Size is introduced to find the optimal solution with minimal attack cost towards the decision boundary of the attacked model, and the Adaptive Early Stop strategy is adopted to reduce the redundant strength of adversarial perturbations to the minimum level. The proposed PGD-Imperceptible (PGD-Imp) attack achieves state-of-the-art results in imperceptible adversarial attacks for both untargeted and targeted scenarios. When performing untargeted attacks against ResNet-50, PGD-Imp attains 100% (+0.3%) ASR, 0.89 (-1.76) l 2 distance, and 52.93 (+9.2) PSNR with 57s (-371s) running time, significantly outperforming existing methods.

关键词： Adaptation models Costs Perturbation methods Machine learning Signal processing Acoustics Speech processing Optimization

来源：评论

学校读者我要写书评

暂无评论

Homophily Induced Contrastive Attributed Graph Clustering

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Chen, Man-Sheng Lai, Pei-Yuan Liao, De-Zhang Wang, Chang-Dong Lai, Jian-Huang Sun Yat-sen University School of Computer Science and Engineering Guangzhou China Guangxi Zhuang Autonomous Region Information Center Guangxi Key Laboratory of Digital Infrastructure Nanning China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China South China Technology Commercialization Center Guangzhou China Guangdong Key Laboratory of Information Security Technology Guangzhou China

Attributed graph clustering, aiming to discover the underlying graph structure and partition the graph nodes into several disjoint categories, is a basic task in graph data analysis. Although recent efforts over graph contrastive clustering have achieved decent performances, most of them get accustomed to construct the positive neighbor set by the generated pseudo clustering information, directly ignoring the ready-made neighbor nodes and the underlying semantics of edges in a graph. How to well deal with the graph neighbor-specific information to facilitate the performance of graph contrastive clustering is still a challenging problem. Therefore, in this work, we propose a novel Homophily Induced Contrastive Attributed Graph Clustering (HomoCAGC) method, where the power of homophily is exploited in facilitating the performance of contrastive attributed graph clustering, while the pseudo homophily in a graph is also explored and distinguished. Especially, the node feature as reliable information guidance is used to compute the underlying feature-oriented pair-wise node similarity, based on which the positive node pairs in contrastive regularizer are adjusted for better node representation characterization. According to the refined node representations, a triplet self-supervised clustering objective is well-designed to ensure the output embedding is cluster-oriented, and suitable for the downstream clustering task. Extensive experiments on seven benchmarks are conducted to demonstrate the effectiveness of HomoCAGC. © 1991-2012 IEEE.

关键词： Attributed graph clustering contrastive learning graph homophily self-supervised clustering

来源：评论

学校读者我要写书评

暂无评论

FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Li, Yuqing Yan, Nan Chen, Jing Wang, Xiong Hong, Jianan He, Kun Wang, Wei Li, Bo Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University RiZhao Information Technology Institute Rizhao276800 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China Shanghai Jiao Tong University School of Cyber Science and Engineering Shanghai200240 China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

Cross-silo federated learning (FL) enables multiple institutions (clients) to collab.ratively build a global model without sharing private data. To prevent privacy leakage during aggregation, homomorphic encryption (HE) is widely used to encrypt model updates, yet incurs high computation and communication overheads. To reduce these overheads, packed HE (PHE) has been proposed to encrypt multiple plaintexts into a single ciphertext. However, the original design of PHE assumes all clients share a single private key, making the system vulnerable to security threats of ciphertexts being intercepted and decrypted by honest-but-curious clients. Also, it does not consider the heterogeneity among different clients, resulting in undermined training efficiency with slow convergence and stragglers. To address these challenges, we propose FedPHE, a secure and efficient FL framework with PHE by jointly exploiting contribution-aware secure aggregation and straggler-resistant client selection. Using CKKS with sparsification and blinding, FedPHE achieves efficient secure aggregation that allows clients to only provide obscured encrypted updates while the server can perform aggregation by accounting for contributions of local updates. To mitigate the straggler effect, we devise a perturbed sketch-based selection to cherry-pick representative clients with heterogeneous models and computing capabilities in a communication-efficient and privacy-preserving manner. We show, through rigorous security analysis and extensive experiments, that FedPHE can efficiently safeguard clients' privacy, achieve 2.45-6.56× training speedup, cut the communication overhead by 1.32-24.85×, and reduce straggler effects by 1.89-2.78×. © 2004-2012 IEEE.

关键词： Privacy by design

来源：评论

学校读者我要写书评

暂无评论

Semantic and Emotional Dual Channel for Emotion Recognition in Conversation

引用

IEEE Transactions on Affective Computing 2025年

作者： Yang, Zhenyu Zhang, Zhibo Cheng, Yuhu Zhang, Tong Wang, Xuesong Jinan250353 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China China University of Mining and Technology Engineering Research Center of Intelligent Control for Underground Space Ministry of Education Xuzhou Key Laboratory of Artificial Intelligence and Big Data School of Information and Control Engineering Xuzhou221116 China South China University of Technology Guangdong Provincial Key Laboratory of Computational Intelligence and Cyberspace Information School of Computer Science and Engineering Guangzhou510006 China Pazhou Lab Guangzhou510335 China Engineering Research Center Ministry of Education on Health Intelligent Perception and Paralleled Digital-Human Guangzhou China

Emotion recognition in conversation (ERC) aims at accurately identifying emotional states expressed in conversational content. Existing ERC methods, although relying on semantic understanding, often encounter challenges when confronted with incomplete or misleading semantic information. In addition, when dealing with the interaction between emotional and semantic information, existing methods are often difficult to effectively distinguish the complex relationship between the two, which affects the accuracy of emotion recognition. To address the problems of semantic misdirection and emotional cross-talk encountered by traditional models when confronted with complex conversational data, we propose a semantic and emotional dual channel (SEDC) strategy for emotion recognition in conversations to process emotional and semantic information independently. Under this strategy, emotion information provides an auxiliary recognition function when the semantics are unclear or lacking, enhancing the accuracy of the model. Our model consists of two modules: the emotion processing module accurately captures the emotional features of each utterance through contrastive learning, and then constructs a dialogue emotion propagation map to simulate the emotional information conveyed in the dialogue;the semantic processing module combines an external knowledge base to enhance the semantic expression of the dialogue through knowledge enhancement strategies. This divide-and-conquer approach allows us to more deeply analyze the emotional and semantic dimensions of complex dialogues. Experimental results on the IEMOCAP, EmoryNLP, MELD, and DailyDialog datasets show that our approach significantly outperforms existing techniques and effectively improves the accuracy of dialogue emotion recognition. Our code is availab.e at https://***/r/SEDC-FCF1. © 2010-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Semantic Distillation Framework for Open-Vocabulary Object Detection

arXiv

引用

arXiv 2025年

作者： Fu, Shenghao Yan, Junkai Yang, Qize Wei, Xihan Xie, Xiaohua Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China Peng Cheng Laboratory China Tongyi Lab Alibaba Group China School of Computer Science and Engineering Sun Yat-sen University Guangdong Guangzhou China Guangdong Key Laboratory of Information Security Technology Sun Yat-sen University Guangdong Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Sun Yat-sen University Ministry of Education Guangdong Guangzhou China

Open-vocabulary object detection (OVD) aims to detect objects beyond the training annotations, where detectors are usually aligned to a pre-trained vision-language model, e.g., CLIP, to inherit its generalizable recognition ability so that detectors can recognize new or novel objects. However, previous works directly align the feature space with CLIP and fail to learn the semantic knowledge effectively. In this work, we propose a hierarchical semantic distillation framework named HD-OVD to construct a comprehensive distillation process, which exploits generalizable knowledge from the CLIP model in three aspects. In the first hierarchy of HD-OVD, the detector learns fine-grained instance-wise semantics from the CLIP image encoder by modeling relations among single objects in the visual space. Besides, we introduce text space novel-class-aware classification to help the detector assimilate the highly generalizable classwise semantics from the CLIP text encoder, representing the second hierarchy. Lastly, abundant image-wise semantics containing multi-object and their contexts are also distilled by an image-wise contrastive distillation. Benefiting from the elab.rated semantic distillation in triple hierarchies, our HD-OVD inherits generalizable recognition ability from CLIP in instance, class, and image levels. Thus, we boost the novel AP on the OV-COCO dataset to 46.4% with a ResNet50 backbone, which outperforms others by a clear margin. We also conduct extensive ablation studies to analyze how each component works. Code is availab.e at https://***/iSEE-lab.ratory/HD-OVD. Copyright © 2025, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Adaptive Perception for Unified Visual Multi-modal Object Tracking

arXiv

引用

arXiv 2025年

作者： Hu, Xiantao Zhong, Bineng Liang, Qihua Mo, Zhiyi Shi, Liangtao Tai, Ying Yang, Jian Guangxi Key Lab of Multi-Source Information Mining & Security Guangxi Normal University Guilin541004 China School of Data Science and Software Engineering Wuzhou University Wuzhou543002 China School of intelligence Science and Technonolgy Nanjing University Nanjing210008 China PCA-Lab School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China

Recently, many multi-modal trackers prioritize RGB as the dominant modality, treating other modalities as auxiliary, and fine-tuning separately various multi-modal tasks. This imbalance in modality dependence limits the ability of methods to dynamically utilize complementary information from each modality in complex scenarios, making it challenging to fully perceive the advantages of multi-modal. As a result, a unified parameter model often underperforms in various multi-modal tracking tasks. To address this issue, we propose APTrack, a novel unified tracker designed for multi-modal adaptive perception. Unlike previous methods, APTrack explores a unified representation through an equal modeling strategy. This strategy allows the model to dynamically adapt to various modalities and tasks without requiring additional fine-tuning between different tasks. Moreover, our tracker integrates an adaptive modality interaction (AMI) module that efficiently bridges cross-modality interactions by generating learnable tokens. Experiments conducted on five diverse multi-modal datasets (RGBT234, LasHeR, VisEvent, DepthTrack, and VOT-RGBD2022) demonstrate that APTrack not only surpasses existing state-of-the-art unified multi-modal trackers but also outperforms trackers designed for specific multi-modal tasks. © 2025, CC BY.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：