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

International Conference on Computer Vision (ICCV)

作者： Yisheng Zhu Hu Han Zhengtao Yu Guangcan Liu Nanjing University of Posts and Telecommunications Key Laboratory of Intelligent Information Processing Institute of Computing Technology (ICT) Chinese Academy of Sciences (CAS) University of the Chinese Academy of Sciences Faculty of Information Engineering and Automation Kunming University of Science and Technology School of Automation Southeast University

Visual tempo characterizes the dynamics and the temporal evolution, which helps describe actions. Recent approaches directly perform visual tempo prediction on skeleton sequences, which may suffer from insufficient feature representation issue. In this paper, we observe that relative visual tempo is more in line with human intuition, and thus providing more effective supervision signals. Based on this, we propose a novel Relative Visual Tempo Contrastive Learning framework for skeleton action Representation (RVTCLR). Specifically, we design a Relative Visual Tempo Learning (RVTL) task to explore the motion information in intra-video clips, and an Appearance-Consistency (AC) task to learn appearance information simultaneously, resulting in more representative spatiotemporal features. Furthermore, skeleton sequence data is much sparser than RGB data, making the network learn shortcuts, and overfit to low-level information such as skeleton scales. To learn high-order semantics, we further design a new Distribution-Consistency (DC) branch, containing three components: Skeleton-specific Data Augmentation (S-DA), Fine-grained Skeleton Encoding Module (FSEM), and Distribution-aware Diversity (DD) Loss. We term our entire method (RVTCLR with DC) as RVTCLR+. Extensive experiments on NTU RGB+D 60 and NTU RGB+D 120 datasets demonstrate that our RVTCLR+ can achieve competitive results over the state-of-the-art methods. Code is available at https://***/Zhuysheng/RVTCLR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning of Person-independent Representations for Facial Action Unit Detection

arXiv

引用

arXiv 2024年

作者： Li, Yong Shan, Shiguang The Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China The Key Laboratory of Intelligent Information Processing Chinese Academy of Sciences Institute of Computing Technology CAS Beijing100190 China The University of Chinese Academy of Sciences Beijing100049 China Peng Cheng Laboratory Shenzhen518055 China

Facial action unit (AU) detection, aiming to classify AU present in the facial image, has long suffered from insufficient AU annotations. In this paper, we aim to mitigate this data scarcity issue by learning AU representations from a large number of unlabelled facial videos in a contrastive learning paradigm. We formulate the self-supervised AU representation learning signals in two-fold: (1) AU representation should be frame-wisely discriminative within a short video clip;(2) Facial frames sampled from different identities but show analogous facial AUs should have consistent AU representations. As to achieve these goals, we propose to contrastively learn the AU representation within a video clip and devise a cross-identity reconstruction mechanism to learn the person-independent representations. Specially, we adopt a margin-based temporal contrastive learning paradigm to perceive the temporal AU coherence and evolution characteristics within a clip that consists of consecutive input facial frames. Moreover, the cross-identity reconstruction mechanism facilitates pushing the faces from different identities but show analogous AUs close in the latent embedding space. Experimental results on three public AU datasets demonstrate that the learned AU representation is discriminative for AU detection. Our method outperforms other contrastive learning methods and significantly closes the performance gap between the self-supervised and supervised AU detection approaches. © 2024, CC BY.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Article reranking by memory-enhanced key sentence matching for detecting previously fact-checked claims 59

Article reranking by memory-enhanced key sentence matching f...

引用

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language processing, ACL-IJCNLP 2021

作者： Sheng, Qiang Cao, Juan Zhang, Xueyao Li, Xirong Zhong, Lei 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

ISBN: (纸本)9781954085527

False claims that have been previously fact-checked can still spread on social media. To mitigate their continual spread, detecting previously fact-checked claims is indispensable. Given a claim, existing works retrieve fact-checking articles (FC-articles) for detection and focus on reranking candidate articles in the typical two-stage retrieval framework. However, their performance may be limited as they ignore the following characteristics of FC-articles: (1) claims are often quoted to describe the checked events, providing lexical information besides semantics;and (2) sentence templates to introduce or debunk claims are common across articles, providing pattern information. In this paper, we propose a novel reranker, MTM (Memoryenhanced Transformers for Matching), to rank FC-articles using key sentences selected using event (lexical and semantic) and pattern information. For event information, we propose to finetune the Transformer with regression of ROUGE. For pattern information, we generate pattern vectors as a memory bank to match with the parts containing patterns. By fusing event and pattern information, we select key sentences to represent an article and then predict if the article fact-checks the given claim using the claim, key sentences, and patterns. Experiments on two real-world datasets show that MTM outperforms existing methods. Human evaluation proves that MTM can capture key sentences for explanations. The code and the dataset are at https://***/ICTMCG/MTM. © 2021 Association for Computational Linguistics

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: vivid multi-colored hair editing via latent diffusion 24

