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

E2E-MFERC:AMulti-Face Expression Recognition Model for Group Emotion Assessment

Computers, Materials & Continua 2024年第4期79卷 1105-1135页

作者： Lin Wang Juan Zhao Hu Song Xiaolong Xu Jiangsu Key Laboratory of Big Data Security&Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing210042China School of Network Security Jinling Institute of TechnologyNanjing211169China State Grid Jiangsu Electric Power Company Limited Nanjing210000China School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing210042China

In smart classrooms, conducting multi-face expression recognition based on existing hardware devices to assessstudents’ group emotions can provide educators with more comprehensive and intuitive classroom effect analysis,thereby continuouslypromotingthe improvementof teaching ***,most existingmulti-face expressionrecognition methods adopt a multi-stage approach, with an overall complex process, poor real-time performance,and insufficient generalization ability. In addition, the existing facial expression datasets are mostly single faceimages, which are of low quality and lack specificity, also restricting the development of this research. This paperaims to propose an end-to-end high-performance multi-face expression recognition algorithm model suitable forsmart classrooms, construct a high-quality multi-face expression dataset to support algorithm research, and applythe model to group emotion assessment to expand its application value. To this end, we propose an end-to-endmulti-face expression recognition algorithm model for smart classrooms (E2E-MFERC). In order to provide highqualityand highly targeted data support for model research, we constructed a multi-face expression dataset inreal classrooms (MFED), containing 2,385 images and a total of 18,712 expression labels, collected from smartclassrooms. In constructing E2E-MFERC, by introducing Re-parameterization visual geometry group (RepVGG)block and symmetric positive definite convolution (SPD-Conv) modules to enhance representational capability;combined with the cross stage partial network fusion module optimized by attention mechanism (C2f_Attention),it strengthens the ability to extract key information;adopts asymptotic feature pyramid network (AFPN) featurefusion tailored to classroomscenes and optimizes the head prediction output size;achieves high-performance endto-end multi-face expression detection. Finally, we apply the model to smart classroom group emotion assessmentand provide design refe

关键词： Multi-face expression recognition smart classroom end-to-end detection group emotion assessment

来源：评论

学校读者我要写书评

暂无评论

Temporal Knowledge Graph Question Answering: A Survey

arXiv

引用

arXiv 2024年

作者： Su, Miao Li, Zixuan Chen, Zhuo Bai, Long Jin, Xiaolong Guo, Jiafeng CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

Knowledge Base Question Answering (KBQA) has been a long-standing field to answer questions based on knowledge bases. Recently, the evolving dynamics of knowledge have attracted a growing interest in Temporal Knowledge Graph Question Answering (TKGQA), an emerging task to answer temporal questions. However, this field grapples with ambiguities in defining temporal questions and lacks a systematic categorization of existing methods for TKGQA. In response, this paper provides a thorough survey from two perspectives: the taxonomy of temporal questions and the methodological categorization for TKGQA. Specifically, we first establish a detailed taxonomy of temporal questions engaged in prior studies. Subsequently, we provide a comprehensive review of TKGQA techniques of two categories: semantic parsing-based and TKG embedding-based. Building on this review, the paper outlines potential research directions aimed at advancing the field of TKGQA. This work aims to serve as a comprehensive reference for TKGQA and to stimulate further research. © 2024, CC BY.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

KnowCoder: Coding Structured Knowledge into LLMs for Universal Information Extraction

arXiv

引用

arXiv 2024年

作者： Li, Zixuan Zeng, Yutao Zuo, Yuxin Ren, Weicheng Liu, Wenxuan Su, Miao Guo, Yucan Liu, Yantao Li, Xiang Hu, Zhilei Bai, Long Li, Wei Liu, Yidan Yang, Pan Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

