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

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

来源：评论

学校读者我要写书评

暂无评论

Elastic Plate-Coupled Dual FBG Configuration Enabling High-Sensitivity Fiber-Optic Accelerometer with Wide Frequency Range

引用

IEEE Sensors Journal 2025年第10期25卷 17085-17093页

作者： Cao, Xiaoliang Liu, Chang Liu, Ziqi Lu, Chao Li, Zhaohui Liu, Zhengyong Sun Yat-sen University School of Electronics and Information Technology Guangdong Provincial Key Laboratory of Optoelectronic Information Processing Chips and Systems Guangzhou510006 China Department of Electrical and Electronic Engineering The Hong Kong Polytechnic University Hung Hom Hong Kong Zhuhai519082 China

Vibration sensing plays a pivotal role in structural health monitoring of civil infrastructures. This paper presents a novel Fiber Bragg Grating (FBG) based accelerometer employing an elastic plate-coupled dual-FBG configuration, designed to achieve high sensitivity (56.5 pm/G) and broadband operation (30-800 Hz) while inherently suppressing temperature crosstalk. By placing a mass between two cascaded FBGs, the two gratings experience tensile and compressive strain individually during vibration, which enhances the sensitivity for a given acceleration and eliminates the temperature effect simultaneously. A theoretical model based on the geometrical design of the accelerometer is deduced and simulated based on finite element analysis (FEA) to achieve optimal parameters. A parametric finite element model integrating modal analysis and amplitude-frequency response simulations guides the optimization of resonant frequency (1262 Hz calculated vs. 1200 Hz experimental) and strain distribution. Experimental validation demonstrates © 2001-2012 IEEE.

关键词： Fiber Bragg gratings

来源：评论

学校读者我要写书评

暂无评论

Delay-Aware Digital Twin Synchronization in Mobile Edge Networks With Semantic Communications

引用

IEEE Transactions on Vehicular technology 2025年

作者： Li, Bin Cai, Haichen Liu, Lei Fei, Zesong Nanjing University of Information Science and Technology School of Computer Science Nanjing210044 China Ministry of Education Guilin University of Electronic Technology Key Laboratory of Cognitive Radio and Information Processing Guilin541004 China Xidian University Guangzhou Institute of Technology Guangzhou510555 China Beijing Institute of Technology School of Information and Electronics Beijing100081 China

The synchronization of digital twins (DT) serves as the cornerstone for effective operation of the DT framework. However, the limitations of channel capacity can greatly affect the data transmission efficiency of wireless communication. Unlike traditional communication methods, semantic communication transmits the intended meanings of physical objects instead of raw data, effectively saving bandwidth resource and reducing DT synchronization latency. Hence, we are committed to integrating semantic communication into the DT synchronization framework within the mobile edge computing system, aiming to enhance the DT synchronization efficiency of user devices (UDs). Our goal is to minimize the average DT synchronization latency of all UDs by jointly optimizing the synchronization strategy, transmission power of UDs, and computational resource allocation for both UDs and base station. The formulated problem involves sequential decision-making across multiple coherent time slots. Furthermore, the mobility of UDs introduces uncertainties into the decision-making process. To solve this challenging optimization problem efficiently, we propose a soft actor-critic-based deep reinforcement learning algorithm to optimize synchronization strategy and resource allocation. Numerical results demonstrate that our proposed algorithm can reduce synchronization latency by up to 13.2% and improve synchronization efficiency compared to other benchmark schemes. © 1967-2012 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

A survey of distributed algorithms for aggregative games

引用

IEEE/CAA Journal of Automatica Sinica 2025年第5期12卷 859-871页

作者： Li, Huaqing Li, Jun Ran, Liang Zheng, Lifeng Huang, Tingwen Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing The College of Electronic and Information Engineering Southwest University Chongqing400715 China College of Computer Science and Engineering Chongqing University of Technology Chongqing400054 China School of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518107 China

Game theory-based models and design tools have gained substantial prominence for controlling and optimizing behavior within distributed engineering systems due to the inherent distribution of decisions among individuals. In non-cooperative settings, aggregative games serve as a mathematical framework model for the interdependent optimal decision-making problem among a group of non-cooperative players. In such scenarios, each player's decision is influenced by an aggregation of all players' decisions. Nash equilibrium (NE) seeking in aggregative games has emerged as a vibrant topic driven by applications that harness the aggregation property. This paper presents a comprehensive overview of the current research on aggregative games with a focus on communication topology. A systematic classification is conducted on distributed algorithm research based on communication topologies such as undirected networks, directed networks, and time-varying networks. Furthermore, it sorts out the challenges and compares the algorithms' convergence performance. It also delves into real-world applications of distributed optimization techniques grounded in aggregative games. Finally, it proposes several challenges that can guide future research directions. © 2025 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Homophily Induced Contrastive Attributed Graph Clustering

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Chen, Man-Sheng Lai, Pei-Yuan Liao, De-Zhang Wang, Chang-Dong Lai, Jian-Huang Sun Yat-sen University School of Computer Science and Engineering Guangzhou China Guangxi Zhuang Autonomous Region Information Center Guangxi Key Laboratory of Digital Infrastructure Nanning China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China South China Technology Commercialization Center Guangzhou China Guangdong Key Laboratory of Information Security Technology Guangzhou China

