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

A Survey on Federated Learning Poisoning Attacks and Defenses

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Liang, Junchuan Wang, Rong Feng, Chaosheng Chang, Chin-Chen School of Computer Science Sichuan Normal University Chengdu China Visual Computing and Virtual Reality Key Laboratory of Sichuan Sichuan Normal University Chengdu China Department of Information Engineering and Computer Science Feng Chia University Taichung40724 Taiwan

As one kind of distributed machine learning technique, federated learning enables multiple clients to build a model across decentralized data collaboratively without explicitly aggregating the data. Due to its ability to break data silos, federated learning has received increasing attention in many fields, including finance, healthcare, and education. However, the invisibility of clients’ training data and the local training process result in some security issues. Recently, many works have been proposed to research the security attacks and defenses in federated learning, but there has been no special survey on poisoning attacks on federated learning and the corresponding defenses. In this paper, we investigate the most advanced schemes of federated learning poisoning attacks and defenses and point out the future directions in these areas. Copyright © 2023, The Authors. All rights reserved.

关键词： Learning systems

The NeRF Signature: Codebook-Aided Watermarking for Neural Radiance Fields

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Luo, Ziyuan Rocha, Anderson Shi, Boxin Guo, Qing Li, Haoliang Wan, Renjie Department of Computer Science Hong Kong Baptist University Hong Kong Institute of Computing University of Campinas Brazil State Key Laboratory of Multimedia Information Processing and National Engineering Research Center of Visual Technology School of Computer Science Peking University Beijing100871 China A*STAR Singapore Department of Electrical Engineering City University of Hong Kong Hong Kong

Neural Radiance Fields (NeRF) have been gaining attention as a significant form of 3D content representation. With the proliferation of NeRF-based creations, the need for copyright protection has emerged as a critical issue. Although some approaches have been proposed to embed digital watermarks into NeRF, they often neglect essential model-level considerations and incur substantial time overheads, resulting in reduced imperceptibility and robustness, along with user inconvenience. In this paper, we extend the previous criteria for image watermarking to the model level and propose NeRF Signature, a novel watermarking method for NeRF. We employ a Codebook-aided Signature Embedding (CSE) that does not alter the model structure, thereby maintaining imperceptibility and enhancing robustness at the model level. Furthermore, after optimization, any desired signatures can be embedded through the CSE, and no fine-tuning is required when NeRF owners want to use new binary signatures. Then, we introduce a joint pose-patch encryption watermarking strategy to hide signatures into patches rendered from a specific viewpoint for higher robustness. In addition, we explore a Complexity-Aware key Selection (CAKS) scheme to embed signatures in high visual complexity patches to enhance imperceptibility. The experimental results demonstrate that our method outperforms other baseline methods in terms of imperceptibility and robustness. The source code is available at: https://***/luo-ziyuan/NeRF_Signature. Copyright © 2025, The Authors. All rights reserved.

关键词： Image watermarking

Optimal Bilinear Equalizer for Cell-Free Massive MIMO Systems over Correlated Rician Channels

学校读者我要写书评

暂无评论

IEEE Transactions on Signal Processing 2025年

作者： Wang, Zhe Zhang, Jiayi Bjornson, Emil Niyato, Dusit Ai, Bo Beijing Jiaotong University State Key Laboratory of Advanced Rail Autonomous Operation Beijing100044 China Beijing Jiaotong University School of Electronics and Information Engineering Beijing100044 China KTH Royal Institute of Technology Department of Computer Science Stockholm114 28 Sweden Nanyang Technological University College of Computing & Data Science 639798 Singapore

In this paper, we explore the low-complexity optimal bilinear equalizer (OBE) combining scheme design for cell-free massive multiple-input multiple-output networks with spatially correlated Rician fading *** provide a spectral efficiency (SE) performance analysis framework for both the centralized and distributed processing schemes with bilinear equalizer (BE)-structure combining schemes applied. The BE-structured combining is a set of schemes that are constructed by the multiplications of channel statistics-based BE matrices and instantaneous channel estimates. Notably, we derive closed-form achievable SE expressions for centralized and distributed BE-structured combining schemes. We propose one centralized and two distributed OBE schemes: Centralized OBE (C-OBE), Distributed OBE based on Global channel statistics (DG-OBE), and Distributed OBE based on Local channel statistics (DL-OBE), which maximize their respective SE expressions. OBE matrices in these schemes are tailored based on varying levels of channel statistics. Notably, we obtain new and insightful closed-form results for the C-OBE, DG-OBE, and DL-OBE combining schemes. Numerical results demonstrate that the proposed OBE schemes can achieve excellent SE, even in scenarios with severe pilot contamination. © 2025 IEEE. All rights reserved.

