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

Multi-level Relation Learning for Cross-domain Few-shot Hyperspectral Image Classification

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Liu, Chun Yang, Longwei Li, Zheng Yang, Wei Han, Zhigang Guo, Jianzhong Yu, Junyong School of Computer and Information Engineering Henan University Henan Zhengzhou450046 China Henan Key Laboratory of Big Data Analysis and Processing Henan University Henan Zhengzhou450046 China Henan Engineering Laboratory of Spatial Information Processing Henan University Henan Zhengzhou450046 China Henan Industrial Technology Academy of Spatio-Temporal Big Data Henan University Henan Zhengzhou450046 China College of Geography and Environmental Science Henan University Henan Zhengzhou450046 China Henan DeFan High-tech Software Co. Ltd Henan Zhengzhou450046 China

Cross-domain few-shot hyperspectral image classification focuses on learning prior knowledge from a large number of labeled samples from source domains and then transferring the knowledge to the tasks which contain few labeled samples in target domains. Following the metric-based manner, many current methods first extract the features of the query and support samples, and then directly predict the classes of query samples according to their distance to the support samples or prototypes. The relations between samples have not been fully explored and utilized. Different from current works, this paper proposes to learn sample relations on different levels and take them into the model learning process, to improve the cross-domain few-shot hyperspectral image classification. Building on current method of"Deep Cross-Domain Few-Shot Learning for Hyperspectral Image Classification" which adopts a domain discriminator to deal with domain-level distribution difference, the proposed method applies contrastive learning to learn the class-level sample relations to obtain more discriminable sample features. In addition, it adopts a transformer based cross-attention learning module to learn the set-level sample relations and acquire the attention from query samples to support samples. Our experimental results have demonstrated the contribution of the multi-level relation learning mechanism for few-shot hyperspectral image classification when compared with the state of the art methods. All the codes are available at github https://***/HENULWY/STBDIP. © 2023, CC BY.

关键词： Image enhancement

VSRQ: Quantitative Assessment Method for Safety Risk of Vehicle Intelligent Connected System

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Tian Guan, Wenshan Miao, Hao Huang, Xiujie Liu, Zhiquan Wang, Chaonan Guan, Quanlong Fang, Liangda Duan, Zhifei Department of Cyberspace Security College of Information Science and Technology Jinan University Guangzhou511486 China Department of Computer Science College of Information Science and Technology Jinan University Guangzhou510632 China College of Information Science and Technology Jinan University Guangdong Institution of Smart Education Jinan University Guangzhou510632 China College of Cyber Security Jinan University Guangzhou510632 China Guangdong Gene Data Processing and Analysis Engineering Research Center China Pazhou Laboratory Guangzhou510330 China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin541004 China Guangzhou XPeng Motors Technology Co. Ltd No.8 Songgang Road Changxing Street Cencun Tianhe District Guangzhou China

The field of intelligent connected in modern vehicles continues to expand, and the functions of vehicles become more and more complex with the development of the times. This has also led to an increasing number of vehicle vulnerabilities and many safety issues. Therefore, it is particularly important to identify high-risk vehicle intelligent connected systems, because it can inform security personnel which systems are most vulnerable to attacks, allowing them to conduct more thorough inspections and tests. In this paper, we develop a new model for vehicle risk assessment by combining I-FAHP with FCA clustering: VSRQ model. We extract important indicators related to vehicle safety, use fuzzy cluster analys (FCA) combined with fuzzy analytic hierarchy process (FAHP) to mine the vulnerable components of the vehicle intelligent connected system, and conduct priority testing on vulnerable components to reduce risks and ensure vehicle safety. We evaluate the model on OpenPilot and experimentally demonstrate the effectiveness of the VSRQ model in identifying the safety of vehicle intelligent connected systems. The experiment fully complies with ISO 26262 and ISO/SAE 21434 standards, and our model has a higher accuracy rate than other models. These results provide a promising new research direction for predicting the security risks of vehicle intelligent connected systems and provide typical application tasks for VSRQ. The experimental results show that the accuracy rate is 94.36%, and the recall rate is 73.43%, which is at least 14.63% higher than all other known indicators. Copyright © 2023, The Authors. All rights reserved.

关键词： Vehicle safety

A new approach for approximately mining frequent itemsets 21

学校读者我要写书评

暂无评论

A new approach for approximately mining frequent itemsets

21st International Conference on data Analytics and Management in data Intensive Domains, DAMDID/RCDL 2019

作者： Valiullin, Timur Huang, Joshua Zhexue Yin, Jianfei Wu, Dingming Big Data Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China