In this paper, we propose KnowCoder, a Large Language Model (LLM) to conduct Universal Information Extraction (UIE) via code generation. KnowCoder aims to develop a kind of unified schema representation that LLMs can easily understand and an effective learning framework that encourages LLMs to follow schemas and extract structured knowledge accurately. To achieve these, KnowCoder introduces a code-style schema representation method to uniformly transform different schemas into Python classes, with which complex schema information, such as constraints among tasks in UIE, can be captured in an LLM-friendly manner. We further construct a code-style schema library covering over 30,000 types of knowledge, which is the largest one for UIE, to the best of our knowledge. To ease the learning process of LLMs, KnowCoder contains a two-phase learning framework that enhances its schema understanding ability via code pretraining and its schema following ability via instruction tuning. After code pretraining on around 1.5B automatically constructed data, KnowCoder already attains remarkable generalization ability and achieves relative improvements by 49.8% F1, compared to LLaMA2, under the few-shot setting. After instruction tuning, KnowCoder further exhibits strong generalization ability on unseen schemas and achieves up to 12.5% and 21.9%, compared to sota baselines, under the zero-shot setting and the low resource setting, respectively. Additionally, based on our unified schema representations, various human-annotated datasets can simultaneously be utilized to refine KnowCoder, which achieves significant improvements up to 7.5% under the supervised setting. Copyright © 2024, The Authors. All rights reserved.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Temporal Global Re-detection Based on Interaction-Fusion Attention in Long-Term Visual Tracking 12th

Temporal Global Re-detection Based on Interaction-Fusion At...

引用

12th International Conference on Image and Graphics, ICIG 2023

作者： Ma, Jingyuan Hou, Zhiqiang Han, Ruoxue Ma, Sugang School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China Key Laboratory of Network Data Analysis and Intelligent Processing of Shaanxi Province Xi’an710121 China

ISBN: (纸本)9783031463075

In long-term visual tracking, target occlusion and out-of-view are common problems that lead to target drift, adding re-detection to short-term tracking algorithms is a general solution. To better handle the problem of target disappearing and reappearing in long-term visual tracking, this paper proposes a temporal global re-detection method based on interaction-fusion attention. Firstly, ResNet50 is used as the feature extraction network to obtain the depth features of the template and the search region. Then, a new interaction-fusion attention is added to extract the connection of different dimensionality of features. Finally, Temporal ROI Align is introduced to select candidate boxes, increasing the use of historical information by re-detection method, and improving the accuracy of target localization. STMTrack algorithm is selected as the short-term tracking algorithm, which works with the proposed re-detection method to construct a long-term tracking algorithm, and experiments are conducted on the UAV123, LaSOT, UAV20L, and VOT2018-LT datasets, and the effectiveness of this re-detection method can be seen from the experimental results. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Chemical detection

来源：评论

学校读者我要写书评

暂无评论

A Novel Multi-Edge Cooperative Offloading Genetic Algorithm towards Environmental Monitoring System 5

A Novel Multi-Edge Cooperative Offloading Genetic Algorithm ...

引用

5th International Conference on Telecommunications and Communication Engineering, ICTCE 2022

作者： Fang, Jie Li, Wenzao Wang, Yue Sun, Xiulan College of Communication Engineering Chengdu University of Information Technology China Network and Data Security Key Lab of Sichuan Pro. University of Electronic Science and Technology of China China Institute of Data Application Research Educational Informalization and Big Data Center China

ISBN: (纸本)9781450397797

In environmental monitor architecture, the usual way of processing data is centralized. On the one hand, this leads to a long time of data processing, and with the increasing number of monitoring sensors, the pressure of data processing in data centers increases sharply. The edge computing provides a feasible solution to relieve the processing pressure and decrease the delay of data processing in data center. However, in the environmental monitor system, the edge servers are often load unbalance because of the nonuniform distribution of sensors. While, it is usually ignored in recently researches. In this paper, we proposed a cooperative offloading strategy (MECOGA) based on genetic algorithm (GA). It aims to ease the data processing pressure and reduce the data processing time in the data center. In addition, the load balance of edge servers is also one of our optimization goals. In this paper, we aim at decreasing task processing delay and improving the system load balancing. Contrast to other algorithms, our MECOGA decreases the delay near 20% before collaborative loading. And the balance variance is 15% smaller than the Balance strategy. © 2022 Association for Computing Machinery.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Unleashing the Potential of Decentralized Federated Learning in Healthcare: A Comprehensive Survey on Insights and Challenges 9

