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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-aware Superpoint Graph Transformer for Weakly Supervised 3D Semantic Segmentation

引用

IEEE Transactions on Fuzzy Systems 2025年

作者： Fan, Yan Wang, Yu Zhu, Pengfei Hui, Le Xie, Jin Hu, Qinghua Tianjin University College of Intelligence and Computing Tianjin300350 China Ministry of Education of the People's Republic of China Engineering Research Center of City Intelligence and Digital Governance China Haihe Laboratory of Itai Tianjin China Northwestern Polytechnical University School of Electronics and Information Shaanxi Key Laboratory of Information Acquisition and Processing China Nanjing University of Science and Technology Pca Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

Weakly supervised 3D semantic segmentation has successfully mitigated the lab.r-intensive and time-consuming task of annotating 3D point clouds. However, reliably utilizing the minimal point-wise annotations for unlab.led data in complex and large-scale scenes is still challenging, such as only 20 points lab.led in 2 million points. To tackle this challenge, we propose a new Uncertainty-aware Superpoint Graph Transformer (UaSGT) framework that utilizes minimal annotations for unlab.led data learning through reliable long-range supervision propagation from lab.led superpoints to unlab.led superpoints. First, we propose a superpoint graph transformer to achieve long-range supervision propagation along the attention-based fuzzy subsets defined on superpoints. The attention-based fuzzy subset measures the membership of unlab.led superpoints to clusters centered on lab.led superpoints. Second, we employ an uncertainty-aware membership rectification technique on the fuzzy subset to ensure reliable propagation among superpoints within the same category. This technique integrates an uncertainty prediction module to mask the influence of unreliable membership and a spatial prior refinement module to reduce uncertainty in intra-class membership degrees. Finally, experimental results on two large-scale benchmarks S3DIS and ScanNet-V2 demonstrate the superiority of our approach compared to the state-of-the-art with at least 90% annotation reduction, and our method also achieves comparable performance to fully supervised methods with less than 0.1% lab.led points. Our code is availab.e at https://***/fanyan0411/UaSGT. © 2025 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Dual Encoders for Diffusion-based Image Inpainting

Dual Encoders for Diffusion-based Image Inpainting

引用

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

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

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Current diffusion-based inpainting models struggle to preserve unmasked regions or generate highly coherent content. Additionally, it is hard for them to generate meaningful content for 3D inpainting. To tackle these challenges, we design a plug-and-play branch that runs through the entire generation process to enhance existing models. Specifically, we utilize dual encoders - a Convolutional Neural Network (CNN) encoder and the pre-trained Variational AutoEncoder (VAE) encoder, to encode masked images. The latent code and the feature map from the dual encoders are fed to diffusion models simultaneously. In addition, we apply Zero-padded initialization to solve the problem of mode collapse caused by this branch. Experiments on BrushBench and EditBench demonstrate that models with our plug-and-play branch can improve the coherence of inpainting, and our model achieves new state-of-the-art results.

关键词： Visualization Three-dimensional displays Codes Autoencoders Coherence Signal processing Diffusion models Decoding Convolutional neural networks Speech processing

来源：评论

学校读者我要写书评

暂无评论

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 lab.ls 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 lab.ls in classification tasks, the problem of noisy lab.ls in deep metric learning (DML) remains under-explored. Existing noisy lab.l 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 lab.l noise datasets demonstrate the effectiveness of our proposed method. Without any bells and whistles, our SGPS framework outperforms the state-of-the-art noisy lab.l DML methods. Code is availab.e at https://***/smuelpeng/SGPS-NoiseFreeDML. © 2025, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Air Pollution Monitoring By Integrating Local and Global information in Self-Adaptive Multiscale Transform Domain

引用

IEEE Transactions on Multimedia 2025年

作者： Gu, Ke Liu, Yuchen Liu, Hongyan Liu, Bo Qiao, Junfei Lin, Weisi Zhang, Wenjun Beijing University of Technology School of Information Science and Technology Engineering Research Center of Intelligent Perception and Autonomous Control of Ministry of Education Beijing Laboratory of Smart Environmental Protection Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing Artificial Intelligence Institute Beijing100124 China Massey University School of Mathematical and Computational Sciences New Zealand Nanyang Technological University College of Computing and Data Science Singapore Shanghai Jiao Tong University Institute of Image Communication and Information Processing Shanghai China

As the deadliest form of pollution, air pollution had a prolonged severe damage to the human health and life safety of nearly 99% of the world's population. Facing to the problem that billions of tons of pollutants discharged into the air per year by industrial activities, this paper proposed a novel image-based air pollution monitor (IAPM) by incorporating local and global information in the self-adaptive multiscale transform domain, so as to achieve the timely and effective leakage detection of typical air pollutants from a single image. To be specific, this paper first developed a screen-shaped module according to two significant findings in visual neuroscience, which include the high sensitivity of human eyes to horizontal and vertical stimuli and the center-surround inhibition, by designing and fusing the square module, horizontal strip module and vertical strip module parallelly for simulating the behaviour of human eyes to extract local features. Second, the learnable weights and proportional mapping were applied to incorporate the screen-shaped module and lightweight vision transformer as backbone, towards more richly exploiting and fusing local and global information just as the way a brain perceives external stimuli. Third, a new self-adaptive multiscale transform domain method was devised based on two motivations from the visual characteristics of multiscale perception and the brain characteristics of self-adaptive domain transform to modify the backbone by using the operations of pooling and pointwise convolution. Extensive experiments implemented on the datasets of carbon particulate matters and ethylene leakage confirmed the superior monitoring performance of the proposed IAPM model beyond the state-of-the-art (SOTA) peers by an accuracy gain of about 4%. Furthermore, the proposed IAPM model only required 0.089 GFLOPs and 0.15 million model parameters, remarkably outperforming SOTA competitors in computational efficiency and storage resources. © 1999-2

