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

32nd ACM International Conference on Multimedia, MM 2024

作者： Qi, Zehao Zhang, Ruixu Hu, Xinyi Liu, Wenxuan Wang, Zheng National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Wuhan University Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan China School of Computer Science and Artificial Intelligence Wuhan University of Technology Wuhan China

ISBN: (纸本)9798400706868

Our paper introduces a novel video dataset specifically for Temporal Intention Localization (TIL), aimed at identifying hidden abnormal intention in densely populated and complex environments. Traditional Temporal Action Localization (TAL) frameworks, focusing on overt actions within constrained temporal intervals, often miss subtle pre-abnormal actions that unfold over extended periods. Our dataset comprises 228 videos with 5790 clips, each annotated to capture fine-grained actions within ambiguous temporal boundaries using the Joint-Linear-Assignment methodology. This approach enables detailed analysis of the evolution of abnormal intention over time. To detect subtle, hidden intention, we developed the Intention-Action Fusion module, an creative approach integrating dynamic feature fusion across 11 behavioral subcategories, significantly enhancing the model's ability to discern nuanced intention. This enhancement has led to performance improvements of up to 139% in specific scenarios, dramatically boosting the model's sensitivity and interpretability, crucial for advancing proactive surveillance systems. By pushing the boundaries of technology, our dataset and methodologies foster proactive surveillance systems capable of preemptively identifying potential threats from nuanced behavioral patterns, encouraging further exploration into the complexities of intention beyond observable actions. The dataset is available at https://***/Zzz99999/Hidden-Abnormal-Intention. © 2024 ACM.

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

GMTS: GNN-based multi-scale transformer siamese network for remote sensing building change detection

引用

International Journal of Digital Earth 2023年第1期16卷 1685-1706页

作者： Xinyang Song Zhen Hua Jinjiang Li School of Infomation and electronic engineering Shandong Technology and Business UniversityInstitute of Network Technology(ICT)YantaiPeople's Republic of China School of Computer Science and Technology Shandong Technology and Business UniversityYantaiPeople's Republic of China

With the remarkable success of change detection(CD)in remote sensing images in the context of deep learning,many convolutional neural network(CNN)based methods have been *** the current research,to obtain a better context modeling method for remote sensing images and to capture more spatiotemporal characteristics,several attention-based methods and transformer(TR)-based methods have been *** research has also continued to innovate on TR-based methods,and many new methods have been *** of them require a huge number of calculation to achieve good ***,using the TR-based mehtod while maintaining the overhead low is a problem to be ***,we propose a GNN-based multi-scale transformer siamese network for remote sensing image change detection(GMTS)that maintains a low network overhead while effectively modeling context in the spatiotemporal *** also design a novel hybrid backbone to extract *** with the current CNN backbone,our backbone network has a lower overhead and achieves better ***,we use high/low frequency(HiLo)attention to extract more detailed local features and the multi-scale pooling pyramid transformer(MPPT)module to focus on more global features ***,we leverage the context modeling capabilities of TR in the spatiotemporal domain to optimize the extracted *** have a relatively low number of parameters compared to that required by current TR-based methods and achieve a good effect improvement,which provides a good balance between efficiency and performance.

关键词： Remote sensing(RS) change detection(CD) depthwise over-parameterized convolutional(DO-Conv) attention mechanism transformer graph convolution

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Reliability via Subsystem Structures of Arrangement Graph networks

引用

IEEE Transactions on Reliability 2024年第1期73卷 279-289页

作者： Huang, Yanze Lin, Limei Xu, Li Hsieh, Sun-Yuan Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fuzhou350118 China Fujian Normal University College of Computer and Cyber Security Key Laboratory of Network Security and Cryptology Fuzhou350117 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

With the rapid growth of the number of processors in a multiprocessor system, faulty processors occur in it with a probability that rises quickly. The probability of a subsystem with an appropriate size being fault-free in a definite time interval is a significant and practical measure of the reliability for a multiprocessor system, which characterizes the functionality of a multiprocessor system well. Motivated by the study of subgraph reliability, as well as the attractive structure and fault tolerance properties of (n, k)-arrangement graph A n, k, we focus on the subgraph reliability for A n, k under the probabilistic fault model in this article. First, we investigate intersections of no more than four subgraphs in A n, k, and classify all the intersecting modes. Second, we focus on the probability P(q, A n, k n-1, k-1) with which at least one (n-1, k-1)-subarrangement graph is fault-free in A n, k, when given a uniform probability q with which a single vertex is fault-free, and we establish the P(q, A n, kn-1, k-1) by adopting the principle of inclusion-exclusion under the probabilistic fault model. Finally, we study the probabilistic fault model involving a nonuniform probability with which a single vertex is fault-free, and we prove that the P(q, A n, kn-1, k-1) under both models is very close to the asymptotic value by both theoretical arguments and experimental results. © 1963-2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Forward Legal Anonymous Group Pairing-Onion Routing for Mobile Opportunistic networks

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 6595-6612页

作者： Zhu, Xiuzhen Lin, Limei Huang, Yanze Wang, Xiaoding Hsieh, Sun-Yuan Wu, Jie Fujian Normal University College of Computer and Cyber Security Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Fuzhou350117 China Fujian University of Technology School of Computer Science and Mathematics Fujian Fuzhou350118 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan Temple University Department of Computer and Information Science 1925 N. 12th St PhiladelphiaPA19122 United States

Mobile Opportunistic networks (MONs) often experience frequent interruptions in end-to-end connections, which increases the likelihood of message loss during delivery and makes users more susceptible to various cyber attacks. However, most currently proposed anonymous routing protocols are primarily designed for networks with stable connections, making it challenging to protect user identities in MONs. To address these challenges, we propose FLAG-POR (Forward Legal Anonymous Group Pairing-Onion Routing), a novel anonymous routing protocol specifically tailored to enhance message delivery anonymity and security in MONs. Specifically, we abstract the mobile opportunistic network as a contact graph. By introducing the concept of "groups» into the pairing-onion routing protocol, which encrypts messages and relay nodes layer by layer, we develop a novel group-based pairing-onion routing protocol. This protocol ensures message confidentiality and relay node anonymity, while also improving message forwarding rates, as any node within a group can potentially act as a relay. To ensure message authenticity, we employ the efficient SM2 signing algorithm to generate signatures for the message source. Furthermore, by incorporating parameters such as the public key validity period and master key validity period into the group pairing-onion routing protocol, we achieve forward security in message delivery. We conduct a thorough theoretical analysis of the protocol's security and performance. The experimental results demonstrate that our FLAG-POR protocol outperforms baseline anonymous protocols in terms of delivery success rate, traceability rate, path anonymity, and node anonymity. Additionally, the FLAG-POR scheme effectively resists three potential threats to the routing system: collusion attack threat, node identification threat, and path identification threat, in any situation. © 2002-2012 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

Integrating Syntactic and Semantic Knowledge in AMR Parsing with Heterogeneous Graph Attention network 48

Integrating Syntactic and Semantic Knowledge in AMR Parsing ...

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Sataer, Yikemaiti Shi, Chuanqi Gao, Miao Fan, Yunlong Li, Bin Gao, Zhiqiang Southeast University School of Computer Science and Engineering Nanjing China Ministry of Education Key Laboratory of Computer Network and Information Integration Nanjing China

ISBN: (纸本)9781728163277

Meaning Representation (AMR) parsing is the task of translating a sentence to an AMR semantic graph which captures the basic meaning of the sentence, and is empowered by pre-trained Transformer models recently. These models encode the syntactic and semantic knowledge implicitly through self-supervised pre-trained tasks. We argue that encoding the syntactic and semantic knowledge explicitly is beneficial to AMR parsing and can improve data efficiency. Specifically, syntactic dependency and semantic role labeling (SRL) have similar sub-structures with AMR. In this work, we propose a novel linguistic knowledge-enhanced AMR parsing model, which augments the pre-trained Transformer with syntactic dependency and semantic role labeling structures of sentences. By applying a heterogeneous graph attention network, we can obtain syntactically and semantically augmented word representation, which can be integrated using an attentive integration layer and gating mechanism. Experimental results show that our model achieves state-of-the-art performance on different benchmarks, especially in out-of-domain and low-resource scenarios. © 2023 IEEE.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Cluster-preserving sampling algorithm for large-scale graphs

引用

science China(Information sciences) 2023年第1期66卷 60-76页

作者： Jianpeng ZHANG Hongchang CHEN Dingjiu YU Yulong PEI Yingjun DENG National Digital Switching System E&T Research Center Information Engineering University Network Systems Department of the Strategic Support Force School of Computer Science and Technology Eindhoven University of Technology Center for Applied Mathematics Tianjin University

Graph sampling is a very effective method to deal with scalability issues when analyzing largescale graphs. Lots of sampling algorithms have been proposed, and sampling qualities have been quantified using explicit properties(e.g., degree distribution) of the sample. However, the existing sampling techniques are inadequate for the current sampling task: sampling the clustering structure, which is a crucial property of the current networks. In this paper, using different expansion strategies, two novel top-leader sampling methods(i.e., TLS-e and TLS-i) are proposed to obtain representative samples, and they are capable of effectively preserving the clustering structure. The rationale behind them is to select top-leader nodes of most clusters into the sample and then heuristically incorporate peripheral nodes into the sample using specific expansion strategies. Extensive experiments are conducted to investigate how well sampling techniques preserve the clustering structure of graphs. Our empirical results show that the proposed sampling algorithms can preserve the population's clustering structure well and provide feasible solutions to sample the clustering structure from large-scale graphs.

关键词： graph sampling clustering structure top-leader nodes expansion strategies large-scale graphs

来源：评论

学校读者我要写书评

暂无评论

Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition 41

Learning Label Shift Correction for Test-Agnostic Long-Taile...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Wei, Tong Mao, Zhen Zhou, Zi-Hao Wan, Yuanyu Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China School of Software Technology Zhejiang University Ningbo China

Long-tail learning primarily focuses on mitigating the label distribution shift between long-tailed training data and uniformly distributed test data. However, in real-world applications, we often encounter a more intricate challenge where the test label distribution is agnostic. To address this problem, we first theoretically establish the substantial potential for reducing the generalization error if we can precisely estimate the test label distribution. Motivated by the theoretical insight, we introduce a simple yet effective solution called label shift correction (LSC). LSC estimates the test label distribution within the proposed framework of generalized black box shift estimation, and adjusts the predictions from a pre-trained model to align with the test distribution. Theoretical analyses confirm that accurate estimation of test label distribution can effectively reduce the generalization error. Extensive experimental results demonstrate that our method significantly outperforms previous state-of-the-art approaches, especially when confronted with non-uniform test label distribution. Notably, the proposed method is general and complements existing long-tail learning approaches, consistently improving their performance. The source code is available at https://***/Stomach-ache/label-shift-correction. Copyright 2024 by the author(s)

关键词： Black-box testing

来源：评论

学校读者我要写书评

暂无评论

Semantic-Aware Pseudo-Labeling for Unsupervised Meta-Learning

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第07期47卷 5475-5488页

作者： Ouyang, Tianran Dong, Xingping Ye, Mang Du, Bo Shao, Ling Shen, Jianbing Wuhan University School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan430072 China University of Chinese Academy of Sciences UCAS-Terminus AI Lab Beijing China University of Macau State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science China

In unsupervised meta-learning, the clustering-based pseudo-labeling approach is an attractive framework, since it is model-agnostic, allowing it to synergize with supervised algorithms to learn from unlabeled data. However, the pseudo-labels suffer from clustering noise and semantic chaos problems, further impacting the effectiveness of meta-learning. In this paper, we analyze and optimize the pseudo-labeling process, including encoding and clustering, aiming to generate semantic- like pseudo-labels to narrow the gap between unsupervised and supervised meta-learning. Firstly, during the encoding, we observe that the embedding space of existing methods lacks clustering-friendly properties, which is the primary reason for clustering noise. To address this issue, we minimize the inter-to-intra-class similarity ratio to generate clustering-friendly embedding features and validate our approach through comprehensive experiments. Then, during the clustering, we find that the semantic quality of pseudo-labels is not adequately controlled, resulting in semantic chaos of pseudo-labels. We propose a semantic-stability index to measure the semantic quality of pseudo-labels quantitatively. Based on this index, we propose the Semantic-aware Pseudo-label Reassignment mechanism to generate semantic- like pseudo-labels for all samples. Our approach is model-agnostic and can easily be integrated into existing supervised methods. To demonstrate its generalization ability, we integrate it into two representative algorithms: MAML and EP. The results on three main few-shot benchmarks clearly show that the proposed method achieves significant improvement compared to state-of-the-art models. Notably, our approach also outperforms the corresponding supervised method in three tasks. The source code will be made publicly available. ©1979-2012 IEEE.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

