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

arXiv 2025年

作者： Zhang, Lijun Zhang, Yifan Tang, Weicheng Sun, Xinzhi Wang, Xiaomeng Li, Zhanshan College of Computer Science and Technology Jilin University Changchun Jilin130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin130012 China

Micro-expression recognition (MER) presents a significant challenge due to the transient and subtle nature of the motion changes involved. In recent years, deep learning methods based on attention mechanisms have made some breakthroughs in MER. However, these methods still suffer from the limitations of insufficient feature capture and poor dynamic adaptation when coping with the instantaneous subtle movement changes of micro-expressions. Therefore, in this paper, we design an Adaptive Hierarchical Multi-Scale Attention Network (AHMSA-Net) for MER. Specifically, we first utilize the onset and apex frames of the micro-expression sequence to extract threedimensional (3D) optical flow maps, including horizontal optical flow, vertical optical flow, and optical flow strain. Subsequently, the optical flow feature maps are inputted into AHMSA-Net, which consists of two parts: an adaptive hierarchical framework and a multi-scale attention mechanism. Based on the adaptive downsampling hierarchical attention framework, AHMSA-Net captures the subtle changes of micro-expressions from different granularities (fine and coarse) by dynamically adjusting the size of the optical flow feature map at each layer. Based on the multi-scale attention mechanism, AHMSA-Net learns micro-expression action information by fusing features from different scales (channel and spatial). These two modules work together to comprehensively improve the accuracy of MER. Additionally, rigorous experiments demonstrate that the proposed method achieves competitive results on major micro-expression databases, with AHMSA-Net achieving recognition accuracy of up to 78.21% on composite databases (SMIC, SAMM, CASMEII) and 77.08% on the CASME3 database. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

KSSANet: KAN-Driven Spatial-Spectral Attention Networks for Hyperspectral Image Super-Resolution

KSSANet: KAN-Driven Spatial-Spectral Attention Networks for ...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Baisong Li Xingwang Wang Haixiao Xu College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Krowledge Engineering of Ministry of Education Jilin University

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Due to the limitations of physical imaging, acquiring high-resolution hyperspectral images (HR-HSIs) has always been a significant challenge. Single hyperspectral image super-resolution (SHSR) technology aims to generate corresponding HR-HSIs by processing low-resolution hyperspectral images (LR-HSIs). Compared to multi-source data fusion methods, SHSR relies solely on a single low-resolution image and does not require additional auxiliary information or multimodal data, making it more flexible and efficient in data acquisition. Recently, Kolmogorov–Arnold Networks (KAN), which derive from the Kolmogorov–Arnold representation theorem, show great potential in modeling long-range dependencies. In this paper, we further investigate the potential of KAN for hyperspectral image restoration. Specifically, we propose a spatial-spectral attention block (SSAB) module, which includes a KAN-based spatial attention module (KAN-SpaAB) and a KAN-based spectral attention module (KAN-SpeAB), designed for the restoration of spatial and spectral information, respectively. Experimental results demonstrate that KSSANet outperforms existing methods in both quantitative evaluation and image generation quality, achieving state-of-the-art (SOTA) performance. Our code is available at: https://***/Baisonm-Li/KSSANet.

关键词： Measurement Visualization Image synthesis Superresolution Imaging Image restoration Speech processing Spatial resolution Signal resolution Hyperspectral imaging

来源：评论

学校读者我要写书评

暂无评论

Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport

arXiv

引用

arXiv 2025年

作者： Liu, Yonghao Giunchiglia, Fausto Li, Ximing Huang, Lan Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education China

Graph few-shot learning has garnered significant attention for its ability to rapidly adapt to downstream tasks with limited labeled data, sparking considerable interest among researchers. Recent advancements in graph few-shot learning models have exhibited superior performance across diverse applications. Despite their successes, several limitations still exist. First, existing models in the meta-training phase predominantly focus on instance-level features within tasks, neglecting crucial set-level features essential for distinguishing between different categories. Second, these models often utilize query sets directly on classifiers trained with support sets containing only a few labeled examples, overlooking potential distribution shifts between these sets and leading to suboptimal performance. Finally, previous models typically require necessitate abundant labeled data from base classes to extract transferable knowledge, which is typically infeasible in real-world scenarios. To address these issues, we propose a novel model named STAR, which leverages Set funcTions and optimAl tRansport for enhancing unsupervised graph few-shot learning. Specifically, STAR utilizes expressive set functions to obtain set-level features in an unsupervised manner and employs optimal transport principles to align the distributions of support and query sets, thereby mitigating distribution shift effects. Theoretical analysis demonstrates that STAR can capture more task-relevant information and enhance generalization capabilities. Empirically, extensive experiments across multiple datasets validate the effectiveness of STAR. Our code can be found here. Copyright © 2025, The Authors. All rights reserved.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Deep Feature-Based Text Clustering and Its Explanation 39