关键词： Fading channels

DRAG: Dynamic Region-Aware GCN for Privacy-Leaking Image Detection

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yang, Guang Cao, Juan Sheng, Qiang Qi, Peng Li, Xirong Li, Jintao Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

The daily practice of sharing images on social media raises a severe issue about privacy leakage. To address the issue, privacy-leaking image detection is studied recently, with the goal to automatically identify images that may leak privacy. Recent advance on this task benefits from focusing on crucial objects via pretrained object detectors and modeling their correlation. However, these methods have two limitations: 1) they neglect other important elements like scenes, textures, and objects beyond the capacity of pretrained object detectors;2) the correlation among objects is fixed, but a fixed correlation is not appropriate for all the images. To overcome the limitations, we propose the Dynamic Region-Aware Graph Convolutional Network (DRAG) that dynamically finds out crucial regions including objects and other important elements, and models their correlation adaptively for each input image. To find out crucial regions, we cluster spatially-correlated feature channels into several region-aware feature maps. Further, we dynamically model the correlation with the self-attention mechanism and explore the interaction among the regions with a graph convolutional network. The DRAG achieved an accuracy of 87% on the largest dataset for privacy-leaking image detection, which is 10 percentage points higher than the state of the art. The further case study demonstrates that it found out crucial regions containing not only objects but other important elements like textures. The code and more details are in https://***/guang-yanng/DRAG. © 2022, CC BY.

关键词： Object detection

QoS-based Beamforming and Compression Design for Cooperative Cellular Networks via Lagrangian Duality

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Fan, Xilai Liu, Ya-Feng Liu, Liang Chang, Tsung-Hui State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong School of Science and Engineering The Chinese University of Hong Kong Shenzhen Research Institute of Big Data Shenzhen Shenzhen China

This paper considers the quality-of-service (QoS)based joint beamforming and compression design problem in the downlink cooperative cellular network, where multiple relay-like base stations (BSs), connected to the central processor via rate-limited fronthaul links, cooperatively transmit messages to the users. The problem of interest is formulated as the minimization of the total transmit power of the BSs, subject to all users’ signal-to-interference-plus-noise ratio (SINR) constraints and all BSs’ fronthaul rate constraints. In this paper, we first show that there is no duality gap between the considered joint optimization problem and its Lagrangian dual by showing the tightness of its semidefinite relaxation (SDR). Then, we propose an efficient algorithm based on the above duality result for solving the considered problem. The proposed algorithm judiciously exploits the special structure of an enhanced Karush-Kuhn-Tucker (KKT) conditions of the considered problem and finds the solution that satisfies the enhanced KKT conditions via two fixed point iterations. Two key features of the proposed algorithm are: (1) it is able to detect whether the considered problem is feasible or not and find its globally optimal solution when it is feasible;(2) it is highly efficient because both of the fixed point iterations in the proposed algorithm are linearly convergent and evaluating the functions in the fixed point iterations are computationally cheap. Numerical results show the global optimality and efficiency of the proposed algorithm. Copyright © 2023, The Authors. All rights reserved.

关键词： Quality of service

A Novel Mode Selection-Based Fast Intra Prediction Algorithm for Spatial SHVC

学校读者我要写书评

暂无评论

A Novel Mode Selection-Based Fast Intra Prediction Algorithm...

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

作者： Dayong Wang Yu Sun Weisheng Li Lele Xie Xin Lu Frederic Dufaux Ce Zhu Chongqing Key Laboratory on Big Data for Bio Intelligence Department of Computer Science University of Central Arkansas Computing Chongqing Key Laboratory of Image Cognition School of Information and Communication Engineering Chongqing University of Posts and Telecommunications Faculty of Computing Engineering and Media (CEM) De Montfort University CNRS CentraleSupélec Laboratoire des Signaux et systèmes Université Paris-Saclay School of Information and Communication Engineering University of Electronic Science and Technology of China

Due to multi-layer encoding and Inter-layer prediction, Spatial Scalable High-Efficiency Video Coding (SSHVC) has extremely high coding complexity. It is very crucial to improve its coding speed so as to promote widespread and cost-effective SSHVC applications. In this paper, we have proposed a novel Mode Selection-Based Fast Intra Prediction algorithm for SSHVC. We reveal the RD costs of Inter-layer Reference (ILR) mode and Intra mode have a significant difference, and the RD costs of these two modes follow Gaussian distribution. Based on this observation, we propose to apply the classic Gaussian Mixture Model and Expectation Maximization in machine learning to determine whether ILR is the best mode so as to skip the Intra mode. Experimental results demonstrate that the proposed algorithm can significantly improve the coding speed with negligible coding efficiency loss.

