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

Emotion Recognition System via Facial Expressions and Speech Using Machine Learning and Deep Learning Techniques

SN computer science 2023年第4期4卷 363页

作者： Chaudhari, Aayushi Bhatt, Chintan Nguyen, Thanh Thi Patel, Nisarg Chavda, Kirtan Sarda, Kalind U & P U. Patel Department of Computer Engineering Chandubhai S. Patel Institute of Technology Charotar University of Science And Technology (CHARUSAT) Gujarat Changa 388421 India Department of Computer Science and Engineering School of Technology Pandit Deendayal Energy University Knowledge Corridor Gujarat Gandhinagar 382007 India School of Information Technology Faculty of Science Engineering and Built Environment Deakin University Victoria 3216 Australia Bishop University 2600 College St Sherbrooke J1M 1Z7 QC Canada Crest Data Systems Private Limited Gandhinagar Highway Makarba Gujarat Ahmedabad 380051 India Programmer Analyst Meditab Software Pvt Ltd Kalasagar Mall Ghatlodiya Gujarat Ahmedabad 380061 India

Patients in hospitals frequently exhibit psychological issues such as sadness, pessimism, eccentricity, and anxiety. However, hospitals normally lack tools and facilities to continuously monitor the psychological health of patients. It is desirable to identify depression in patients so that it can be managed by instantly providing better therapy. This can be possible by advances in machine learning for image processing with notable applications in the domain of emotion recognition using facial expressions. In this paper, we have proposed two different methods, i.e. facial expression detection and voice analysis, to predict emotions. For facial expression recognition, we have used two approaches, one is the use of Gabor filters for feature extraction with support vector machine for classification and another is using convolutional neural network (CNN). For voice analysis, we extracted mel-frequency cepstral coefficients from speech data and, based on those features, predicted the emotions of the speech using a CNN model. Experimental results show that our proposed emotion recognition methods obtained high accuracy and thus could be potentially deployed to real-world applications. © 2023, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd.

关键词： CNN Deep learning Expressions Facial emotion Machine learning Speech SVM

来源：评论

学校读者我要写书评

暂无评论

Enhancing Building Safety: A Brief Review of Agent-Based Modeling for Fire Evacuation Simulation 16

Enhancing Building Safety: A Brief Review of Agent-Based Mod...

引用

16th International Conference on Ambient Systems, Networks and Technologies Networks, ANT 2025 / 8th International Conference on Emerging Data and Industry 4.0, EDI40 2025

作者： Kasereka, Selain K. Kabwe, Ortega M. Kinyanta, Maria W.K. Kasongo, Audrey L. Ilunga, Godwill W.K. Muhambya, Katya Tashev, Tasho Kyamakya, Kyandoghere Mathematics Statistics and Computer Science Department University of Kinshasa Kinshasa Democratic Republic Congo Faculty of English Engineering Studies Technical University of Sofia Sofia Bulgaria ABIL Research Center Kinshasa Democratic Republic Congo Faculty of Computer Science Université Nouveaux Horizons Lubumbashi Democratic Republic Congo Ganpat University Faculty of Computer Application Gujarat India Université Libre des Pays des Grands Lacs Faculty of Sciences and Technology Goma Democratic Republic Congo Institute of Smart Systems Technologies University of Klagenfurt Klagenfurt Austria Polytechnic Faculty University of Kinshasa Kinshasa Democratic Republic Congo

The issue of building evacuation in the event of a fire is a significant concern in urban planning and architecture. In the absence of appropriate measures, an emergency situation can potentially result in disastrous outcomes. In this review article, we explore the application of agent-based modeling (ABM) in the simulation of building evacuations in the event of a free breakout. To address this issue, we present a synthesis of findings from several studies, highlighting the advantages of ABM in modeling complex evacuation dynamics such as crowd behavior, consideration of multiple parameters, and decision-making processes. Additionally, we provide insight into the simulation tools and techniques used in studies that demonstrate the practical applications of ABM in enhancing evacuation strategies. Furthermore, we identify current challenges, research gaps, and propose future directions to enhance the accuracy and effectiveness of fire evacuation modeling and simulations. This study aims to contribute to the improvement of proposed solutions and models for the development of successful, effective, and reliable evacuation plans to enhance the safety of occupants in buildings. © 2025 The Author(s).