Deep Feature-Based Text Clustering and Its Explanation

引用

39th IEEE International Conference on Data engineering, ICDE 2023

作者： Guan, Renchu Zhang, Hao Liang, Yanchun Giunchiglia, Fausto Huang, Lan Feng, Xiaoyue Jilin University Key Laboratory for Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Changchun China University of Trento Disi Trento Italy

ISBN: (纸本)9798350322279

Text clustering is a critical step in text data analysis and has been extensively studied by the text mining community. Most existing text clustering algorithms are based on the bag-of-words model, which faces the high-dimensional and sparsity problems and ignores text structural and sequence information. Deep learning-based models such as convolutional neural networks and recurrent neural networks regard texts as sequences but lack supervised signals and explainable results. In this paper, we propose a deep feature-based text clustering (DFTC) framework that incorporates pretrained text encoders into text clustering tasks. This model, which is based on sequence representations, breaks the dependency on supervision. The experimental results show that our model outperforms classic text clustering algorithms on almost all the considered datasets. In addition, the explanation of the clustering results is significant for understanding the principles of the deep learning approach. Our proposed clustering framework includes an explanation module that can help users understand the meaning and quality of the clustering results. Our code is available at https://***/KEAML-JLU/DeepTextClustering. © 2023 IEEE.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Joint-Motion Mutual Learning for Pose Estimation in Video 24

Joint-Motion Mutual Learning for Pose Estimation in Video

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Wu, Sifan Chen, Haipeng Yin, Yifang Hu, Sihao Feng, Runyang Jiao, Yingying Yang, Ziqi Liu, Zhenguang College of Computer Science and Technology Jilin University Changchun China A STAR Singapore Singapore Georgia Institute of Technology AtlantaGA United States School of Artificial Intelligence Jilin University Changchun China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Institute of Blockchain and Data Security Hangzhou China

ISBN: (纸本)9798400706868

Human pose estimation in videos has long been a compelling yet challenging task within the realm of computer vision. Nevertheless, this task remains difficult because of the complex video scenes, such as video defocus and self-occlusion. Recent methods strive to integrate multi-frame visual features generated by a backbone network for pose estimation. However, they often ignore the useful joint information encoded in the initial heatmap, which is a by-product of the backbone generation. Comparatively, methods that attempt to refine the initial heatmap fail to consider any spatio-temporal motion features. As a result, the performance of existing methods for pose estimation falls short due to the lack of ability to leverage both local joint (heatmap) information and global motion (feature) dynamics. To address this problem, we propose a novel joint-motion mutual learning framework for pose estimation, which effectively concentrates on both local joint dependency and global pixel-level motion dynamics. Specifically, we introduce a context-aware joint learner that adaptively leverages initial heatmaps and motion flow to retrieve robust local joint feature. Given that local joint feature and global motion flow are complementary, we further propose a progressive joint-motion mutual learning that synergistically exchanges information and interactively learns between joint feature and motion flow to improve the capability of the model. More importantly, to capture more diverse joint and motion cues, we theoretically analyze and propose an information orthogonality objective to avoid learning redundant information from multi-cues. Empirical experiments show our method outperforms prior arts on three challenging benchmarks. © 2024 ACM.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

Verifying Diagnosability of Discrete Event System with Logical Formula

引用

Chinese Journal of Electronics 2020年第2期29卷 304-311页

作者： GENG Xuena OUYANG Dantong HAN Cheng College of Computer Science and Technology Changchun University of Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education Jilin University

Diagnosability is an important property in the field of fault diagnosis. In this paper, a novel approach based on logical formula is proposed to verify diagnosability of Discrete event systems(DESs). CNFFSM is defined to represent a new model for DES. Each transition in DES can be described as a clause. According to CNF-FSM, we construct a CNF-diagnoser. Based on the resolution principle and CNF-diagnoser, an algorithm is presented to test whether the failure events can be detected or not in a finite number of observable *** algorithm can be applied in both off-line diagnosis and on-line diagnosis. Experimental results show that our algorithm can solve the diagnosability problem efficiently.

关键词： Fault diagnosis Diagnosability Discrete event system Finite state machine Conjunctive normal form

来源：评论

学校读者我要写书评

暂无评论

Computing PUR of Zero-Dimensional Ideals of Breadth at Most One

引用

Journal of Systems Science & Complexity 2021年第6期34卷 2396-2409页

作者： PAN Jian SHANG Baoxin LI Zhe ZHANG Shugong School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering(Ministry of Education)Jilin UniversityChangchun 130012China College of Science Northeast Electric Power UniversityJilin 132012China School of Science Changchun University of Science and TechnologyChangchun 130022China

In this paper,for a zero-dimensional polynomial ideal I,the authors prove that k[x_(1),x_(2),…,x_(n)]/I is cyclic if and only if the breadth of I is 0 or ***,the authors present a new algorithm to compute polynomial ... 详细信息

关键词： Cyclic basis Grobner basis polynomial univariate representation separating element

来源：评论

学校读者我要写书评

暂无评论

Dual-level Mixup for Graph Few-shot Learning with Fewer Tasks

arXiv

引用

arXiv 2025年

作者： Liu, Yonghao Li, Mengyu Giunchiglia, Fausto Huang, Lan Li, Ximing Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education China

Graph neural networks have been demonstrated as a powerful paradigm for effectively learning graph-structured data on the web and mining content from it. Current leading graph models require a large number of labeled samples for training, which unavoidably leads to overfitting in few-shot scenarios. Recent research has sought to alleviate this issue by simultaneously leveraging graph learning and meta-learning paradigms. However, these graph meta-learning models assume the availability of numerous meta-training tasks to learn transferable meta-knowledge. Such assumption may not be feasible in the real world due to the difficulty of constructing tasks and the substantial costs involved. Therefore, we propose a SiMple yet effectIve approach for graph few-shot Learning with fEwer tasks, named SMILE. We introduce a dual-level mixup strategy, encompassing both within-task and across-task mixup, to simultaneously enrich the available nodes and tasks in meta-learning. Moreover, we explicitly leverage the prior information provided by the node degrees in the graph to encode expressive node representations. Theoretically, we demonstrate that SMILE can enhance the model generalization ability. Empirically, SMILE consistently outperforms other competitive models by a large margin across all evaluated datasets with in-domain and cross-domain settings. Our anonymous code can be found here. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

SSRMamba: Efficient Visual State Space Model for Spectral Super-Resolution

SSRMamba: Efficient Visual State Space Model for Spectral Su...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Spectral super-resolution, which reconstructs hyperspectral images (HSI) from a single RGB image, has garnered increasing attention. Due to the limitations of CNN structures in spectral modeling and the high computational cost of Transformer structures, existing deep learning (DL)-based methods struggle to balance spectral reconstruction quality and computational efficiency. Recently, Mamba methods base on state-space models (SSM) show great potential in modeling long-range dependencies with linear complexity. Therefore, we introduce the Mamba model into spectral super-resolution (SSR) task. Specifically, we propose a three-stage SSR network base on Mamba, called SSRMamba. We design SpaMamba, SSMamba, and SpeMamba modules for shallow spatial information extraction, mixed information encoding, and spectral information reconstruction, respectively. Extensive experimental results demonstrate that SSRMamba not only surpasses existing methods in terms of quantification and quality, achieving state-of-the-art (SOTA) performance, but also significantly reduces model size and computational cost. The source code of SSRMamba is available at: https://***/Baisonm-Li/SSRMamba.

关键词： Visualization computational modeling Superresolution Information retrieval Transformers computational efficiency State-space methods Speech processing Image reconstruction Hyperspectral imaging

来源：评论

学校读者我要写书评

暂无评论

Nucleus Detection Based on Adversarial Domain Adaptation with Cross-Domain Consistency

Nucleus Detection Based on Adversarial Domain Adaptation wit...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Shuyu Guo Lan Huang Lang Li Tian Bai College of Computer Science and Technology (of Jilin University) Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education (of Jilin University) Changchun China

Automatic cell/nucleus detection is a prerequisite for various quantitative analyses on microscopy image. However, previous deep learning methods require enough annotated microscopy images for better performance, which is a great challenge for microscopy image due to limited annotation and high cost. This paper proposes an end-to-end adversarial learning model with unsupervised domain adaptation for cell/nucleus detection. Different staining microscopy images transformation and cell/nucleus detection are merged into one end-to-end model to achieve mutual restriction of accuracy. Furthermore, a cross-domain consistency loss is introduced, which can refine the results of image transformation and localize cells synchronously. The experiments conclude that proposed method achieves the best F1 scores compared with other methods on cell/nucleus detection of different staining microscopy images. Moreover, ablation study also approves the effectiveness of cross-domain consistency loss.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：