Unleashing the Potential of Decentralized Federated Learning...

引用

9th IEEE International Conference on data science in Cyberspace, DSC 2024

作者： Cheng, Haibo Liu, Wenjian Qu, Youyang Fu, Kexue Wang, Qinyuan City University of Macau Faculty of Data Science China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China

ISBN: (纸本)9798350391367

Federated learning (FL) is a distributed learning method that reduces data transmission and privacy risks. However, the existence of a central server may become a target of attackers, resulting in an increased risk of user privacy leakage. The emergence of Decentralized Federated Learning (DFL) is posited to enhance data privacy and system reliability by reducing reliance on central servers and enhancing local data control, especially in the medical field, where personal health data is protected. This research investigates the application of (DFL) in the medical domain, focusing on its limitations. This study employs a systematic literature review, adhering to PRISMA guidelines, to comprehensively understand DFL's current landscape and challenges in healthcare. The key findings highlight four principal obstacles faced by DFL: security and privacy, communication efficiency, data and model heterogeneity, and incentive mechanisms. It also explores the potential for DFL to facilitate personalized healthcare treatments by large datasets distributed across various medical institutions. This research fills a significant void by systematically reviewing DFL technologies in healthcare. It provides insights into applications, challenges, and future directions for participants seeking secure and efficient healthcare data handling. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

DarkSAM: Fooling Segment Anything Model to Segment Nothing 38

DarkSAM: Fooling Segment Anything Model to Segment Nothing

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zhou, Ziqi Song, Yufei Li, Minghui Hu, Shengshan Wang, Xianlong Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

Segment Anything Model (SAM) has recently gained much attention for its outstanding generalization to unseen data and tasks. Despite its promising prospect, the vulnerabilities of SAM, especially to universal adversarial perturbation (UAP) have not been thoroughly investigated yet. In this paper, we propose DarkSAM, the first prompt-free universal attack framework against SAM, including a semantic decoupling-based spatial attack and a texture distortion-based frequency attack. We first divide the output of SAM into foreground and background. Then, we design a shadow target strategy to obtain the semantic blueprint of the image as the attack target. DarkSAM is dedicated to fooling SAM by extracting and destroying crucial object features from images in both spatial and frequency domains. In the spatial domain, we disrupt the semantics of both the foreground and background in the image to confuse SAM. In the frequency domain, we further enhance the attack effectiveness by distorting the high-frequency components (i.e., texture information) of the image. Consequently, with a single UAP, DarkSAM renders SAM incapable of segmenting objects across diverse images with varying prompts. Experimental results on four datasets for SAM and its two variant models demonstrate the powerful attack capability and transferability of DarkSAM. Our codes are available at: https://***/CGCL-codes/DarkSAM. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Augmentation-Aware Self-Supervision for data-Efficient GAN Training 37

Augmentation-Aware Self-Supervision for Data-Efficient GAN T...

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

作者： Hou, Liang Cao, Qi Yuan, Yige Zhao, Songtao Ma, Chongyang Pan, Siyuan Wan, Pengfei Wang, Zhongyuan Shen, Huawei Cheng, Xueqi CAS Key Laboratory of AI Safety and Security Institute of Computing Technology Chinese Academy of Sciences China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Kuaishou Technology China

ISBN: (纸本)9781713899921