Attributed graph clustering, aiming to discover the underlying graph structure and partition the graph nodes into several disjoint categories, is a basic task in graph data analysis. Although recent efforts over graph contrastive clustering have achieved decent performances, most of them get accustomed to construct the positive neighbor set by the generated pseudo clustering information, directly ignoring the ready-made neighbor nodes and the underlying semantics of edges in a graph. How to well deal with the graph neighbor-specific information to facilitate the performance of graph contrastive clustering is still a challenging problem. Therefore, in this work, we propose a novel Homophily Induced Contrastive Attributed Graph Clustering (HomoCAGC) method, where the power of homophily is exploited in facilitating the performance of contrastive attributed graph clustering, while the pseudo homophily in a graph is also explored and distinguished. Especially, the node feature as reliable information guidance is used to compute the underlying feature-oriented pair-wise node similarity, based on which the positive node pairs in contrastive regularizer are adjusted for better node representation characterization. According to the refined node representations, a triplet self-supervised clustering objective is well-designed to ensure the output embedding is cluster-oriented, and suitable for the downstream clustering task. Extensive experiments on seven benchmarks are conducted to demonstrate the effectiveness of HomoCAGC. © 1991-2012 IEEE.

关键词： Attributed graph clustering contrastive learning graph homophily self-supervised clustering

来源：评论

学校读者我要写书评

暂无评论

NOMA Assisted Semi-Grant-Free Transmission for UAV Networks: A Multi-User Scheduling Approach

引用

IEEE Transactions on Communications 2025年

作者： Huang, Junlin Lu, Huabing Tang, Jie Zhao, Nan Shi, Zhaoyuan Wang, Xianbin Dalian University of Technology School of Information and Communication Engineering Dalian116024 China Nanchang University School of Information Engineering Jiangxi Provincial Key Laboratory of Advanced Signal Processing and Intelligent Communications Nanchang330031 China South China University of Technology School of Electronic and Information Engineering Guangzhou510640 China Anqing Normal University School of Computer and Information Anqing246052 China Western University Department of Electrical and Computer Engineering LondonN6A 5B9 Canada

Non-orthogonal multiple access (NOMA) assisted semi-grant-free (SGF) transmission, which enables grant-based users to share their spectrum with grant-free (GF) users, becomes an effective solution to the challenge of massive connections. However, this improvement is limited as most of the existing schemes can only admit one GF user. In this paper, we propose a novel NOMA-assisted SGF transmission scheme to support the access of multiple GF users in unmanned aerial vehicle networks. Moreover, in order to further enhance the advantages of the multi-user SGF scheme, two SGF schemes with power matching are devised to further improve the performance by employing the benefits of distributed contention. For ease of performance evaluation, the theoretical expressions of achievable sum rate and average age of information of the three SGF schemes are derived by applying order statistics. We also investigate the high signal-to- noise approximation expressions of sum rate for these schemes to give more insight. Finally, simulation results are provided to demonstrate the performance improvement of three proposed SGF schemes and validate the correctness of the theoretical analysis expressions. © 1972-2012 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Stable Extended U-Net for Noise-Robust Speaker Verification

Stable Extended U-Net for Noise-Robust Speaker Verification

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal processing, ICASSP 2025

作者： Wang, Zonghui Fang, Zhihua He, Liang School of Computer Science and Technology Xinjiang University Urumqi830017 China School of Intelligence Science and Technology Xinjiang University Urumqi830017 China Xinjiang Key Laboratory of Signal Detection and Processing Urumqi830017 China Department of Electronic Engineering Tsinghua University Beijing100084 China Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China

ISBN: (纸本)9798350368741

With advancements in deep learning, speaker verification systems have significantly improved their performance in noisy environments. Researchers typically demonstrate the effectiveness of their improved models by comparing performance on specific datasets, such as the VoxCeleb benchmark. However, in diverse real-world noise conditions, the out-of-domain generalization ability is also a crucial factor in evaluating a model's performance improvement. Research on stable learning indicates that eliminating the spurious correlation between training and testing data can enhance the generalization of the model. Building on this idea, we propose an improved speaker verification system with high generalization based on the extended U-Net (ExU-Net). It uses the sample reweighting method from stable learning to eliminate sample correlations and retains more effective speaker information through sub-pixel convolutions and coordinate attention mechanisms. We validate the effectiveness of this approach through extensive evaluations on VoxCeleb1, VOiCES, and other out-of-domain noise test sets, highlighting its generalization capability and model robustness. © 2025 IEEE.

