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

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Xiaorong Qin Xinhang Song Shuqiang Jiang Key Lab of Intelligent Information Processing Laboratory of the Chinese Academy of Sciences (CAS) Institute of Computing Technology Beijing University of Chinese Academy of Sciences Beijing

The goal of few-shot learning is to learn the generalization from seen to unseen data with only a few samples. Most previous few-shot learning methods focus on learning the generalization within particular domains. However, the more practical scenarios may also require the generalization ability across domains. In this paper, we study the problem of few-shot domain generalization (FSDG), which is a more challenging variant of few-shot classification. FSDG requires additional generalization with larger gap from seen domains to unseen domains. We address FSDG problem by meta-learning two levels of meta-knowledge, where the lower-level meta-knowledge is domain-specific embedding spaces as subspaces of a base space for intra-domain generalization, and the upper-level meta-knowledge is the base space and a prior subspace over domain-specific spaces for inter-domain generalization. We formulate the two levels of meta-knowledge learning problem with bi-level optimization, and further develop an optimization algorithm without higher-order derivative information to solve it. We demonstrate our method is significantly superior to the previous works by evaluating it on the widely used benchmark Meta-Dataset.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TFGDA: Exploring Topology and Feature Alignment in Semi-supervised Graph Domain Adaptation through Robust Clustering 38

TFGDA: Exploring Topology and Feature Alignment in Semi-supe...

引用

38th Conference on Neural information processing Systems, NeurIPS 2024

作者： Dan, Jun Liu, Weiming Xie, Chunfeng Yu, Hua Dong, Shunjie Tan, Yanchao Zhejiang University China Queen Mary University of London United Kingdom Dalian University of Technology China Shanghai Jiao Tong University China Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China Fujian Key Laboratory of Network Computing and Intelligent Information Processing China

Semi-supervised graph domain adaptation, as a branch of graph transfer learning, aims to annotate unlabeled target graph nodes by utilizing transferable knowledge learned from a label-scarce source graph. However, most existing studies primarily concentrate on aligning feature distributions directly to extract domain-invariant features, while ignoring the utilization of the intrinsic structure information in graphs. Inspired by the significance of data structure information in enhancing models' generalization performance, this paper aims to investigate how to leverage the structure information to assist graph transfer learning. To this end, we propose an innovative framework called TFGDA. Specially, TFGDA employs a structure alignment strategy named STSA to encode graphs' topological structure information into the latent space, greatly facilitating the learning of transferable features. To achieve a stable alignment of feature distributions, we also introduce a SDA strategy to mitigate domain discrepancy on the sphere. Moreover, to address the overfitting issue caused by label scarcity, a simple but effective RNC strategy is devised to guide the discriminative clustering of unlabeled nodes. Experiments on various benchmarks demonstrate the superiority of TFGDA over SOTA methods. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on Enhanced Perception and Attention-Driven Person Re-Identification 20

Research on Enhanced Perception and Attention-Driven Person ...

引用

20th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2024

作者： Wu, Cancan Li, Dong Zhang, Zhi College of Computer Science and Technology Wuhan University of Science and Technology Hubei Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Hubei Wuhan430065 China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology Hubei Wuhan430065 China

ISBN: (纸本)9798350356328

When matching similarity among pedestrians in images, pedestrian re-identification algorithms are often disturbed by occlusions. A typical tactic is to improve the robustness of occlusion features in the model. However, this approach neglects the noise introduced by other pedestrians in the image, leading to limited learning of relevant information between images. To address these issues, this paper introduces a pedestrian re-identification model that leverages perception-enhanced and attention mechanisms. By enhancing the perception of non-pedestrian noise and erasing non-pedestrian features, we then employ a cross-attention mechanism to subtly embed global and local features for finer feature recognition. Finally, through context attention, we learn the interaction between pedestrian images to improve re-identification accuracy. Results from studies performed on the Market-1501, CUHK03-D, and Duke-ReID datasets indicate that the suggested model surpasses leading contemporary models regarding Rank-1 scores and mean Average Precision (mAP), while maintaining good robustness. © 2024 IEEE.

关键词： Reamers

来源：评论

学校读者我要写书评

暂无评论

Multi-perspective Text Matching Algorithm Based on Multi-granularity Feature Convolution 12

Multi-perspective Text Matching Algorithm Based on Multi-gra...

引用

12th International Conference on computing and Pattern Recognition, ICCPR 2023