关键词： Urban planning

来源：评论

学校读者我要写书评

暂无评论

Like an Ophthalmologist: Dynamic Selection Driven Multi-View Learning for Diabetic Retinopathy Grading 39

Like an Ophthalmologist: Dynamic Selection Driven Multi-View...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Luo, Xiaoling Xu, Qihao Wu, Huisi Liu, Chengliang Lai, Zhihui Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen Key Laboratory of Visual Object Detection and Recognition Harbin Institute of Technology Shenzhen China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

ISBN: (纸本)157735897X

Diabetic retinopathy (DR), with its large patient population, has become a formidable threat to human visual health. In the clinical diagnosis of DR, multi-view fundus images are considered to be more suitable for DR diagnosis because of the wide coverage of the field of view. Therefore, different from the previous single-view DR grading methods, we design a dynamic selection-driven multi-view DR grading method to fit clinical scenarios better. Since lesion information plays a key role in DR diagnosis, previous methods usually boost the model performance by enhancing the lesion feature. However, during the actual diagnosis, ophthalmologists not only focus on the crucial parts, but also exclude irrelevant features to ensure the accuracy of judgment. To this end, we introduce the idea of dynamic selection and design a series of selection mechanisms from fine granularity to coarse granularity. In this work, we first introduce an Ophthalmic Image Reader (OIR) agent to provide the model with pixel-level prompts of suspected lesion areas. Moreover, we design a Multi-View Token Selection Module (MVTSM) that prunes redundant feature tokens and dynamically selects key information. In the final decision stage, we dynamically fuse multi-view features through the novel Multi-View Mixture of Experts Module (MVMoEM), to enhance key views and reduce the impact of conflicting views. Extensive experiments on a large multi-view fundus image dataset with 34,452 images prove that our method performs favorably against state-of-the-art models. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Ophthalmology

来源：评论

学校读者我要写书评

暂无评论

Deep Unfolding 3D Non-Local Transformer Network for Hyperspectral Snapshot Compressive Imaging

Deep Unfolding 3D Non-Local Transformer Network for Hyperspe...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Zheng Zhou Zongxin Liu Yongyong Chen Bingzhi Chen Biqing Zeng Yicong Zhou School of Electronics and Communication Engineering Guangzhou University Guangzhou China School of Software South China Normal University Foshan China School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Department of Computer and Information Science University of Macau Macau China

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Hyperspectral compressive imaging has shown remarkable advancements through the adoption of deep unfolding frameworks, which integrate the proximal mapping prior into the data fidelity term to formulate the reconstruction problem. However, existing technologies still face challenges in effectively capturing spatial-spectral features during the iterative deep prior learning stage, leading to unsatisfactory performance degradation. To address this issue, we propose a deep unfolding 3D non-local transformer (3DNLT) network for hyperspectral compressive imaging. A learnable half-quadratic splitting (HQS) algorithm is utilized to iteratively update the linear projection. Furthermore, a 3D non-local attention ushaped transformer is presented as the deep proximal mapping prior module to obtain the spatial-spectral long-range dependency features, leading to enhance the network’s ability to capture fine-grained hyperspectral and spatial details. Experimental results on both synthetic and real hyperspectral image reconstruction have demonstrated the superior performance of the 3DNLT network compared to state-of-the-art methods.

关键词： Degradation Three-dimensional displays Image coding Imaging Transformers Robustness Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A New Identity-Based Encryption Scheme with Accountable Authority Based on SM9 11

A New Identity-Based Encryption Scheme with Accountable Auth...

引用

11th International Conference on Electronics, Communications and Networks, CECNet 2021

作者： Wang, Ke Zhao, Yuan Luo, Song Guan, Zhi MoE Beijing China Department of Computer Science and Technology EECS Peking University Beijing China School of Computer Science and Engineering Chongqing University of Technology Chongqing China National Engineering Research Center for Software Engineering Peking University Beijing China

ISBN: (纸本)9781643682402

Accountable authority identity-based encryption (A-IBE) is an extension of identity-based encryption (IBE) in which private key's source can be traced, i.e., whether the key comes from a private key generator or a user. SM9 is an official cryptography standard of China which defines a practical IBE scheme. In this paper, we construct a practical A-IBE scheme from the SM9-IBE scheme. Our A-IBE scheme has public traceability and is proven secure if the based SM9-IBE scheme is secure. Compared with other A-IBE schemes, our A-IBE scheme has better efficiency in encryption and decryption. © 2022 The authors and IOS Press.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Task-Oriented Feature Compression for Multimodal Understanding via Device-Edge Co-Inference

arXiv

引用

arXiv 2025年

作者： Yuan, Cheng Liu, Zhening Lv, Jiashu Shao, Jiawei Jiang, Yufei Zhang, Jun Li, Xuelong of China Telecom China Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong School of Software and Microelectronics Peking University China School of Electronic and Information Engineering Harbin Institute of Technology Shenzhen China

With the rapid development of large multimodal models (LMMs), multimodal understanding applications are emerging. As most LMM inference requests originate from edge devices with limited computational capabilities, the predominant inference pipeline involves directly forwarding the input data to an edge server which handles all computations. However, this approach introduces high transmission latency due to limited uplink bandwidth of edge devices and significant computation latency caused by the prohibitive number of visual tokens, thus hindering delay-sensitive tasks and degrading user experience. To address this challenge, we propose a task-oriented feature compression (TOFC) method for multimodal understanding in a device-edge co-inference framework, where visual features are merged by clustering and encoded by a learnable and selective entropy model before feature projection. Specifically, we employ density peaks clustering based on K nearest neighbors to reduce the number of visual features, thereby minimizing both data transmission and computational complexity. Subsequently, a learnable entropy model with hyperprior is utilized to encode and decode merged features, further reducing transmission overhead. To enhance compression efficiency, multiple entropy models are adaptively selected based on the characteristics of the visual features, enabling a more accurate estimation of the probability distribution. Comprehensive experiments on seven visual question answering benchmarks validate the effectiveness of the proposed TOFC method. Results show that TOFC achieves up to 60% reduction in data transmission overhead and 50% reduction in system latency while maintaining identical task performance, compared with traditional image compression methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Image compression

来源：评论

学校读者我要写书评

暂无评论

Sparse is Enough in Fine-tuning Pre-trained Large Language Models

arXiv

引用

arXiv 2023年

作者： Song, Weixi Li, Zuchao Zhang, Lefei Zhao, Hai Du, Bo National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan430072 China Hubei Luojia Laboratory Wuhan430072 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China

With the prevalence of pre-training-fine-tuning paradigm, how to efficiently adapt the pre-trained model to the downstream tasks has been an intriguing issue. Parameter-Efficient Fine-Tuning (PEFT) methods have been proposed for low-cost adaptation. Although PEFT has demonstrated effectiveness and been widely applied, the underlying principles are still unclear. In this paper, we adopt the PAC-Bayesian generalization error bound, viewing pre-training as a shift of prior distribution which leads to a tighter bound for generalization error. We validate this shift from the perspectives of oscillations in the loss landscape and the quasi-sparsity in gradient distribution. Based on this, we propose a gradient-based sparse finetuning algorithm, named Sparse Increment Fine-Tuning (SIFT), and validate its effectiveness on a range of tasks including the GLUE Benchmark and Instruction-tuning. The code is accessible at https://***/song-wx/SIFT. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Explainable Pulmonary Disease Diagnosis with Prompt-Based Knowledge Extraction

Explainable Pulmonary Disease Diagnosis with Prompt-Based Kn...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Haodi Zhang Chenyu Xu Jiahong Li Peirou Liang Xiangyu Zeng Hao Ren Weibin Cheng Kaishun Wu College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Second Provincial General Hospital Institute for Healthcare Artificial Intelligence Application Guangzhou China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Recent studies show that deep learning models perform well in many medical tasks such as medical imaging and automated diagnosis. With qualified training datasets, some models can achieve or even surpass expert-level performance on some tasks. However, as a typical black-box-style approach, deep learning lacks theoretical interpretability, which is especially important for medical tasks. On the other hand, there are many sources of domain knowledge for medical diagnosis from human experts, such as clinical guidelines. How to sufficiently integrate human knowledge in the model is crucial for explainable diagnosis. In this paper, we propose a novel framework for explainable automated diagnosis that leverages explicit medical knowledge. We automate the knowledge extraction from textual clinical guidelines with prompt-based learning, train a set of weighted first-order logical rules with constructed evidence database, and finally infer the diagnosis result with integrated knowledge and multi-sourced data. We instantiate the framework for pulmonary disease diagnosis, and our experiments on a real dataset show that our method outperforms the state-of-the-art baselines in accuracy and interpretability.

