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

HSIGene: A Foundation Model for Hyperspectral Image Generation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Pang, Li Cao, Xiangyong Tang, Datao Xu, Shuang Bai, Xueru Zhou, Feng Meng, Deyu The School of Computer Science and Technology The Ministry of Education Key Lab for Intelligent Networks and Network Security Xi’an Jiaotong University Shaanxi Xi’an710049 China The School of Mathematics and Statistics Northwestern Polytechnical University Shaanxi Xi’an710021 China The National Laboratory of Radar Signal Processing Xidian University Xi’an710071 China The Key Laboratory of Electronic Information Countermeasure and Simulation of the Education Ministry of China Xidian University Xi’an710071 China The School of Mathematics and Statistics The Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Shaanxi Xi’an710049 China Guangdong Guangzhou510555 China

Hyperspectral image (HSI) plays a vital role in various fields such as agriculture and environmental monitoring. However, due to the expensive acquisition cost, the number of hyperspectral images is limited, degenerating the performance of downstream tasks. Although some recent studies have attempted to employ diffusion models to synthesize HSIs, they still struggle with the scarcity of HSIs, affecting the reliability and diversity of the generated images. Some studies propose to incorporate multi-modal data to enhance spatial diversity, but spectral fidelity cannot be ensured. In addition, existing HSI synthesis models are typically uncontrollable or only support single-condition control, limiting their ability to generate accurate and reliable HSIs. To alleviate these issues, we propose HSIGene, a novel HSI generation foundation model which is based on latent diffusion and supports multi-condition control, allowing for more precise and reliable HSI generation. To enhance the spatial diversity of the training data while preserving spectral fidelity, we propose a new data augmentation method based on spatial super-resolution, in which HSIs are upscaled first, and thus abundant training patches could be obtained by cropping the high-resolution HSIs. In addition, to improve the perceptual quality of the augmented data, we introduce a novel two-stage HSI super-resolution framework, which first applies RGB bands super-resolution and then utilizes our proposed Rectangular Guided Attention network (RGAN) for guided HSI super-resolution. Experiments demonstrate that the proposed model is capable of generating a vast quantity of realistic HSIs for downstream tasks such as denoising and super-resolution. The code and models are available at https://***/LiPang/HSIGene. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

Adaptive Interacting Multiple Model for Underwater Maneuvering Target Tracking with One-Step Randomly Delayed Measurements

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Li, Xiaohua Lu, Bo Li, Yuxing Lu, Xiaofeng Jin, Haiyan School of Computer Science and Engineering Xi'an University of Technology Xi’an710048 China Shaanxi Key Laboratory for Network Computing and Security Technology Xi’an710048 China School of Automation and Information Engineering Xi'an University of Technology Xi’an710048 China

The existing interacting multiple model (IMM) suffers from two problems when tracking an underwater maneuvering target: 1) the conventional nonlinear filters in IMM cannot work on the condition of delayed measurement, 2) the inefficiency of model switching in IMM may degrade the tracking performance. In order to handle the delayed measurement, an augmented state vector including target state and measurement noise is designed. Thus, under two Gaussian assumptions, the estimation of the target state can be divided into two steps: measurement noise filter and target state filter. Then, the new extended Klaman filter (EKF) and unscented Kalman filter (UKF) with delayed measurement are implemented as two variations of the proposed filter. In addition, to solve the problem of low switching efficiency between IMM models, a transfer probability corrected function is designed to adaptively update the transfer probability matrix (TPM) in IMM. The improved TPM can make full use of the current and past model information. The simulation results show that the proposed algorithm outperforms the existing IMM-EKF and IMM-UKF. © 2023, The Authors. All rights reserved.

关键词： Stochastic systems

Feature Selection Method Based on the Intra-Class Redundant Information Ratio

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Zhou, Hongfang Zhu, Rourou Wang, Xiqian An, Lei Li, Aimin School of Computer Science and Engineering Xi'an University of Technology Xi’an710048 China Shaanxi Key Laboratory of Network Computing and Security Technology Xi’an710048 China

Feature selection is a key step of the classification problem. In this paper, we propose the concept of intra-class redundant information ratio, and use it to measure the importance of redundant items. Based on this, we give a new method of ICRFS. In the experiments, we made the contrast test on 10 data sets. The classification results show that ICRFS has better classification performance than other methods for two classifiers of KNN and SVM. © 2022, The Authors. All rights reserved.

关键词： Feature extraction

Robust Visual Question Answering: Datasets, Methods, and Future Challenges

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Ma, Jie Wang, Pinghui Kong, Dechen Wang, Zewei Liu, Jun Pei, Hongbin Zhao, Junzhou Di, Jia The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Automation Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The Shannxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China