关键词： noisy environments out-of-domain generalization Speaker verification stable learning

来源：评论

学校读者我要写书评

暂无评论

CTNet: A Convolutional Transformer Network for Color Image Steganalysis

引用

Journal of computer Science and technology 2025年第2期40卷 413-427页

作者： Wei, Kang-Kang Luo, Wei-Qi Tan, Shun-Quan Huang, Ji-Wu School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Information Security Technology Sun Yat-sen University Guangzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

Compared with convolutional neural network (CNN), Transformer can obtain global receptive field features more effectively and has recently achieved great success in natural language processing and computer vision. Due to the particularity of steganography, however, almost all existing steganalytic networks just employ CNN with local receptive fields to detect embedding artifacts. In this paper, we propose a novel convolutional Transformer network for color image steganalysis. Specifically, we firstly obtain various image residuals for each color channel of an input image in the pre-processing module. To capture more comprehensive steganalytic features, the truncated residuals after channel concatenation will pass through a feature extraction module composed of a CNN group and a Transformer group. The CNN group aims to extract local receptive fields features, while the Transformer group with multi-head self-attention as the key tries to extract global steganalytic features. Finally, we employ a global covariance pooling (GCP) and two fully-connected (FC) layers with dropout for classification. Extensive comparative experiments demonstrate that the proposed method can significantly improve the detection performances in color image steganalysis and achieve state-of-the-art results. Although the proposed method is originally designed for color images, it can also obtain competitive results for grayscale images compared with the current best detector. In addition, we provide numerous ablation studies to verify the rationality of the proposed network architecture.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Fence Theorem: Towards Dual-Objective Semantic-Structure Isolation in Preprocessing Phase for 3D Anomaly Detection

arXiv

引用

arXiv 2025年

作者： Liang, Hanzhe Zhou, Jie Chen, Xuanxin Dai, Tao Wang, Jinbao Gao, Can College of Computer Science and Software Engineering Shenzhen University China Shenzhen Audencia Financial Technology Institute Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Faculty of Education Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

3D anomaly detection (AD) is prominent but difficult due to lacking a unified theoretical foundation for preprocessing design. We establish the Fence Theorem, formalizing preprocessing as a dual-objective semantic isolator: (1) mitigating cross-semantic interference to the greatest extent feasible and (2) confining anomaly judgements to aligned semantic spaces wherever viable, thereby establishing intra-semantic comparability. Any preprocessing approach achieves this goal through a two-stage process of Semantic-Division and Spatial-Constraints stage. Through systematic deconstruction, we theoretically and experimentally subsume existing preprocessing methods under this theorem via tripartite evidence: qualitative analyses, quantitative studies, and mathematical proofs. Guided by the Fence Theorem, we implement Patch3D, consisting of Patch-Cutting and Patch-Matching modules, to segment semantic spaces and consolidate similar ones while independently modeling normal features within each space. Experiments on Anomaly-ShapeNet and Real3D-AD with different settings demonstrate that progressively finer-grained semantic alignment in preprocessing directly enhances point-level AD accuracy, providing inverse validation of the theorem’s causal logic. Copyright © 2025, The Authors. All rights reserved.

关键词： Fences

来源：评论

学校读者我要写书评

暂无评论

Benchmarking Graph Representations and Graph Neural Networks for Multivariate Time Series Classification

arXiv

引用

arXiv 2025年

作者： Yang, Wennuo Wu, Shiling Zhou, Yuzhi Luo, Cheng He, Xilin Xie, Weicheng Shen, Linlin Song, Siyang Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China Guangdong Provincial Key Laboratory of Intelligent Information Processing China HBUG Lab University of Exeter United Kingdom

Multivariate Time Series Classification (MTSC) enables the analysis if complex temporal data, and thus serves as a cornerstone in various real-world applications, ranging from healthcare to finance. Since the relationship among variables in MTS usually contain crucial cues, a large number of graph-based MTSC approaches have been proposed, as the graph topology and edges can explicitly represent relationships among variables (channels), where not only various MTS graph representation learning strategies but also different Graph Neural Networks (GNNs) have been explored. Despite such progresses, there is no comprehensive study that fairly benchmarks and investigates the performances of existing widely-used graph representation learning strategies/GNN classifiers in the application of different MTSC tasks. In this paper, we present the first benchmark which systematically investigates the effectiveness of the widely-used three node feature definition strategies, four edge feature learning strategies and five GNN architecture, resulting in 60 different variants for graph-based MTSC. These variants are developed and evaluated with a standardized data pipeline and training/validation/testing strategy on 26 widely-used suspensor MTSC datasets. Our experiments highlight that node features significantly influence MTSC performance, while the visualization of edge features illustrates why adaptive edge learning outperforms other edge feature learning methods. The code of the proposed benchmark is publicly available at https://***/CVI-yangwn/*** Codes 68T10 © 2025, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：