HairDiffusion: vivid multi-colored hair editing via latent d...

引用

Proceedings of the 38th International Conference on Neural information processing Systems

作者： Yu Zeng Yang Zhang Jiachen Liu Linlin Shen Kaijun Deng Weizhao He Jinbao Wang Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University and Shenzhen Institute of Artificial Intelligence and Robotics for Society and National Engineering Laboratory for Big Data System Computing Technology Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University and Guangdong Provincial Key Laboratory of Intelligent Information Processing

ISBN: (纸本)9798331314385

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Improved Differential Evolution Algorithm Integrating the Plant Evolutionary Strategy

SSRN

引用

SSRN 2024年

作者： Zhang, Xiaoming Cheng, Hongwei Li, Jun Li, Tingjuan Zhang, Panpan Tian, Ye Institutes of Physical Science and Information Technology Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China Qinghai Institute of Science and Technology Information Xining810008 China School of Computer Science and Technology Anhui University Hefei230601 China

Differential evolution algorithm (DE) and their variants often encounter a decrease in population diversity and convergence rate along with the evolution, resulting in local optima and premature convergence. To address this issue, this paper proposes an improved differential evolution integrating the plant evolutionary strategy, named DEPES, leveraging the exploitation capability of DE and the exploration capability of the plant population distribution evolutionary strategy. First, a tri-subpopulation optimization framework with a mutation strategy is introduced to cope with diversity maintenance, convergence enhancement, and local optima a Cauchy mutation operator based on plant population distribution evolutionary model is employed to enhance the exploration capability of the mutation strategy. Second, a parameter control strategy is performed on the superior and inferior solutions to balance the exploitation and exploration of the population. Third, a covariance matrix-based crossover strategy is designed to minimize interference from local population information, consequently generating high-quality solutions. The superior efficiency of DEPES is fully verified by comparing it with advanced DE-based variants and other algorithms on the IEEE CEC2020 test suite and engineering design problems. © 2024, The Authors. All rights reserved.

关键词： Covariance matrix

来源：评论

学校读者我要写书评

暂无评论

Alleviating Shifted Distribution in Human Preference Alignment through Meta-Learning 39

Alleviating Shifted Distribution in Human Preference Alignme...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Dou, Shihan Liu, Yan Zhou, Enyu Gao, Songyang Li, Tianlong Xiong, Limao Zhao, Xin Jia, Haoxiang Ye, Junjie Zheng, Rui Gui, Tao Zhang, Qi Huang, Xuanjing School of Computer Science Fudan University Shanghai China Ant Group Shanghai China School of Computer Science Peking University Beijing China Institute of Modern Languages and Linguistics Fudan University Shanghai China Key Laboratory of Intelligent Information Processing Fudan University Shanghai China Shanghai Collaborative Innovation Center of Intelligent Visual Computing Shanghai China

ISBN: (纸本)157735897X

The capability of the reward model (RM) is crucial for the success of Reinforcement Learning from Human Feedback (RLHF) in aligning with human preferences. However, as training progresses, the output space distribution of the policy model shifts. The RM, initially trained on responses sampled from the output distribution of the early policy model, gradually loses its ability to distinguish between responses from the newly shifted distribution. This issue is further compounded when the RM, trained on a specific data distribution, struggles to generalize to examples outside of that distribution. These two issues can be united as a challenge posed by the shifted distribution of the environment. To surmount this challenge, we introduce MetaRM, a novel method leveraging meta-learning to adapt the RM to the shifted environment distribution. MetaRM optimizes the RM in an alternating way, by preserving both the preferences of the original preference pairs, as well as maximizing discrimination power over new examples of the shifted distribution. Extensive experiments demonstrate that MetaRM can iteratively enhance the performance of human preference alignment by improving the RM’s capacity to identify subtle differences in samples of shifted distributions. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Quasiperiodic Symmetric Tilt FCC Grain Boundaries

arXiv

引用

arXiv 2024年

作者： Zou, Wenwen Zhang, Juan Xu, Jie Jiang, Kai Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China LSEC NCMIS Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China

In this work, we investigate [110] symmetric tilt FCC grain boundaries (GBs) by a recently developed approach for quasiperiodic interfaces using the Landau-Brazovskii model. On special tilt angles associated with quadratic algebraic numbers, quasiperiodic GBs exhibit generalized Fibonacci substitution rules. The transition mechanism from quasiperiodic GBs to periodic GBs is explored through sphere offsets and spectral coalescence. We also propose an accurate method to calculate the GB energy for arbitrary tilt angle and analyze the factors affecting the GB energy. The revealing GB energy change is continue along with tilt angle except periodic GBs. © 2024, CC BY-NC-SA.

