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

40th IEEE International Conference on Data engineering, ICDE 2024

作者： Yan, Kefei Fang, Wei Lu, Hengyang Zhang, Xin Sun, Jun Wu, Xiaojun Jiangnan University Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Department of Computer Science and Technology Wuxi214122 China

ISBN: (纸本)9798350317152

Bayesian network structure learning (BNSL) from data is an NP-hard problem. Genetic algorithms are powerful for solving combinatorial optimization problems, but the lack of effective guidance results in slow convergence and low accuracy regarding BNSL. To address this problem, we propose a mutual information (MI) guided genetic algorithm (MIGA) for BNSL in this paper, which uses MI to effectively search BN structures. In the initialization phase of MIGA, the population is generated by adding additional constraints based on MI to reach a higher score without losing diversity. By employing normalized MI and defining the population support, the potential dominance in the population can be identified and then used to design a novel crossover operator in order to preserve the dominant genes with a higher probability. Moreover, with the guidance of MI for removing loops from the structures, infeasible solutions can be handled in a straightforward and practical way. The proposed MIGA is evaluated on eleven well-known benchmark datasets and compared with four GA-based methods and four other state-of-the-art BNSL algorithms. Experimental results show that MIGA outperforms the compared algorithms in convergence and learning accuracy. © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

PHUI-GA: GPU-based efficiency evolutionary algorithm for mining high utility itemsets

引用

Journal of Systems engineering and Electronics 2024年第4期35卷 965-975页

作者： JIANG Haipeng WU Guoqing SUN Mengdan LI Feng SUN Yunfei FANG Wei Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Department of Computer Science and TechnologyJiangnan UniversityWuxi 214122China China Ship Scientific Research Center Wuxi 214082China Taihu Laboratory of Deepsea Technological Science Wuxi 214082China Department of Mathematics Nanjing UniversityNanjing 210023China

Evolutionary algorithms(EAs)have been used in high utility itemset mining(HUIM)to address the problem of discover-ing high utility itemsets(HUIs)in the exponential search *** have good running and mining performance,but they still require huge computational resource and may miss many *** to the good combination of EA and graphics processing unit(GPU),we propose a parallel genetic algorithm(GA)based on the platform of GPU for mining HUIM(PHUI-GA).The evolution steps with improvements are performed in central processing unit(CPU)and the CPU intensive steps are sent to GPU to eva-luate with multi-threaded *** show that the mining performance of PHUI-GA outperforms the existing *** mining 90%HUIs,the PHUI-GA is up to 188 times better than the existing EAs and up to 36 times better than the CPU parallel approach.

关键词： high utility itemset mining(HUIM) graphics process-ing unit(GPU)parallel genetic algorithm(GA) mining perfor-mance

来源：评论

学校读者我要写书评

暂无评论

Adjustable Gating Prompt Transformer for Facial Attribute recognition with Limited Labeled Data 27th

Adjustable Gating Prompt Transformer for Facial Attribute R...

引用

27th International Conference on pattern recognition, ICPR 2024

作者： Ye, Qinxian Chen, Si Wang, Da-Han Jiang, Nanfeng Su, Yanfei Yan, Yan Fujian Key Laboratory of Pattern Recognition and Image Understanding School of Computer and Information Engineering Xiamen University of Technology Xiamen361024 China School of Informatics Xiamen University Xiamen361005 China

ISBN: (纸本)9783031781032

