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

arXiv 2025年

作者： Hu, Yuxue Li, Junsong Chen, Meixuan Su, Dongyu Wang, Tongguan Sha, Ying College of Informatics Huazhong Agricultural University Wuhan China Key Laboratory of Smart Farming for Agricultural Animals Wuhan China Hubei Engineering Technology Research Center of Agricultural Big Data Wuhan China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education China

Euphemism identification deciphers the true meaning of euphemisms, such as linking "weed" (euphemism) to "marijuana" (target keyword) in illicit texts, aiding content moderation and combating underground markets. While existing methods are primarily text-based, the rise of social media highlights the need for multimodal analysis, incorporating text, images, and audio. However, the lack of multimodal datasets for euphemisms limits further research. To address this, we regard euphemisms and their corresponding target keywords as keywords and first introduce a keyword-oriented multimodal corpus of euphemisms (KOM-Euph), involving three datasets (Drug, Weapon, and Sexuality), including text, images, and speech. We further propose a keyword-oriented multimodal euphemism identification method (KOM-EI), which uses cross-modal feature alignment and dynamic fusion modules to explicitly utilize the visual and audio features of the keywords for efficient euphemism identification. Extensive experiments demonstrate that KOM-EI outperforms state-of-the-art models and large language models, and show the importance of our multimodal datasets 1 Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semantic and Emotional Dual Channel for Emotion Recognition in Conversation

引用

IEEE Transactions on Affective Computing 2025年

作者： Yang, Zhenyu Zhang, Zhibo Cheng, Yuhu Zhang, Tong Wang, Xuesong Jinan250353 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China China University of Mining and Technology Engineering Research Center of Intelligent Control for Underground Space Ministry of Education Xuzhou Key Laboratory of Artificial Intelligence and Big Data School of Information and Control Engineering Xuzhou221116 China South China University of Technology Guangdong Provincial Key Laboratory of Computational Intelligence and Cyberspace Information School of Computer Science and Engineering Guangzhou510006 China Pazhou Lab Guangzhou510335 China Engineering Research Center Ministry of Education on Health Intelligent Perception and Paralleled Digital-Human Guangzhou China

Emotion recognition in conversation (ERC) aims at accurately identifying emotional states expressed in conversational content. Existing ERC methods, although relying on semantic understanding, often encounter challenges when confronted with incomplete or misleading semantic information. In addition, when dealing with the interaction between emotional and semantic information, existing methods are often difficult to effectively distinguish the complex relationship between the two, which affects the accuracy of emotion recognition. To address the problems of semantic misdirection and emotional cross-talk encountered by traditional models when confronted with complex conversational data, we propose a semantic and emotional dual channel (SEDC) strategy for emotion recognition in conversations to process emotional and semantic information independently. Under this strategy, emotion information provides an auxiliary recognition function when the semantics are unclear or lacking, enhancing the accuracy of the model. Our model consists of two modules: the emotion processing module accurately captures the emotional features of each utterance through contrastive learning, and then constructs a dialogue emotion propagation map to simulate the emotional information conveyed in the dialogue;the semantic processing module combines an external knowledge base to enhance the semantic expression of the dialogue through knowledge enhancement strategies. This divide-and-conquer approach allows us to more deeply analyze the emotional and semantic dimensions of complex dialogues. Experimental results on the IEMOCAP, EmoryNLP, MELD, and DailyDialog datasets show that our approach significantly outperforms existing techniques and effectively improves the accuracy of dialogue emotion recognition. Our code is available at https://***/r/SEDC-FCF1. © 2010-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Using Depth-Enhanced Spatial Transformation for Student Gaze Target Estimation in Dual-View Classroom Images

Using Depth-Enhanced Spatial Transformation for Student Gaze...

引用

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

作者： Haonan Miao Peizheng Zhao Yuqi Sun Fang Nan Xiaolong Zhang Yaqiang Wu Feng Tian School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an China School of Advanced Technology Xi’an Jiaotong-Liverpool University Suzhou China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Dual-view gaze target estimation in classroom environments has not been thoroughly explored. Existing methods lack consideration of depth information, primarily focusing on 2D image information and neglecting the latent 3D spatial context, which could lead to suboptimal transformation and cause the gaze cone to intersect with an incorrect object. This paper introduces a novel dual-view gaze target estimation method tailored for classroom settings, leveraging depth-enhanced spatial transformations. By formulating a depth-enhanced 2D space, our method uses depth-enhanced spatial transformation to accurately project students’ gaze cones to the teacher-oriented image. Additionally, we collected a dataset named DVSGE, specifically for student gaze target estimation in dual-view classroom images. Experimental results demonstrate significant performance improvements of 9.8% in AUC and 19.9% in L2-Distance for our method, surpassing existing methods.