Mining frequent itemsets in transaction databases is an important task in many applications. This task becomes challenging when dealing with a very large transaction database because traditional algorithms are not scalable due to the memory limit. In this paper, we propose a new approach for approximately mining of frequent itemsets in a transaction database. First, we partition the set of transactions in the database into disjoint subsets and make the distribution of frequent itemsets in each subset similar to that of the entire database. Then, we randomly select a set of subsets and independently mine the frequent itemsets in each of them. After that, each frequent itemset discovered from these subsets is voted and the one appearing in the majority subsets is determined as a frequent itemset, called a popular frequent itemset. All popular frequent itemsets are compared with the frequent itemsets discovered directly from the entire database using the same frequency threshold. The recalls and precisions of the frequent itemsets from selected subsets are analyzed against the entire database. The experiment results demonstrate that the use of less than 10 percent of the transaction data in the database can achieve more than 87 percent accuracy. The new approach is very suitable for parallel implementation for large transaction database mining. Copyright © 2019 for this paper by its authors.

关键词： database systems

A novel method for driving path planning with spark

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2021年

作者： Li, Leixiao Lin, Hao Wan, Jianxiong Wang, Yongsheng Gao, Jing College of Data Science and Application Inner Mongolia University of Technology China School of Computer Science and Engineering Tianjin University of Technology China Inner Mongolia Autonomous Region Engineering and Technology Research Center of Big Data Based Software Service China College of Computer and Information Engineering Inner Mongolia Agricultural University China Inner Mongolia Autonomous Region Key Laboratory of big data research and application for agriculture and animal husbandry China

Efficient and accurate driving path planning can help drivers drive. To solve the problem of low efficiency of traditional heuristic algorithms such as PSO and GA in solving driving path planning, we introduce Excellence Coefficient into heuristic algorithms and make a parallel design based on Spark, which called EC-SPPSOGA. Excellence Coefficient can increase the probability of good edges being left, simultaneously, preserves the possibility of longer side being selected. The parallel design is based on time-consuming analysis of heuristic algorithms. We validate the performance of EC-SPPSOGA based on the data in TSPLIB. It is verified that the EC-SPPSOGA can improve efficiency of driving path planning and has good scalability. © 2021, CC BY.

关键词： Heuristic algorithms

PScalpel: A Machine Learning-based Guider for Protein Phase-Separating Behaviour Alteration 39

学校读者我要写书评

暂无评论

PScalpel: A Machine Learning-based Guider for Protein Phase-...

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wang, Jia Zhu, Liyan Wang, Zhe Zhang, Chenqiu Wu, Yaoxing Cui, Jun Li, Jianqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China MOE Key Laboratory of Gene Function and Regulation Guangdong Province Key Laboratory of Pharmaceutical Functional Genes State Key Laboratory of Biocontrol School of Life Sciences Sun Yat-sen University Guangzhou China Guangdong Province Key Laboratory of Pharmaceutical Functional Genes First Affiliated Hospital of Sun Yat-sen University School of Life Sciences Sun Yat-sen University Guangzhou China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)157735897X

Missense mutations could affect the Liquid-Liquid Phase Separation (LLPS) propensity of proteins and lead to aberrant phase-separating behaviours, which are recently found to be associated with many diseases including Alzheimer’s and cancer. However, the regulatory role of mutations in LLPS remains unclear due to challenges in accurately characterizing the LLPS ability of mutants, including the high similarity in features, lack of labeled data, and vast amounts of data involved. To bridge this gap and facilitate the discovery of therapeutic strategies, we propose the first machine learning-based guider for protein phase-separating behaviour alteration, PScalpel. PScalpel leverages both structural information and an auxiliary tasks-based graph contrastive learning framework to distinguish the mutants’ LLPS ability, and incorporates a genetic algorithms-based recommendation method to identify mutants with desired LLPS properties. Comprehensive computational and biological experiments validate the effectiveness of PScalpel as a versatile tool for guiding alterations in protein phase separation behavior. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Genetic algorithms

Predicting crash fault residence via simplified deep forest based on a reduced feature set

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhao, Kunsong Liu, Jin Xu, Zhou Li, Li Yan, Meng Yu, Jiaojiao Zhou, Yuxuan School of Computer Science Wuhan University Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China Faculty of Information Technology Monash University Melbourne Australia College of Engineering and Computer Science Syracuse University Syracuse United States

The software inevitably encounters the crash, which will take developers a large amount of effort to find the fault causing the crash (short for crashing fault). Developing automatic methods to identify the residence of the crashing fault is a crucial activity for software quality assurance. Researchers have proposed methods to predict whether the crashing fault resides in the stack trace based on the features collected from the stack trace and faulty code, aiming at saving the debugging effort for developers. However, previous work usually neglected the feature preprocessing operation towards the crash data and only used traditional classification models. In this paper, we propose a novel crashing fault residence prediction framework, called ConDF, which consists of a consistency based feature subset selection method and a state-of-the-art deep forest model. More specifically, first, the feature selection method is used to obtain an optimal feature subset and reduce the feature dimension by reserving the representative features. Then, a simplified deep forest model is employed to build the classification model on the reduced feature set. The experiments on seven open source software projects show that our ConDF method performs significantly better than 17 baseline methods on three performance indicators. Copyright © 2021, The Authors. All rights reserved.