作者： Qiang, Baohua Guo, Zhiwen Xi, Guangyong Guo, Shuiping Wang, Yufeng Yang, Xianyi Wang, Yuemeng Guilin University of Electronic Technology Guilin China The 7th Research Institute of Cetc Guangzhou China The 54th Research Institute of Cetc Shijiazhuang China Hebei Key Laboratory of Intelligent Information Perception and Processing Shijiazhuang China

ISBN: (纸本)9798400707988

The core of Chinese text matching task lies in mining the deep semantic information inside the text, exploring the semantic similarities and differences between different texts, and then analyzing the semantic similarity between two texts to be matched. To address the problems of single text granularity feature, insufficient capture of potential semantic information at multiple granularities and weak interactive matching of coding features in Chinese text matching, we propose a multi-perspective text matching model based on multi-granularity features convolution (MpmMfc). The model first extracts characters, words and associated phrases by multi-pattern partitioning and performs initial encoding, then uses a two-way gate loop control unit to initially extract the contextual semantic information in the encoding. Then a multi-grain size high-dimensional encoding matrix is constructed and convolutional neural network is used to capture the granularity features to improve the characterization of multi-granularity semantic information. Finally, the multi-granularity convolutional matrices of two texts are cross-cosine matched by multi-perspective matching patterns to enhance the interaction strength of multi-granularity feature information. The results achieved in the experiments of LCQMC, a spoken expression class dataset, and BQ, a financial class dataset, are better than the currently available non-BERT type text matching models. © 2023 ACM.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

An evolutionary multiobjective method based on dominance and decomposition for feature selection in classification

引用

Science China(information Sciences) 2024年第2期67卷 5-19页

作者： Jing LIANG Yuyang ZHANG Ke CHEN Boyang QU Kunjie YU Caitong YUE Ponnuthurai Nagaratnam SUGANTHAN School of Electrical and Information Engineering Zhengzhou University State Key Laboratory of Intelligent Agricultural Power Equipment School of Electrical Engineering and Automation Henan Institute of Technology School of Electronics and Information Zhongyuan University of Technology KINDI Center for Computing Research College of EngineeringQatar University

Feature selection in classification can be considered a multiobjective problem with the objectives of increasing classification accuracy and decreasing the size of the selected feature subset. Dominance-based and decomposition-based multiobjective evolutionary algorithms(MOEAs) have been extensively used to address the feature selection problem due to their strong global search capability. However, most of them face the problem of not effectively balancing convergence and diversity during the evolutionary process. In addressing the aforementioned issue, this study proposes a unified evolutionary framework that combines two search forms of dominance and decomposition. The advantages of the two search methods assist one another in escaping the local optimum and inclining toward a balance of convergence and diversity. Specifically, an improved environmental selection strategy based on the distributions of individuals in the objective space is presented to avoid duplicate feature subsets. Furthermore, a novel knowledge transfer mechanism that considers evolutionary characteristics is developed, allowing for the effective implementation of positive knowledge transfer between dominance-based and decomposition-based feature selection methods. The experimental results demonstrate that the proposed algorithm can evolve feature subsets with good convergence and diversity in a shorter time compared with 9 state-of-the-art feature selection methods on 20 classification problems.

关键词： evolutionary algorithms feature selection multiobjective optimization knowledge transfer classification

来源：评论

学校读者我要写书评

暂无评论

Data-free Multi-label Image Recognition via LLM-powered Prompt Tuning

arXiv

引用

arXiv 2024年

作者： Yang, Shuo Shang, Zirui Wang, Yongqi Deng, Derong Chen, Hongwei Cheng, Qiyuan Wu, Xinxiao Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China

This paper proposes a novel framework for multi-label image recognition without any training data, called data-free framework, which uses knowledge of pre-trained Large Language Model (LLM) to learn prompts to adapt pre-trained Vision-Language Model (VLM) like CLIP to multi-label classification. Through asking LLM by well-designed questions, we acquire comprehensive knowledge about characteristics and contexts of objects, which provides valuable text descriptions for learning prompts. Then we propose a hierarchical prompt learning method by taking the multi-label dependency into consideration, wherein a subset of category-specific prompt tokens are shared when the corresponding objects exhibit similar attributes or are more likely to co-occur. Benefiting from the remarkable alignment between visual and linguistic semantics of CLIP, the hierarchical prompts learned from text descriptions are applied to perform classification of images during inference. Our framework presents a new way to explore the synergies between multiple pre-trained models for novel category recognition. Extensive experiments on three public datasets (MS-COCO, VOC2007, and NUS-WIDE) demonstrate that our method achieves better results than the state-of-the-art methods, especially outperforming the zero-shot multi-label recognition methods by 4.7% in mAP on MS-COCO. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Video Summarization using Denoising Diffusion Probabilistic Model

arXiv

引用

arXiv 2024年

作者： Shang, Zirui Zhu, Yubo Li, Hongxi Yang, Shuo Wu, Xinxiao Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China

Video summarization aims to eliminate visual redundancy while retaining key parts of video to construct concise and comprehensive synopses. Most existing methods use discriminative models to predict the importance scores of video frames. However, these methods are susceptible to annotation inconsistency caused by the inherent subjectivity of different annotators when annotating the same video. In this paper, we introduce a generative framework for video summarization that learns how to generate summaries from a probability distribution perspective, effectively reducing the interference of subjective annotation noise. Specifically, we propose a novel diffusion summarization method based on the Denoising Diffusion Probabilistic Model (DDPM), which learns the probability distribution of training data through noise prediction, and generates summaries by iterative denoising. Our method is more resistant to subjective annotation noise, and is less prone to overfitting the training data than discriminative methods, with strong generalization ability. Moreover, to facilitate training DDPM with limited data, we employ an unsupervised video summarization model to implement the earlier denoising process. Extensive experiments on various datasets (TVSum, SumMe, and FPVSum) demonstrate the effectiveness of our method. Copyright © 2024, The Authors. All rights reserved.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

Residual Hyperbolic Graph Convolution Networks

arXiv

引用

arXiv 2024年

作者： Xue, Yangkai Dai, Jindou Lu, Zhipeng Wu, Yuwei Jia, Yunde Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China

Hyperbolic graph convolutional networks (HGCNs) have demonstrated representational capabilities of modeling hierarchical-structured graphs. However, as in general GCNs, over-smoothing may occur as the number of model layers increases, limiting the representation capabilities of most current HGCN models. In this paper, we propose residual hyperbolic graph convolutional networks (R-HGCNs) to address the over-smoothing problem. We introduce a hyperbolic residual connection function to overcome the over-smoothing problem, and also theoretically prove the effectiveness of the hyperbolic residual function. Moreover, we use product manifolds and HyperDrop to facilitate the R-HGCNs. The distinctive features of the R-HGCNs are as follows: (1) The hyperbolic residual connection preserves the initial node information in each layer and adds a hyperbolic identity mapping to prevent node features from being indistinguishable. (2) Product manifolds in R-HGCNs have been set up with different origin points in different components to facilitate the extraction of feature information from a wider range of perspectives, which enhances the representing capability of R-HGCNs. (3) HyperDrop adds multiplicative Gaussian noise into hyperbolic representations, such that perturbations can be added to alleviate the over-fitting problem without deconstructing the hyperbolic geometry. Experiment results demonstrate the effectiveness of R-HGCNs under various graph convolution layers and different structures of product manifolds. © 2024, CC BY.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

NetPrompt: Neural Network Prompting Enhances Event Extraction in Large Language Models

引用

IEEE Transactions on Big Data 2025年

作者： Mu, Lin Cheng, Yide Shen, Jun Zhang, Yiwen Zhong, Hong School of Computer Science and Technology Anhui University Anhui Hefei230601 China The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education the Anhui Engineering Laboratory of IoT Security Technologies the School of Computer Science and Technology the Institute of Physical Science and Information Technology Anhui University Hefei230039 China

Event Extraction involves extracting event-related information such as event types and event arguments from context, which has long been tackled through well-designed neural networks or fine-tuned pre-trained language models. These approaches require substantial annotated data for tuning parameters and are resource-intensive. Recently, Prompting strategies with frozen parameters, such as Chain-of-Thought and Self-Consistency, have delivered success in NLP using LLMs by generating intermediate thought steps. However, they suffer from the challenge of error propagation and lack of interaction between different thoughts. In this paper, we propose Neural Network-based Prompting (NetPrompt), a novel network-structured prompting strategy for event extraction. The core idea behind NetPrompt is to imitate the excellent information integration capabilities of neural network structures. Specifically, we first decompose the event extraction problem into diverse intermediate subtasks, and each subtask is represented as a node in different layers of the network, the output of the nodes in the preceding layer is fed into the subsequent layer. Secondly, we propose pruning strategies to adapt the reasoning overhead to different problems. Finally, we have conducted extensive experiments on two widely used event extraction benchmarks to evaluate NetPrompt. The results demonstrated that NetPrompt significantly improved the event extraction performance compared to previous methods. ©2015 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: boosting can achieve modality reconcilement 24

ReconBoost: boosting can achieve modality reconcilement

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Cong Hua Qianqian Xu Shilong Bao Zhiyong Yang Qingming Huang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China and School of Cyber Security University of Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China and Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：