关键词： Three-dimensional displays Estimation Focusing Signal processing Acoustics Speech processing

来源：评论

学校读者我要写书评

暂无评论

Collision-Aware MPCC Integrated with Neural Augmentation for Quadrotor Trajectory Tracking

Collision-Aware MPCC Integrated with Neural Augmentation for...

引用

International Conference on Mechatronics (ICM)

作者： Chuanqi Hu Jin Wang Yikai Chen Yonghang Chen Zhi Zheng Jun Meng Guodong Lu Polytechnic Institute Zhejiang University Hangzhou China State Key Laboratory of Fluid Power and Mechatronic Systems Zhejiang University Hangzhou China Zhejiang Key Laboratory of Industrial Big Data and Robot Intelligent Systems Zhejiang University Hangzhou China Robotics Research Center of Yuyao City Ningbo China School of Mechanical Engineering Zhejiang University Hangzhou China National Elite Institute of Engineering Chongqing University Chongqing China College of Electrical Engineering Zhejiang University Hangzhou China Center for Data Mining and Systems Biology College of Electrical Engineering Zhejiang University Hangzhou China

ISBN: (数字)9798331533892

ISBN: (纸本)9798331533908

This paper presents a trajectory tracking algorithm designed for autonomous quadrotors to navigate complex dy-namic environments that is resilient to collision disturbances. Since it combines Model Predictive Contouring Control (MPCC) with the capabilities of neural networks, our method is named MPCC Integrated with Neural Augmentation (MINA). By equip-ping the quadrotor with PVDF piezoelectric sensors, we achieve real-time perception of collision forces and utilize S4D-Conv Adaptive Net Architecture (SANA) for state computation, a network that integrates the advantages of S4D and convolutional kernels to enhance the accuracy of state predictions. We incorporate the predicted results into the MPCC framework to optimize the thrust output of the quadrotor for the next time step, ensuring precise trajectory tracking. Experimental validation demonstrates the reliability and effectiveness of our algorithm, providing an innovative solution for autonomous flight and trajectory tracking of quadrotors in complex dynamic environments.

关键词： Trajectory tracking Navigation Heuristic algorithms Neural networks Reliability theory Predictive models Prediction algorithms Real-time systems Sensors Quadrotors

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature selection with evolutionary sparsity

引用

NEURAL NETWORKS 2025年 189卷 107512页

作者： Zhou, Shixuan Xiang, Yi Huang, Han Huang, Pei Peng, Chaoda Yang, Xiaowei Song, Peng South China Univ Technol Sch Software Engn Guangzhou 510006 Peoples R China Jilin Univ Key Lab Symbol Computat & Knowledge Engn Minist Educ Changchun 130012 Peoples R China Minist Educ Key Lab Big Data & Intelligent Robot SCUT Guangzhou 510006 Peoples R China Guangdong Engn Ctr Large Model & GenAI Technol Guangzhou 510006 Peoples R China Guangdong Univ Finance & Econ Sch Informat Sci Guangzhou 510006 Peoples R China South China Agr Univ Sch Math & Informat Guangzhou 510006 Peoples R China Yantai Univ Sch Comp & Control Engn Yantai 264005 Peoples R China

The t2,0-norm is playing an increasingly important role in unsupervised feature selection. However, existing algorithm for optimization problem with t2,0-norm constraint has two problems: First, they cannot automatically determine the sparsity, also known as the number of key features. Second, they have the risk of converging towards local optima, therefore selecting trivial (less informative) features. To address these problems, this paper proposes an unsupervised feature selection method with evolutionary sparsity (EVSP), which integrates the feature selection process with a sparse projection matrix and population search mechanisms into a unified unsupervised feature selection framework. Specifically, the level of sparsity is encoded as population individuals, and subsequently, a multi-objective evolutionary algorithm based on binary encoding is introduced to recursively determine the optimal level of sparsity, thus unsupervisedly guiding the learning of an optimal row-sparse projection matrix. Moreover, by utilizing the feature weights learned through sparse projection, a two-stage strategy called the mutation-repair operator is designed to steer the evolution of the population, aiming to generate high-quality candidate solutions. Comprehensive experiments on eleven benchmark datasets, with a maximum dimensionality of 10304 features and a maximum size of 9298 samples, demonstrate that the proposed EVSP method can effectively determine the optimal sparsity level, significantly outperforming several state-of-the-art methods.