Existing supervised facial attribute recognition (FAR) methods that rely on large labeled datasets can pose a challenge in real-world scenarios. In the case of limited labeled data, the current methods that introduce auxiliary tasks with a large number of parameters are not conducive to the embedded applications of FAR. To overcome these challenges, this paper develops an adjustable gating prompt Transformer that can handle the limited labeled FAR task with a small number of training parameters. Specifically, we employ an effective image-guided prompt tuning, where the image-related prompt sequence is first generated by feeding image tokens into an image-guided prompt generation network (IPG-Net). Then, the prompt sequence can learn facial image information and guide the frozen pre-trained Transformer to fine-tune the model. In addition, dynamically adjustable gating is applied to the prompt sequence to adaptively adjust the contribution of the prompts from different encoder layers, which enhances the interaction between the different encoder layers and retains effective feature information during the iterative process. Experimental results on the CelebA and LFWA datasets demonstrate that our method outperforms competitive methods with a very small amount of training parameters when only limited labeled data are used. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Re-identification of Saimaa Ringed Seals from Image Sequences 23rd

Re-identification of Saimaa Ringed Seals from Image Sequen...

引用

22nd Scandinavian Conference on Image Analysis, SCIA 2023

作者： Nepovinnykh, Ekaterina Vilkman, Antti Eerola, Tuomas Kälviäinen, Heikki Computer Vision and Pattern Recognition Laboratory Department of Computational Engineering Lappeenranta-Lahti University of Technology LUT Lappeenranta Finland

ISBN: (纸本)9783031314346

Automatic game cameras are commonly used for monitoring wildlife as they allow to document of the activity of animals in a non-invasive manner. By utilizing a large number of cameras and identifying individual animals from the images, it is possible to, for example, estimate the population size and study the migration patterns of the animals. Large image volumes produced by the cameras call for automated methods for the analysis. Re-identification of animals has commonly been implemented through one-to-one matching, where images are processed individually and the best match is searched from the database of known individuals one by one. Game cameras can be configured to produce a sequence of images that allows capturing the animal from multiple angles potentially improving the re-identification accuracy. In this work, the re-identification of the endangered Saimaa ringed seal (pusa hispida saimensis) from image sequences is studied. The individual identification is realized through Saimaa ringed seal’s unique pelage pattern. The proposed one-to-many and many-to-many matching methods aggregate the pelage pattern features over the whole sequence providing better embeddings for the re-identification tasks. We show that the proposed aggregation method outperforms traditional one-to-one matching based re-identification by a large margin. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Animals

来源：评论

学校读者我要写书评

暂无评论

GCAT: graph calibration attention transformer for robust object tracking

引用

Neural Computing and Applications 2024年第23期36卷 14151-14172页

作者： Chen, Si Hu, Xinxin Wang, Da-Han Yan, Yan Zhu, Shunzhi Fujian Key Laboratory of Pattern Recognition and Image Understanding School of Computer and Information Engineering Xiamen University of Technology Xiamen361024 China State Key Laboratory of Integrated Services Networks Xidian University Xi’an710071 China Fujian Key Laboratory of Sensing and Computing for Smart City School of Informatics Xiamen University Xiamen361005 China

Recent Siamese trackers have taken advantage of transformers to achieve impressive advancements. However, existing transformer trackers ignore considering the positional and structural information between tokens, and traditional template update strategies easily introduce noises to the dynamic templates during tracking. In order to alleviate this issue, this paper develops a novel end-to-end graph calibration attention transformer network (GCAT) to enhance tracking robustness and accuracy. A graph calibration attention mechanism is first designed to calibrate and aggregate template information, for effectively updating dynamic templates during the tracking process. Specifically, each token is considered as a node in the graph, and then, we calculate the weight relationships between each node and their adjacent nodes. Thus, this mechanism can aggregate the global context information of the template and search nodes and activate feature channels based on weights and biases to obtain more discriminative feature information. Moreover, we leverage a multi-level dropout mechanism to perform the data dropout, the layer dropout, and the feature dropout on the data, network, and attention levels, respectively, to avoid overfitting of local-specific information and improve the generalization ability. Extensive experiments show the proposed method achieves superior performance on seven challenging benchmark datasets, i.e., OTB100, OTB2013, UAV123, LaSOT, GOT10K, VOT2020, and TrackingNet. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

UformPose: A U-Shaped Hierarchical Multi-Scale Keypoint-Aware Framework for Human Pose Estimation

引用

IEEE Transactions on Circuits and Systems for Video Technology 2023年第4期33卷 1697-1709页

作者： Wang, You-Jie Luo, Yan-Min Bai, Gui-Hu Guo, Jing-Ming Huaqiao University Key Laboratory for Computer Vision and Pattern Recognition The College of Computer Science and Technology Xiamen361021 China National Taiwan University of Science and Technology Department of Electrical Engineering Taipei10607 Taiwan

Human pose estimation is a fundamental yet challenging task in computer vision. However, difficult scenarios such as invisible keypoints, occlusions and small-scale persons are still not well-handed. In this paper, we present a novel pose estimation framework named UformPose which targets to relieve these issues. UformPose has two core designs: Shared Feature Pyramid Stem (SFPS) and U-shaped hierarchical Multi-scale Keypoint-aware Attention Module (U-MKAM). SFPS is a feature pyramid stem with shared mechanism to learn stronger low-level features at the initial stage, and the shared mechanism can facilitate cross-resolution commonality learning. Our U-MKAM attempts to generate high-quality high-resolution representations by integrating all levels of feature representation of the backbone layer by layer. More importantly, we utilize the flexibility of attention operations for keypoint-aware modeling, which explicitly captures and trades-offs the dependencies between keypoints. We empirically demonstrate the effectiveness of our framework through the competitive pose estimation results on the COCO dataset. Extensive experiments and visual analysis on CrowdPose demonstrate the robustness of our model in crowd scenes. © 1991-2012 IEEE.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

GPU-Based Efficient Parallel Heuristic Algorithm for High-Utility Itemset Mining in Large Transaction Datasets (Extended Abstract) 40

GPU-Based Efficient Parallel Heuristic Algorithm for High-Ut...

引用

40th IEEE International Conference on Data engineering, ICDE 2024

作者： Fang, Wei Jiang, Haipeng Lu, Hengyang Sun, Jun Wu, Xiaojun Lin, Jerry Chun-Wei Jiangnan University Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Department of Computer Science and Technology Wuxi214122 China Silesian University of Technology Department of Distributed Systems and IT Devices Poland

ISBN: (纸本)9798350317152

Heuristic algorithms have been developed to find approximate solutions for high-utility itemset mining (HUIM) problems that compensate for the performance bottlenecks of exact algorithms. However, heuristic algorithms still face the problem of long runtime and insufficient mining quality, especially for large transaction datasets with thousands to tens of thousands of items and up to millions of transactions. To solve these problems, a novel GPU-based efficient parallel heuristic algorithm for HUIM (PHA-HUIM) is proposed in this paper. The iterative process of PHA-HUIM consists of three main steps: the search strategy, fitness evaluation, and ring topology communication. The search strategy and ring topology communication are designed to run in constant time on GPU. The parallelism of fitness evolution helps to substantially accelerate the algorithm. To improve the mining quality, a multi-start strategy with an unbalanced allocation strategy is employed in the search process. Ring topology communication is adopted to maintain population diversity. A load balancing strategy is introduced to reduce the thread divergence to improve the parallel efficiency. The experimental results on nine large datasets show that PHA-HUIM outperforms state-of-the-art HUIM algorithms in terms of speedup performance, runtime, and mining quality. © 2024 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Spatio-temporal Attention Graph Convolutions for Skeleton-based Action recognition 23rd

Spatio-temporal Attention Graph Convolutions for Skeleton-b...

引用

22nd Scandinavian Conference on Image Analysis, SCIA 2023

作者： Le, Cuong Liu, Xin Computer Vision and Pattern Recognition Laboratory School of Engineering Science Lappeenranta-Lahti University of Technology LUT Lappeenranta Finland Computer Vision Laboratory Department of Electrical Engineering Linköping University Linköping Sweden