关键词： Forecasting

MC3D-AD: A Unified Geometry-aware Reconstruction Model for Multi-category 3D Anomaly Detection

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Cheng, Jiayi Gao, Can Zhou, Jie Wen, Jiajun Dai, Tao Wang, Jinbao College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China

3D Anomaly Detection (AD) is a promising means of controlling the quality of manufactured products. However, existing methods typically require carefully training a task-specific model for each category independently, leading to high cost, low efficiency, and weak generalization. Therefore, this paper presents a novel unified model for Multi-Category 3D Anomaly Detection (MC3D-AD) that aims to utilize both local and global geometry-aware information to reconstruct normal representations of all categories. First, to learn robust and generalized features of different categories, we propose an adaptive geometry-aware masked attention module that extracts geometry variation information to guide mask attention. Then, we introduce a local geometry-aware encoder reinforced by the improved mask attention to encode group-level feature tokens. Finally, we design a global query decoder that utilizes point cloud position embeddings to improve the decoding process and reconstruction ability. This leads to local and global geometry-aware reconstructed feature tokens for the AD task. MC3D-AD is evaluated on two publicly available Real3D-AD and Anomaly-ShapeNet datasets, and exhibits significant superiority over current state-of-the-art single-category methods, achieving 3.1% and 9.3% improvement in object-level AUROC over Real3D-AD and Anomaly-ShapeNet, respectively. The source code will be released upon acceptance. Copyright © 2025, The Authors. All rights reserved.

关键词： Geometry

Cooperative Sensing and Heterogeneous Information Fusion in VCPS: A Multi-agent Deep Reinforcement Learning Approach

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Xu, Xincao Liu, Kai Dai, Penglin Xie, Ruitao Cao, Jingjing Luo, Jiangtao The College of Computer Science Chongqing University Chongqing400040 China The School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China The National Engineering Laboratory of Integrated Transportation Big Data Application Technology Chengdu611756 China The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The School of Transportation and Logistics Engineering Wuhan University of Technology Hubei430063 China The Electronic Information and Networking Research Institute Chongqing University of Posts and Telecommunications Chongqing400065 China

Cooperative sensing and heterogeneous information fusion are critical to realize vehicular cyber-physical systems (VCPSs). This paper makes the first attempt to quantitatively measure the quality of VCPS by designing a new metric called Age of View (AoV). Specifically, we first present the system architecture where heterogeneous information can be cooperatively sensed and uploaded via vehicle-to-infrastructure (V2I) communications in vehicular edge computing (VEC). Logical views are constructed by fusing the heterogeneous information at edge nodes. Further, we formulate the problem by deriving a cooperative sensing model based on the multi-class M/G/1 priority queue, and defining the AoV by modeling the timeliness, completeness and consistency of the logical views. On this basis, a multi-agent deep reinforcement learning solution is proposed. In particular, the system state includes vehicle sensed information, edge cached information and view requirements. The vehicle action space consists of the sensing frequencies and uploading priorities of information. A difference-reward-based credit assignment is designed to divide the system reward, which is defined as the VCPS quality, into the difference reward for vehicles. Edge node allocates V2I bandwidth to vehicles based on predicted vehicle trajectories and view requirements. Finally, we build the simulation model and give a comprehensive performance evaluation, which conclusively demonstrates the superiority of the proposed solution. Copyright © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

CodeEnhance: A Codebook-Driven Approach for Low-Light Image Enhancement

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wu, Xu Hou, XianXu Lai, Zhihui Zhou, Jie Zhang, Ya-Nan Pedrycz, Witold Shen, Linlin The Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Shenzhen518060 China The Department of Electrical & Computer Engineering University of Alberta University of Alberta Canada

Low-light image enhancement (LLIE) aims to improve low-illumination images. However, existing methods face two challenges: (1) uncertainty in restoration from diverse brightness degradations;(2) loss of texture and color information caused by noise suppression and light enhancement. In this paper, we propose a novel enhancement approach, CodeEnhance, by leveraging quantized priors and image refinement to address these challenges. In particular, we reframe LLIE as learning an image-to-code mapping from low-light images to discrete codebook, which has been learned from high-quality images. To enhance this process, a Semantic Embedding Module (SEM) is introduced to integrate semantic information with low-level features, and a Codebook Shift (CS) mechanism, designed to adapt the pre-learned codebook to better suit the distinct characteristics of our low-light dataset. Additionally, we present an Interactive Feature Transformation (IFT) module to refine texture and color information during image reconstruction, allowing for interactive enhancement based on user preferences. Extensive experiments on both real-world and synthetic benchmarks demonstrate that the incorporation of prior knowledge and controllable information transfer significantly enhances LLIE performance in terms of quality and fidelity. The proposed CodeEnhance exhibits superior robustness to various degradations, including uneven illumination, noise, and color distortion. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement