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

Online Learning Behavior Analysis and Prediction Based on Spiking Neural Networks

学校读者我要写书评

暂无评论

Journal of Social computing 2024年第2期5卷 180-193页

作者： Yanjing Li Xiaowei Wang Fukun Chen Bingxu Zhao Qiang Fu the Institute of Education Science Research Heilongjiang UniversityHarbin 150080China the School of Cyberspace Security Shandong University of Political Science and LawJinan 250014China the School of Computer Science and Technology Harbin Engineering UniversityHarbin 150001China the Faculty of Electrical and Computer Engineering University of VictoriaVictoriaV8P 5C2Canada. the Guangxi Key Lab of Brain-Inspired Computing and Intelligent Chips School of Electronic and Information EngineeringGuangxi Normal UniversityGuilin 541004China

The vast amount of data generated by large-scale open online course platforms provide a solid foundation for the analysis of learning behavior in the field of *** study utilizes the historical and final learning behavior data of over 300000 learners from 17 courses offered on the edX platform by Harvard University and the Massachusetts institute of technology during the 2012-2013 academic *** have developed a spike neural network to predict learning outcomes,and analyzed the correlation between learning behavior and outcomes,aiming to identify key learning behaviors that significantly impact these *** goal is to monitor learning progress,provide targeted references for evaluating and improving learning effectiveness,and implement intervention measures *** results demonstrate that the prediction model based on online learning behavior using spiking neural network achieves an impressive accuracy of 99.80%.The learning behaviors that predominantly affect learning effectiveness are found to be students’academic performance and level of participation.

关键词： online learning learning outcomes prediction learning behavior analysis spiking neural network

An Encoder-Decoder Model Based On Spiking Neural Networks For Address Event Representation Object Recognition

学校读者我要写书评

暂无评论

IEEE Transactions on Cognitive and Developmental Systems 2025年

作者： Du, Sichun Zhu, Haodi Zhang, Yang Hong, Qinghui Hunan University College of Computer Science and Electronic Engineering Changsha418002 China Shenzhen University Computer Vision Institute School of Computer Science and Software Engineering National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China

Address event representation (AER) object recognition task has attracted extensive attention in neuromorphic vision processing. The spike-based and event-driven computation inherent in the spiking neural network (SNN) provides an energy-saving solution for AER object recognition. However, SNN with spike timing dependent plasticity (STDP) learning rule has not achieved satisfying AER object recognition performance. This work proposes an SNN-based encoder-decoder model to improve the recognition performance of AER objects. An STDP-based locally connected spiking neural network (LC-SNN) is proposed as an encoder to extract rich spatiotemporal features from AER event flows more flexibly. After the encoder extracts and learns primary features, we propose a fully connected spiking neural network (FC-SNN) based on the reward-modulated spike-timing-dependent plasticity (R-STDP) learning rule as a decoder to learn higher-level features for classification. In addition, we improved the winner-take-all (WTA) mechanisms and R-STDP learning rule in the decoder based on the reward and punish decision, enabling the network to perform better. The experiments are performed on the N-MNIST, MNIST-DVS, and the DVS Gesture datasets, improving the accuracy of the best existing plasticity-based SNN by 0.19%, 0.27% and 1.35%, respectively. © 2016 IEEE.

关键词： Decoding

Remote Sensing Image Segmentation Using Vision Mamba and Multi-Scale Multi-Frequency Feature Fusion

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Cao, Yice Liu, Chenchen Wu, Zhenhua Yao, Wenxin Xiong, Liu Chen, Jie Huang, Zhixiang The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Electronics and Information Engineering Anhui University Hefei230601 China The 38th Research Institute China Electronics Technology Group Corporation Hefei230088 China

As remote sensing imaging technology continues to advance and evolve, processing high-resolution and diversified satellite imagery to improve segmentation accuracy and enhance interpretation efficiency emerg as a pivotal area of investigation within the realm of remote sensing. Although segmentation algorithms based on CNNs and Transformers achieve significant progress in performance, balancing segmentation accuracy and computational complexity remains challenging, limiting their wide application in practical tasks. To address this, this paper introduces state space model (SSM) and proposes a novel hybrid semantic segmentation network based on vision Mamba (CVMH-UNet). This method designs a cross-scanning visual state space block (CVSSBlock) that uses cross 2D scanning (CS2D) to fully capture global information from multiple directions, while by incorporating convolutional neural network branches to overcome the constraints of Vision Mamba (VMamba) in acquiring local information, this approach facilitates a comprehensive analysis of both global and local features. Furthermore, to address the issue of limited discriminative power and the difficulty in achieving detailed fusion with direct skip connections, a multi-frequency multi-scale feature fusion block (MFMSBlock) is designed. This module introduces multi-frequency information through 2D discrete cosine transform (2D DCT) to enhance information utilization and provides additional scale local detail information through point-wise convolution branches. Finally, it aggregates multi-scale information along the channel dimension, achieving refined feature fusion. Findings from experiments conducted on renowned datasets of remote sensing imagery demonstrate that proposed CVMH-UNet achieves superior segmentation performance while maintaining low computational complexity, outperforming surpassing current leading-edge segmentation algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantic Segmentation

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-...

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

作者： Kaijun Deng Dezhi Zheng Jindong Xie Jinbao Wang Weicheng Xie Linlin Shen Siyang Song Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Department of Computer Science University of Exeter

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code is availab.e at https://***/CVI-SZU/DEGSTalk.

关键词： Hair Training Three-dimensional displays Dynamics Signal processing Rendering (computer graphics) Noise measurement Speech processing Faces Videos

Scalab.e Graph Compressed Convolutions

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Junshu Wang, Shuhui Yang, Chenxue Huang, Qingming The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The Agricultural Information Institute China Academy of Agricultural Sciences Beijing100081 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China Peng Cheng Laboratory Shenzhen518066 China

Designing effective graph neural networks (GNNs) with message passing has two fundamental challenges, i.e., determining optimal message-passing pathways and designing local aggregators. Previous methods of designing optimal pathways are limited with information loss on the input features. On the other hand, existing local aggregators generally fail to extract multi-scale features and approximate diverse operators under limited parameter scales. In contrast to these methods, Euclidean convolution has been proven as an expressive aggregator, making it a perfect candidate for GNN construction. However, the challenges of generalizing Euclidean convolution to graphs arise from the irregular structure of graphs. To bridge the gap between Euclidean space and graph topology, we propose a differentiable method that applies permutations to calibrate input graphs for Euclidean convolution. The permutations constrain all nodes in a row regardless of their input order and therefore enable the flexible generalization of Euclidean convolution to graphs. Based on the graph calibration, we propose the Compressed Convolution Network (CoCN) for hierarchical graph representation learning. CoCN follows local feature-learning and global parameter-sharing mechanisms of convolution neural networks. The whole model can be trained end-to-end, with compressed convolution applied to learn individual node features and their corresponding structure features. CoCN can further borrow successful practices from Euclidean convolution, including residual connection and inception mechanism. We validate CoCN on both node-level and graph-level benchmarks. CoCN achieves superior performance over competitive GNN baselines. Codes are availab.e at https://***/sunjss/CoCN. © 2024, CC BY-NC-SA.

关键词： Graph neural networks

Exploiting Completeness and Uncertainty of Pseudo lab.ls for Weakly Supervised Video Anomaly Detection

学校读者我要写书评

暂无评论

Exploiting Completeness and Uncertainty of Pseudo Labels for...

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Chen Zhang Guorong Li Yuankai Qi Shuhui Wang Laiyun Qing Qingming Huang Ming-Hsuan Yang State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Technology University of Chinese Academy of Sciences Australian Institute for Machine Learning The University of Adelaide Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS University of California Merced

Weakly supervised video anomaly detection aims to identify abnormal events in videos using only video-level lab.ls. Recently, two-stage self-training methods have achieved significant improvements by self-generating pseudo lab.ls and self-refining anomaly scores with these lab.ls. As the pseudo lab.ls play a crucial role, we propose an enhancement framework by exploiting completeness and uncertainty properties for effective self-training. Specifically, we first design a multi-head classification module (each head serves as a classifier) with a diversity loss to maximize the distribution differences of predicted pseudo lab.ls across heads. This encourages the generated pseudo lab.ls to cover as many abnormal events as possible. We then devise an iterative uncertainty pseudo lab.l refinement strategy, which improves not only the initial pseudo lab.ls but also the updated ones obtained by the desired classifier in the second stage. Extensive experimental results demonstrate the proposed method performs favorably against state-of-the-art approaches on the UCF-Crime, TAD, and XD-Violence benchmark datasets.

关键词：

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

Uncertainty-boosted Robust Video Activity Anticipation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Qi, Zhaobo Wang, Shuhui Zhang, Weigang Huang, Qingming The School of Computer Science and Technology Harbin Institute of Technology Weihai264209 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Peng Cheng Laboratory Shenzhen518066 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China

Video activity anticipation aims to predict what will happen in the future, embracing a broad application prospect ranging from robot vision and autonomous driving. Despite the recent progress, the data uncertainty issue, reflected as the content evolution process and dynamic correlation in event lab.ls, has been somehow ignored. This reduces the model generalization ability and deep understanding on video content, leading to serious error accumulation and degraded performance. In this paper, we address the uncertainty learning problem and propose an uncertainty-boosted robust video activity anticipation framework, which generates uncertainty values to indicate the credibility of the anticipation results. The uncertainty value is used to derive a temperature parameter in the softmax function to modulate the predicted target activity distribution. To guarantee the distribution adjustment, we construct a reasonable target activity lab.l representation by incorporating the activity evolution from the temporal class correlation and the semantic relationship. Moreover, we quantify the uncertainty into relative values by comparing the uncertainty among sample pairs and their temporal-lengths. This relative strategy provides a more accessible way in uncertainty modeling than quantifying the absolute uncertainty values on the whole dataset. Experiments on multiple backbones and benchmarks show our framework achieves promising performance and better robustness/interpretability. Source codes are availab.e at https://***/qzhb/UbRV2A. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

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

学校读者我要写书评

暂无评论

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 unlab.lled 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