关键词： Deep learning Training Databases Pulmonary diseases Medical diagnosis Data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

EEiF: Efficient Isolated Forest with e Branches for Anomaly Detection

EEiF: Efficient Isolated Forest with e Branches for Anomaly ...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Yifan Zhang Haolong Xiang Xuyun Zhang Xiaolong Xu Wei Fan Qin Zhang Lianyong Qi School of software Nanjing University of Information Science and Technology China Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services China School of Computing Macquarie University Australia Uffield Department of Women's & Reproductive Health University of Oxford England College of Computer Science and Software Engineering Shenzhen University China Faculty of Science and Engineering University of Petroleum (East China) China

ISBN: (数字)9798331506681

ISBN: (纸本)9798331506698

Anomaly detection is a popular research topic in Artificial Intelligence and has been widely applied in network security, financial fraud detection, and industrial equipment failure detection. Isolation forest based methods are the base algorithms to detect anomalies in these scenarios for their simplicity and efficiency, which has been further exploited with multi-folk trees and learning mechanisms to realize the optimal isolation forest for high detection accuracy. However, the optimal isolation forest is time-consuming with the learning mechanisms, resulting in the task failing of time-constrained applications. Moreover, the original optimal isolation forest fails to construct the optimal tree structure restricted by the time complexity. To address the above challenges, we propose an efficient anomaly detection method called EEIF, which realizes the real e-folk structure of the optimal isolation forest in our practical algorithm design. Specifically, we design a distribution that perfectly matches the e-branch theory to construct the optimal isolation forest. Then, we design an FR clustering scheme to achieve fast training of the isolation forest with learning to hash and provide related proofs of accuracy and efficiency. Besides, a parallel algorithm is integrated into our method to reduce prediction time. Finally, extensive experiments are conducted on a large amount of real-world datasets and the results demonstrate that our method significantly improves efficiency while ensuring effectiveness, compared with the state-of-the-art methods.

关键词： Learning systems Training Accuracy Clustering algorithms Forestry Network security Fraud Time complexity Parallel algorithms Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Positive Sample Augmentation with Graph Mixup for DDI Prediction

Positive Sample Augmentation with Graph Mixup for DDI Predic...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Hailong Yu Xinyu Ma Xu Chu Yasha Wang Rengyu Wu Qiang Zhou School of Computer Science Peking University Beijing China Department of Computer Science and Technology Tsinghua University Beijing China National Engineering Research Center for Software Engineering Peking University Beijing China Shenzhen Center for Prehospital Care Shenzhen China

Unexpected drug-drug interactions (DDIs) may occur when drugs are taken at the same time. Harmful DDIs can reduce drug efficacy and even increase unintended toxicity, putting patients treated with different drugs at risk. Previous works on DDI prediction mainly rely on hand-engineered domain knowledge, which is laborious to obtain and cannot handle the problem of sparse positive samples in DDI prediction. Even though some works attempt to handle data sparsity from the perspective of data distribution to improve the generalization ability of the model, they are limited to negative samples distribution. To address these limitations, we propose a novel method, Graph Mixup for Positive Sample Augmentation (GMPSA), to effectively combine positive drug molecule graphs and extend the training distribution to alleviate the problem of sparse positive samples. To model the graph signals and graph structures jointly, we map source graphs to the fused gromov-wasserstein metric space, then minimizes the weighted sum of transportation distances between the distributions of the source graphs and the objective graph in this metric space. By doing so, interpolated positive samples improve the the generalization error of the model. Experiments results on a real-word dataset show that our method effectively improve the perfomermance in DDI prediction on a state-of-the-art architecture. Further studies also verify the robustness and generalizability of GMPSA under different GNN backbones and parameter settings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：