Visual question answering requires a system to provide an accurate natural language answer given an image and a natural language question. However, it is widely recognized that previous generic VQA methods often tend to memorize biases present in the training data rather than learning proper behaviors, such as grounding images before predicting answers. Therefore, these methods usually achieve high in-distribution but poor out-of-distribution performance. In recent years, various datasets and debiasing methods have been proposed to evaluate and enhance the VQA robustness, respectively. This paper provides the first comprehensive survey focused on this emerging fashion. Specifically, we first provide an overview of the development process of datasets from in-distribution and out-of-distribution perspectives. Then, we examine the evaluation metrics employed by these datasets. Thirdly, we propose a typology that presents the development process, similarities and differences, robustness comparison, and technical features of existing debiasing methods. Furthermore, we analyze and discuss the robustness of representative vision-and-language pre-training models on VQA. Finally, through a thorough review of the available literature and experimental analysis, we discuss the key areas for future research from various viewpoints. Copyright © 2023, The Authors. All rights reserved.

关键词： Visual languages

Few-shot Open Relation Extraction with Gaussian Prototype and Adaptive Margin

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Guo, Tianlin Zhang, Lingling Wang, Jiaxin Lei, Yunkuo Li, Yifei Wang, Haofen Liu, Jun School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi’an710049 China School of Computer Science and Technology Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi’an710049 China College of Design and Innovation Tongji University Shanghai200092 China

Few-shot relation extraction with none-of-the-above (FsRE with NOTA) aims at predicting labels in few-shot scenarios with unknown classes. FsRE with NOTA is more challenging than the conventional few-shot relation extraction task, since the boundaries of unknown classes are complex and difficult to learn. Meta-learning based methods, especially prototype-based methods, are the mainstream solutions to this task. They obtain the classification boundary by learning the sample distribution of each class. However, their performance is limited because few-shot overfitting and NOTA boundary confusion lead to misclassification between known and unknown classes. To this end, we propose a novel framework based on Gaussian prototype and adaptive margin named GPAM for FsRE with NOTA, which includes three modules, semi-factual representation, GMM-prototype metric learning and decision boundary learning. The first two modules obtain better representations to solve the few-shot problem through debiased information enhancement and Gaussian space distance measurement. The third module learns more accurate classification boundaries and prototypes through adaptive margin and negative sampling. In the training procedure of GPAM, we use contrastive learning loss to comprehensively consider the effects of range and margin on the classification of known and unknown classes to ensure the model's stability and robustness. Sufficient experiments and ablations on the FewRel dataset show that GPAM surpasses previous prototype methods and achieves state-of-the-art performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

Polar R-CNN: End-to-End Lane Detection with Fewer Anchors

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Shengqi Liu, Junmin Cao, Xiangyong Song, Zengjie Sun, Kai School of Mathematics and Statistics Xi'an Jiaotong University Xi'An710049 China School of Computer Science and Technology Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'An710049 China

Lane detection is a critical and challenging task in autonomous driving, particularly in real-world scenarios where traffic lanes can be slender, lengthy, and often obscured by other vehicles, complicating detection efforts. Existing anchor-based methods typically rely on prior lane anchors to extract features and subsequently refine the location and shape of lanes. While these methods achieve high performance, manually setting prior anchors is cumbersome, and ensuring sufficient coverage across diverse datasets often requires a large amount of dense anchors. Furthermore, the use of Non-Maximum Suppression (NMS) to eliminate redundant predictions complicates real-world deployment and may underperform in complex scenarios. In this paper, we propose Polar R-CNN, an end-to-end anchor-based method for lane detection. By incorporating both local and global polar coordinate systems, Polar R-CNN facilitates flexible anchor proposals and significantly reduces the number of anchors required without compromising performance. Additionally, we introduce a triplet head with heuristic structure that supports NMS-free paradigm, enhancing deployment efficiency and performance in scenarios with dense lanes. Our method achieves competitive results on five popular lane detection benchmarks-Tusimple, CULane, LLAMAS, CurveLanes, and DL-Rail-while maintaining a lightweight design and straightforward structure. Our source code is available at https://***/ShqWW/PolarRCNN. © 2024, CC BY.

关键词： Graph neural networks

Task Offloading and Primary Node Selection in Blockchain, Digital Twin, and MEC Enabled Internet of Vehicles 100

学校读者我要写书评

暂无评论

Task Offloading and Primary Node Selection in Blockchain, Di...

100th IEEE Vehicular technology Conference, VTC 2024-Fall