关键词： Machine learning algorithms Costs Signal processing algorithms Machine learning Gaussian distribution Prediction algorithms Encoding

A Revocable Fast and Lightweight Parallel Encryption Scheme for IIoT

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Lu, Junze Hu, Chunqiang Chen, Jiajun Xia, Hui Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education China Chongqing University School of Big Data and Software Engineering Chongqing 400030 China Ocean University of China College of Computer Science and Technology China

As the Industrial Internet of Things (IIoT) expands, the number of stakeholders increases. Many entities require significant amounts of data from industrial devices. These data streams improve information sharing and optimize the industrial chain. However, IIoT’s enormous data volumes pose challenges to traditional encryption methods, which are unable to meet efficiency and energy consumption requirements. Thus, a new, efficient encryption algorithm is essential for managing data flows among IIoT subscribers. In this paper, we propose a fast, low-energy, high-security encryption scheme to manage multi-entity data streams. First, we introduce a novel encryption scheme based on the Subset Sum Problem (SSP), which improves energy efficiency and speed. Second, to meet subscription requirements, we employ attribute-based encryption (ABE) for key forwarding. Finally, we handle subscription revocations with device key updates. The device owner utilizes their secret value to generate an identity proof with a key update request. © 2014 IEEE.

关键词： attribute based encryption data sharing Industrial Internet of Things Subset sum problem

Autonomous On-ramp Merge Strategy Using Deep Reinforcement Learning in Uncertain Highway Environment

学校读者我要写书评

暂无评论

Autonomous On-ramp Merge Strategy Using Deep Reinforcement L...

2022 IEEE International Conference on Unmanned Systems, ICUS 2022

作者： Wu, Sifan Tian, Daxin Zhou, Jianshan Duan, Xuting Sheng, Zhengguo Zhao, Dezong Beijing Key Laboratory For Cooperative Vehicle Infrastructure Systems&Safety Cooperative Control Beijing China Beijing Advanced Innovation Center For Big Data and Brain Computing Beijing China Department of Engineering and Design Richmond United Kingdom University of Sussex Richmond United Kingdom James Watt School of Engineering Glasgow United Kingdom University of Glasgow Glasgow United Kingdom

ISBN: (数字)9781665484565

ISBN: (纸本)9781665484565

On-ramp merge is a complex traffic scenario in autonomous driving. Because of the uncertainty of the driving environment, most rule-based models cannot solve such a problem. In this study, we design a Deep Reinforcement Learning (DRL) method to solve the issue of ramp merges in uncertain scenarios and modify the structure of the Twin Delayed Deep Deterministic policy gradient algorithm (TD3), using Long Short-Term Memory (LSTM) to select an action based on temporal information. The proposed method is applied in the on-ramp merge and verified in the Simulation of Urban Mobility (SUMO). Results show that the proposed method performs significantly better generalization in uncertain traffic scenarios. © 2022 IEEE.

关键词： Long short-term memory

Self-supervised fast reconstruction method for diffusion MRI based on multi-directional assistance

学校读者我要写书评

暂无评论

Self-supervised fast reconstruction method for diffusion MRI...

International Conference on Signal Processing Proceedings (ICSP)

作者： Yuxin Wu Jian Zhang Lihui Wang Ying Cao Linhai Wu Yunjia Wu Chen Ye Yuemin Zhu State Key Laboratory of Public Big Data College of Computer Science and Technology Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Guizhou University Guiyang China INSA Lyon CNRS Inserm CREATIS UMR 5220 U1206 Univ Lyon France

ISBN: (数字)9798350387384

ISBN: (纸本)9798350387391

Diffusion MRI (dMRI) is widely used for the detection and diagnosis of various pathologies due to its non-invasive nature. However, its signal acquisition process is relatively slow and susceptible to motions. In order to accelerate reconstruction process, many deep learning-based methods have been developed in recent years to achieve promising results, while most of them are supervised based methods and require fully sampled data which are difficult to obtain in practical applications to train the network. Self-supervised based methods were proposed to deal with this problem to a certain extent, however, they are devoted only to conventional MRI data, ignoring the correlation between the directions of dMRI data. To address this issue, we propose a self-supervised fast reconstruction method for dMRI based on multi-directional assistance. The method better utilizes the information between dMRI data directions by Partition-Replace operation, cleverly constructing data pairs and designing effective self-supervised strategy for bi-directional prediction, which can overcome the problem of data incompleteness and guide the model to reconstruct unsampled signals in spite of the difficulty of acquiring fully sampled data. Experimental results show that our method achieves better reconstruction in the absence of fully sampled data, even with an 8-fold acceleration factor.

关键词： Learning systems Pathology Correlation Magnetic resonance imaging Bidirectional control Reconstruction algorithms Signal processing Predictive models data models