ISBN: (纸本)9783031314346

In skeleton-based action recognition, graph convolutional networks (GCN) have been applied to extract features based on the dynamic of the human body and the method has achieved excellent results recently. However, GCN-based techniques only focus on the spatial correlations between human joints and often overlook the temporal relationships. In an action sequence, the consecutive frames in a neighborhood contain similar poses and using only temporal convolutions for extracting local features limits the flow of useful information into the calculations. In many cases, the discriminative features can present in long-range time steps and it is important to also consider them in the calculations to create stronger representations. We propose an attentional graph convolutional network, which adapts self-attention mechanisms to respectively model the correlations between human joints and between every time steps for skeleton-based action recognition. On two common datasets, the NTU-RGB+D60 and the NTU-RGB+D120, the proposed method achieved competitive classification results compared to state-of-the-art methods. The project’s GitHub page: STA-GCN. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

A Grassmannian Manifold Self-Attention Network for Signal Classification 33

A Grassmannian Manifold Self-Attention Network for Signal Cl...

引用

33rd International Joint Conference on Artificial Intelligence, IJCAI 2024

作者： Wang, Rui Hu, Chen Chen, Ziheng Wu, Xiao-Jun Song, Xiaoning School of Artificial Intelligence and Computer Science Jiangnan University Wuxi China Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University Wuxi China Department of Information Engineering and Computer Science University of Trento Trento Italy

ISBN: (纸本)9781956792041

In the community of artificial intelligence, significant progress has been made in encoding sequential data using deep learning techniques. Nevertheless, how to effectively mine useful information from channel dimensions remains a major challenge, as these features have a submanifold structure. Linear subspace, the basic element of the Grassmannian manifold, has proven to be an effective manifold-valued feature descriptor in statistical representation. Besides, the Euclidean self-attention mechanism has shown great success in capturing long-range relationships of data. Inspired by these facts, we extend the self-attention mechanism to the Grassmannian manifold. Our framework can effectively characterize the spatiotemporal fluctuations of sequential data encoded in the Grassmannian manifold. Extensive experimental results on three benchmarking datasets (a drone recognition dataset and two EEG signal classification datasets) demonstrate the superiority of our method over the state-of-the-art. The code and supplementary material for this work can be found at https://***/ChenHu-ML/GDLNet. © 2024 International Joint Conferences on Artificial Intelligence. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Java Bytecode Control Flow Classification: Framework for Guiding Java Decompilation

引用

Journal of Mobile Multimedia 2022年第2期18卷 179-202页

作者： Sateanpattanakul, Siwadol Jetpipattanapong, Duangpen Mathulaprangsan, Seksan Pattern REcognition and Computational InTElligent Laboratory (PRECITE Lab) Department of Computer Engineering Faculty of Engineering at Kamphaengsean Kasetsart University Nakhon Pathom Thailand

Decompilation is the main process of software development, which is very important when a program tries to retrieve lost source codes. Although decompiling Java bytecode is easier than bytecode, many Java decompilers cannot recover originally lost sources, especially the selection statement, i.e., if statement. This deficiency affects directly decompilation performance. In this paper, we propose the methodology for guiding Java decompiler to deal with the aforementioned problem. In the framework, Java bytecode is transformed into two kinds of features called frame feature and latent semantic feature. The former is extracted directly from the bytecode. The latter is achieved by two-step transforming the Java bytecode to bigram and then term frequency-inverse document frequency (TFIDF). After that, both of them are fed to the genetic algorithm to reduce their dimensions. The proposed feature is achieved by converting the selected TFIDF to a latent semantic feature and concatenating it with the selected frame feature. Finally, KNN is used to classify the proposed feature. The experimental results show that the decompilation accuracy is 93.68 percent, which is obviously better than Java Decompiler. © 2021 River Publishers

关键词： Decompilation Feature selection Genetic algorithm Latent semantic indexing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：