Training generative adversarial networks (GANs) with limited data is challenging because the discriminator is prone to overfitting. Previously proposed differentiable augmentation demonstrates improved data efficiency of training GANs. However, the augmentation implicitly introduces undesired invariance to augmentation for the discriminator since it ignores the change of semantics in the label space caused by data transformation, which may limit the representation learning ability of the discriminator and ultimately affect the generative modeling performance of the generator. To mitigate the negative impact of invariance while inheriting the benefits of data augmentation, we propose a novel augmentation-aware self-supervised discriminator that predicts the augmentation parameter of the augmented data. Particularly, the prediction targets of real data and generated data are required to be distinguished since they are different during training. We further encourage the generator to adversarially learn from the self-supervised discriminator by generating augmentation-predictable real and not fake data. This formulation connects the learning objective of the generator and the arithmetic - harmonic mean divergence under certain assumptions. We compare our method with state-of-the-art (SOTA) methods using the class-conditional BigGAN and unconditional StyleGAN2 architectures on data-limited CIFAR-10, CIFAR-100, FFHQ, LSUN-Cat, and five low-shot datasets. Experimental results demonstrate significant improvements of our method over SOTA methods in training data-efficient GANs. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Controlling Risk of Retrieval-augmented Generation: A Counterfactual Prompting Framework

arXiv

引用

arXiv 2024年

作者： Chen, Lu Zhang, Ruqing Guo, Jiafeng Fan, Yixing Cheng, Xueqi CAS Key Lab of Network Data Science and Technology ICT CAS Beijing China University of Chinese Academy of Sciences Beijing China

Retrieval-augmented generation (RAG) has emerged as a popular solution to mitigate the hallucination issues of large language models. However, existing studies on RAG seldom address the issue of predictive uncertainty, i.e., how likely it is that a RAG model’s prediction is incorrect, resulting in uncontrollable risks in real-world applications. In this work, we emphasize the importance of risk control, ensuring that RAG models proactively refuse to answer questions with low confidence. Our research identifies two critical latent factors affecting RAG’s confidence in its predictions: the quality of the retrieved results and the manner in which these results are utilized. To guide RAG models in assessing their own confidence based on these two latent factors, we develop a counterfactual prompting framework that induces the models to alter these factors and analyzes the effect on their answers. We also introduce a benchmarking procedure to collect answers with the option to abstain, facilitating a series of experiments. For evaluation, we introduce several risk-related metrics and the experimental results demonstrate the effectiveness of our approach. Our code and benchmark dataset are available at https://***/ictbigdatalab/RC-RAG. Copyright © 2024, The Authors. All rights reserved.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

Optimizing over Multiple Distributions under Generalized Quasar-Convexity Condition 38

Optimizing over Multiple Distributions under Generalized Qua...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Ding, Shihong Yang, Long Luo, Luo Fang, Cong State Key Lab of General AI School of Intelligence Science and Technology Peking University China School of Data Science Fudan University China Institute for Artificial Intelligence Peking University China Shanghai Key Laboratory for Contemporary Applied Mathematics China

We study a typical optimization model where the optimization variable is composed of multiple probability distributions. Though the model appears frequently in practice, such as for policy problems, it lacks specific analysis in the general setting. For this optimization problem, we propose a new structural condition/landscape description named generalized quasar-convexity (GQC) beyond the realms of convexity. In contrast to original quasar-convexity [24], GQC allows an individual quasar-convex parameter γi for each variable block i and the smaller of γi implies less block-convexity. To minimize the objective function, we consider a generalized oracle termed as the internal function that includes the standard gradient oracle as a special case. We provide optimistic mirror descent (OMD) for multiple distributions and prove that the algorithm can achieve an adaptive (Equation presented) iteration complexity to find an Ε-suboptimal global solution without pre-known the exact values of γi when the objective admits "polynomial-like" structural. Notably, it achieves iteration complexity that does not explicitly depend on the number of distributions and strictly faster (Equation presented) than mirror decent methods. We also extend GQC to the minimax optimization problem proposing the generalized quasar-convexity-concavity (GQCC) condition and a decentralized variant of OMD with regularization. Finally, we show the applications of our algorithmic framework on discounted Markov Decision Processes problem and Markov games, which bring new insights on the landscape analysis of reinforcement learning. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：