Evaluation Method of Object Control Capability for Children Based on Nonlinear Dynamics 23

Evaluation Method of Object Control Capability for Children ...

引用

3rd International Conference on Bioinformatics and Intelligent Computing, BIC 2023

作者： Wang, Huaijun Li, Chao Zhang, Dongsheng Li, Junhuai Key Laboratory of Network Computing and Security Technology School of Computer Science and Engineering Xi an University of Technology Xi'an China

ISBN: (纸本)9798400700200

DCD (Developmental Coordination Disorder) has become a global problem, and several studies have shown that early detection and intervention are important for the prevention and treatment of DCD in children. To address the problems of low intelligence, simple assessment indexes and single dimension in assessing children's motor coordination, a method based on non-linear dynamics is proposed to assess children's object control ability. Using the child's in-situ ball tapping as the test item, the Kinect and inertial sensors are used to collect hand spatial position information and human motion biomechanical signals during the ball tapping process. The complexity of the signal is reflected by the sample entropy of the motion signal. The approach suggested in this thesis, which uses non-linear kinetic characteristics, enhances the accuracy of behavioral and developmental identification by 1% to 3% when compared to existing methods. The experiments prove that the proposed method has a better recognition rate and stability than the traditional assessment methods. © 2023 ACM.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Brain-Conditional Multimodal Synthesis: A Survey and Taxonomy

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1080-1099页

作者： Mai, Weijian Zhang, Jian Fang, Pengfei Zhang, Zhijun South China University of Technology School of Automation Science and Engineering Guangzhou510640 China Southeast University School of Computer Science and Engineering Nanjing210096 China South China University of Technology Key Library of Autonomous Systems and Network Control Ministry of Education The School of Automation Science and Engineering Guangzhou510640 China Institute for Super Robotics Huangpu Guangzhou510555 China Nanchang University Jiangxi Thousand Talents Plan Nanchang330031 China Jishou University College of Computer Science and Engineering Jishou416000 China Guangdong Artificial Intelligence and Digital Economy Laboratory Pazhou Lab Guangzhou510335 China Shaanxi University of Technology Shaanxi Provincial Key Laboratory of Industrial Automation School of Mechanical Engineering Hanzhong723001 China Changsha Normal University School of Information Science and Engineering Changsha410100 China Guangdong University of Petrochemical Technology School of Automation Science and Engineering Institute of Artificial Intelligence and Automation Maoming525000 China

In the era of artificial intelligence generated content (AIGC), conditional multimodal synthesis technologies (e.g., text-to-image) are dynamically reshaping the natural content. Brain signals, serving as potential reflections of how the brain interprets external information, exhibit a distinctive one-to-many correspondence with various external modalities. This correspondence makes brain signals emerge as a promising guiding condition for multimodal synthesis (e.g., image, text, and audio), which is crucial for developing practical brain–computer interface systems and unraveling complex mechanisms underlying human perception. This survey comprehensively examines the emerging field of brain-conditional multimodal synthesis, termed AIGC-brain, to delineate the current landscape and future directions. To begin, related neuroimaging datasets and generative models are introduced as the foundation of AIGC-brain decoding and analysis. Next, we present a comprehensive taxonomy according to AIGC-brain methodologies, followed by task-specific representative work and implementation details to facilitate in-depth comparison and analysis. Quality assessments are then introduced for both qualitative and quantitative evaluation. Finally, this survey explores insights gained, outlining current challenges and prospects of AIGC-brain. As a pioneering survey, this article paves the way for future advances in AIGC-brain research. © 2020 IEEE.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：