作者： Du, Jianbo Fang, Huifang Li, Shulei Du, Pengfei Kong, Ziwen Kang, Jiawen Niyato, Dusit Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Information Communication Network and Security School of Communications and Information Engineering Xi'an China Xidian University School of Communications Engineering Xi'an710071 China Tianyuan Ruixin Communication Technology Co. LTD. Xi'an710071 China Xihua University Engineering Research Center of Intelligent Airground Integrated Vehicle and Traffic Control Ministry of Education Chengdu610039 China Guangdong University of Technology School of Automation China Nanyang Technological University School of Computer Science and Engineering Singapore

ISBN: (纸本)9798331517786

In this paper, we investigate the safe task offloading and primary node selection in blockchain, digital twin (DT) and Multi-access Edge Computing (MEC) enabled Internet of Vehicles (IoV). Edge servers centers provide computing power for task processing for Mobile Vehicles (MVs), while blockchain can provide security guarantees for MVs during task offloading. Based on the above system, we propose a joint optimization scheme for vehicle task offloading decision and the Practical Byzantine Fault Tolerance (PBFT) consensus process. Due to the large number of optimization variables and constraints, the problem becomes more complex. Traditional convex optimization and dynamic programming methods are difficult to effectively solve this problem. To address this issue, we propose a deep reinforcement learning based algorithm that utilizes Proximal Policy Optimization (PPO). The experimental results show that the algorithm proposed in this paper outperforms the benchmark algorithm in terms of convergence and other aspects. © 2024 IEEE.

关键词： Dynamic programming

Local Differential Privacy is Not Enough: A Sample Reconstruction Attack against Federated Learning with Local Differential Privacy

学校读者我要写书评

暂无评论

arXiv 2025年

作者： You, Zhichao Dong, Xuewen Li, Shujun Liu, Ximeng Ma, Siqi Shen, Yulong School of Computer Science & Technology Xidian University China Shaanxi Key Laboratory of Network and System Security Xi’an China University of Kent Canterbury United Kingdom College of Computer and Data Science Fuzhou University Fuzhou China School of System and Computing University of New South Wales CanberraACT2612 Australia

Reconstruction attacks against federated learning (FL) aim to reconstruct users’ samples through users’ uploaded gradients. Local differential privacy (LDP) is regarded as an effective defense against various attacks, including sample reconstruction in FL, where gradients are clipped and perturbed. Existing attacks are ineffective in FL with LDP since clipped and perturbed gradients obliterate most sample information for reconstruction. Besides, existing attacks embed additional sample information into gradients to improve the attack effect and cause gradient expansion, leading to a more severe gradient clipping in FL with LDP. In this paper, we propose a sample reconstruction attack against LDP-based FL with any target models to reconstruct victims’ sensitive samples to illustrate that FL with LDP is not flawless. Considering gradient expansion in reconstruction attacks and noise in LDP, the core of the proposed attack is gradient compression and reconstructed sample denoising. For gradient compression, an inference structure based on sample characteristics is presented to reduce redundant gradients against LDP. For reconstructed sample denoising, we artificially introduce zero gradients to observe noise distribution and scale confidence interval to filter the noise. Theoretical proof guarantees the effectiveness of the proposed attack. Evaluations show that the proposed attack is the only attack that reconstructs victims’ training samples in LDP-based FL and has little impact on the target model’s accuracy. We conclude that LDP-based FL needs further improvements to defend against sample reconstruction attacks effectively. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

Each Fake News is Fake in its Own Way: An Attribution Multi-Granularity Benchmark for Multimodal Fake News Detection

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Guo, Hao Ma, Zihan Zeng, Zhi Luo, Minnan Zeng, Weixin Tang, Jiuyang Zhao, Xiang Laboratory for Big Data and Decision Nation University of Defence Technology China School of Computer Science and Technology Xi’an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China

Social platforms, while facilitating access to information, have also become saturated with a plethora of fake news, resulting in negative consequences. Automatic multimodal fake news detection is a worthwhile pursuit. Existing multimodal fake news datasets only provide binary labels of real or fake. However, real news is alike, while each fake news is fake in its own way. These datasets fail to reflect the mixed nature of various types of multimodal fake news. To bridge the gap, we construct an attributing multi-granularity multimodal fake news detection dataset AMG, revealing the inherent fake pattern. Furthermore, we propose a multi-granularity clue alignment model MGCA to achieve multimodal fake news detection and attribution. Experimental results demonstrate that AMG is a challenging dataset, and its attribution setting opens up new avenues for future research. © 2024, CC BY-NC-ND.

关键词： Fake detection