关键词： information leakage

来源：评论

学校读者我要写书评

暂无评论

MS-Glance: Bio-Inspired Non-Semantic Context Vectors and Their Applications in Supervising Image Reconstruction

MS-Glance: Bio-Inspired Non-Semantic Context Vectors and The...

引用

IEEE Workshop on Applications of Computer Vision (WACV)

作者： Ziqi Gao Wendi Yang Yujia Li Lei Xing S. Kevin Zhou Division of Life Sciences and Medicine School of Biomedical Engineering University of Science and Technology of China (USTC) Hefei Anhui China Center for Medical Imaging Robotics Analytic Computing & Learning (MIRACLE) Suzhou Institute for Advance Research USTC Suzhou Jiangsu China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology China Department of Radiation Oncology Stanford University Stanford CA USA Key Laboratory of Precision and Intelligent Chemistry USTC CAS Hefei Anhui

ISBN: (数字)9798331510831

ISBN: (纸本)9798331510848

Non-semantic context information is crucial for visual recognition, as the human visual perception system first uses global statistics to process scenes rapidly before identifying specific objects. However, while semantic information is increasingly incorporated into computer vision tasks such as image reconstruction, non-semantic information, such as global spatial structures, is often overlooked. To bridge the gap, we propose a biologically informed non-semantic context descriptor, MS-Glance, along with the Glance Index Measure for comparing two images. A Global Glance vector is formulated by randomly retrieving pixels based on a perception-driven rule from an image to form a vector representing non-semantic global context, while a local Glance vector is a flattened local image window, mimicking a zoom in observation. The Glance Index is defined as the inner product of two standardized sets of Glance vectors. We evaluate the effectiveness of incorporating Glance supervision in two reconstruction tasks: image fitting with implicit neural representation (INR) and undersampled MRI reconstruction. Extensive experimental results show that MS-Glance outperforms existing image restoration losses across both natural and medical images. The code is availab.e at https://***/Z7Gao/MSGlance.

关键词： Computer vision Visualization Magnetic resonance imaging Fitting Vectors Image restoration Indexes Image reconstruction Biomedical imaging Visual perception

来源：评论

学校读者我要写书评

暂无评论

NavG: Risk-Aware Navigation in Crowded Environments Based on Reinforcement Learning with Guidance Points

arXiv

引用

arXiv 2025年

作者： Zhang, Qianyi Luo, Wentao Liu, Boyi Zhang, Ziyang Wang, Yaoyuan Liu, Jingtai Institute of Robotics and Automatic Information System Nankai University Tianjin Key Laboratory of Intelligent Robotics Tianjin China Advanced Computing and Storage Lab Huawei 2012 Lab China Department of Electronic and Computer Engineering The Kong Kong University of Science and Technology Hong Kong

Motion planning in navigation systems is highly susceptible to upstream perceptual errors, particularly in human detection and tracking. To mitigate this issue, the concept of guidance points—a novel directional cue within a reinforcement learning-based framework—is introduced. A structured method for identifying guidance points is developed, consisting of obstacle boundary extraction, potential guidance point detection, and redundancy elimination. To integrate guidance points into the navigation pipeline, a perception-to-planning mapping strategy is proposed, unifying guidance points with other perceptual inputs and enabling the RL agent to effectively leverage the complementary relationships among raw laser data, human detection and tracking, and guidance points. Qualitative and quantitative simulations demonstrate that the proposed approach achieves the highest success rate and near-optimal travel times, greatly improving both safety and efficiency. Furthermore, real-world experiments in dynamic corridors and lobbies validate the robot’s ability to confidently navigate around obstacles and robustly avoid pedestrians. © 2025, CC BY.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

Rate-Splitting Multiple Access Enabled Green Probabilistic Semantic Communication over Wireless Networks

IEEE Transactions on Green Communications and Networking

引用

IEEE Transactions on Green Communications and Networking 2025年

作者： Xu, Ruopeng Yang, Zhaohui Mao, Yijie Huang, Chongwen Yang, Qianqian Xu, Lexi Xu, Wei Zhang, Zhaoyang Zhejiang University College of Information Science and Electronic Engineering China Hangzhou310027 China ShanghaiTech University School of Information Science and Technology Shanghai201210 China Zhejiang Prov. Key Lab. of Multi-Modal Communication Networks and Intelligent Information Processing Hangzhou310027 China China United Network Communications Corporation Research Institute Beijing100048 China Southeast University National Mobile Communications Research Laboratory Nanjing211189 China

In this paper, we propose a multi-user green probabilistic semantic communication (PSC) system for semantic communication (SemCom) facilitated by probabilistic knowledge graphs (PKGs), which are knowledge graphs (KGs) integrated with probability to represent semantic information. In the considered model, semantic information of different users is represented by PKGs. On this basis, we design a semantic compression model for multi-user downlink task-oriented SemCom, utilizing the semantic compression ratio (SCR) as a parameter to connect the computation and communication processes of information transmission. Utilizing rate-splitting multiple access (RSMA) technology, the transmitted messages are splitted into shared and private ones. Considering the limited wireless resources and constraint in semantic communication, an optimization problem with the goal of minimizing system energy consumption comprehensively considering the computation and communication process is formulated. In order to address the optimization problem, we propose an alternating optimization algorithm that tackles sub-problems of power allocation and beamforming design with successive convex approximation (SCA) method, semantic compression ratio optimization with variable substitution method, and computation capacity allocation with obtaining closed-form optimal solution. Simulation results verify the effectiveness of the proposed algorithm. © 2017 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：