关键词： Unsupervised feature selection Multi-objective evolution Sparse projection

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-Hop Attention Diffusion Graph Neural Networks For Multimodal Fake News Detection

Multi-Hop Attention Diffusion Graph Neural Networks For Mult...

引用

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

作者： Zhongqiang Huang Dongli Lu Ying Sha Key Laboratory of Smart Farming for Agricultural Animals Wuhan China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan China Hubei Engineering Technology Research Center of Agricultural Big Data Wuhan China College of Informatics Huazhong Agricultural University Wuhan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Fake news often spreads rapidly on social media in various forms, exposing users to a large amount of misinformation and disinformation. Recently, promising results have been achieved in fake news detection. However, most of the approaches only consider one-hop neighborhood information in cross-modal mapping relationships or focus mainly on pairwise interactions of multimodal fake news. However, the fine-grained feature mapping of multimodal fake news may go beyond binary relations. To address these issues, we propose a Multi-Hop Attention Diffusion Graph Neural Networks in this work to capture and complement the multivariate mapping relationships between fine-grained features, while extracting cross-modal higher-order alignment representations for multimodal fake news detection via cross-modal contrastive learning and modal matching. Extensive experiments on three public datasets demonstrate the effectiveness of the proposed approach in the multimodal fake news detection task.

关键词： Visualization Social networking (online) Fuses Spread spectrum communication Contrastive learning Signal processing Feature extraction Graph neural networks Fake news Speech processing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Salix-Leaf: Find Main Veins of Signal Clusters for Practical Parallel Decoding

引用

IEEE Transactions on Mobile Computing 2025年

作者： Li, Yajun Zhao, Jumin Li, Dengao Wu, Hejun Xu, Shuang Bai, Ruiqin Taiyuan University of Technology College of Electronic Information and Optical Engineering Taiyuan China Key Laboratory of Big Data Fusion Analysis and Application of Shanxi Province Taiyuan China Intelligent Perception Engineering Technology Center of Shanxi Taiyuan China Taiyuan University of Technology College of Computer Science and Technology College of Data Science Taiyuan China Sun Yat-sen University Department of Computer Science Guangzhou China

Parallel decoding of backscatter improves communication throughput by enabling concurrent transmission of backscatter tags. In practical applications of parallel decoding, it is extremely difficult to distinguish collided signals in superclusters where multiple signal clusters overlap. Existing methods are usually effective for superclusters with uniformly distributed signals. Nevertheless, there are many more scenarios in which signals in superclusters tend to gather unevenly, and existing methods cannot work. Such uneven clustering of signals occurs due to the following two possible causes: (1) signal-strengthdifferences (SSDs) among tags;or (2) cluster drifting (CD) driven by interferences from other objects within communication environments. This paper proposes a novel scheme called SalixLeaf, which aims to identify the main veins of signal clusters to address this problem of superclusters with unevenly distributed signals. Salix-Leaf identifies the main vein of each signal cluster for fine-grained clustering so that the direction of the main veins can be used to verify the accuracy of clustering. In addition, SalixLeaf employs a supercluster decomposer that divides signals into different segments for clustering analysis, enhancing robustness and practicability. Experimental results show that Salix-Leaf achieves a 1.2-fold increase in throughput and a 25% reduction in bit error rate (BER) compared to the state-of-the-art. © 2002-2012 IEEE.

关键词： Backscattering

来源：评论

学校读者我要写书评

暂无评论

Channel and space-based joint rate allocation algorithm

Channel and space-based joint rate allocation algorithm

引用

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

作者： Dayong Wang Chao Yuan Yu Sun Xin Lu Hui Guo Frederic Dufaux Ce Zhu Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications China Department of Computer Science University of Central Arkansas Faculty of Computing Engineering and Media (CEM) De Montfort University UK Université Paris-Saclay CNRS CentraleSupélec Laboratoire Des Signaux et Systèmes France School of Information and Communication Engineering University of Electronic Science and Technology of China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Rate control is a critical component for image and video compression Particularly under limited network bandwidth conditions, bitrate control is essential to ensure efficient image transmission by effectively allocation channel resources. In this research, since both Channel and Spatial have relationship with rate allocation, we first propose a joint Channel-wise and Spatial-wise Quantization scheme to determine optimal quantization parameters. Subsequently, we develop a quantization step estimation network to obtain parameters to efficiently allocate rate according to target rate. Experiments demonstrate that our algorithm significantly improve compressed image quality with minimal bitrate distortion and achieve accurate rate control with nearly 3% average bitrate error.

关键词： Image quality Quantization (signal) Image coding Bit rate Signal processing algorithms Estimation Rate-distortion Video compression Resource management Speech processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：