关键词： Grain boundaries

来源：评论

学校读者我要写书评

暂无评论

Knowledge Graph Embedding Based Graph Convolutional Network for Link Prediction

Knowledge Graph Embedding Based Graph Convolutional Network ...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Qiang Wu Qing He Henan Institute of Advanced Technology Zhengzhou University Zhengzhou P.R. China Key Lab of Intelligent Information Processing of Chinese Academy of Science (CAS) Institute of Computing Technology CAS Beijing China University of Chinese Academy of Science Beijing China

Knowledge Graph Embedding (KGE) aims to capture the inherent structural information within knowledge graphs (KGs) by means of representation learning. This is of paramount importance for various downstream tasks, including personalized recommendations, intelligent search, and relation extraction. Graph Convolutional Networks (GCNs), a type of neural network, have recently demonstrated significant success in modeling data structured as graphs. However, these models often overlook the intricate interrelation information between neighboring nodes, which can offer valuable insights for enhancing node embeddings. In this article, we present a knowledge graph embedding based graph convolutional network for link prediction. First, we utilize embeddings to represent entities and relations. Second, we perform circular correlation on subject embedding and relation embedding to generate two matrix and achieve full fusion of embedding at the element level. Third, we generate self-attention vectors using one of the matrices and perform the Hadamard product with the other matrix. Thereafter, new node features are generated through graph convolutional networks and residual unit. Finally, we use the scoring function to score the candidate triples. The experimental results demonstrate that our model achieves improved performance compared with a wide variety of baseline models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhancing Sample Utilization in Noise-robust Deep Metric Learning with Subgroup-based Positive-pair Selection

arXiv

引用

arXiv 2025年

作者： Yu, Zhipeng Xu, Qianqian Jiang, Yangbangyan Sun, Yingfei Huang, Qingming The School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China

The existence of noisy labels in real-world data negatively impacts the performance of deep learning models. Although much research effort has been devoted to improving the robustness towards noisy labels in classification tasks, the problem of noisy labels in deep metric learning (DML) remains under-explored. Existing noisy label learning methods designed for DML mainly discard suspicious noisy samples, resulting in a waste of the training data. To address this issue, we propose a noise-robust DML framework with SubGroup-based Positive-pair Selection (SGPS), which constructs reliable positive pairs for noisy samples to enhance the sample utilization. Specifically, SGPS first effectively identifies clean and noisy samples by a probability-based clean sample selectionstrategy. To further utilize the remaining noisy samples, we discover their potential similar samples based on the subgroup information given by a subgroup generation module and then aggregate them into informative positive prototypes for each noisy sample via a positive prototype generation module. Afterward, a new contrastive loss is tailored for the noisy samples with their selected positive pairs. SGPS can be easily integrated into the training process of existing pair-wise DML tasks, like image retrieval and face recognition. Extensive experiments on multiple synthetic and real-world large-scale label noise datasets demonstrate the effectiveness of our proposed method. Without any bells and whistles, our SGPS framework outperforms the state-of-the-art noisy label DML methods. Code is available at https://***/smuelpeng/SGPS-NoiseFreeDML. © 2025, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Vision-Based Fruit Recognition Via Multi-Scale Attention Cnn

SSRN

引用

SSRN 2022年

作者： Min, Weiqing Wang, Zhiling Yang, Jiahao Liu, Chunlin Jiang, Shuqiang The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

Fruit quality assessment, grading and sorting are of vital importance to fruit processing, and all these involve fruit recognition. Vision-based fruit recognition can recognize fruit automatically and further support more applications such as fruit-picking robots, self-checkout service, and dietary guidance. Recent works resort to Convolutional Neural Networks (CNNs) for vision-based fruit recognition because of their powerful expressive capacity. However, most works simply utilize existing CNNs and ignore characteristics of fruit images, resulting in sub-optimal recognition performance. To solve this problem, we adopt a Multi-Scale Attention Network (MSANet), which explores attention from different layers of CNNs and aggregates various visual attentional features from different levels into final comprehensive representations. Extensive evaluations on four fruit benchmark datasets demonstrate that the method achieves state-of-the-art recognition performance. In addition, we report various experimental results from different deep networks as baselines. Codes and models will be released upon publication. Models and code are available at http://123.57.42.89/codes/***. © 2022, The Authors. All rights reserved.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：