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

Facial Expression Recognition Model Depending on Optimized Support Vector Machine

computers, Materials & Continua 2023年第7期76卷 499-515页

作者： Amel Ali Alhussan Fatma M.Talaat El-Sayed M.El-kenawy Abdelaziz A.Abdelhamid Abdelhameed Ibrahim Doaa Sami Khafaga Mona Alnaggar Department of Computer Sciences College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Machine Learning&Information Retrieval Department Faculty of Artificial IntelligenceKafrelsheikh UniversityKafrelsheikh33516Egypt Department of Communications and Electronics Delta Higher Institute of Engineering and TechnologyMansoura35111Egypt Department of Computer Science College of Computing and Information TechnologyShaqra University11961Saudi Arabia Department of Computer Science Faculty of Computer and Information SciencesAin Shams UniversityCairo11566Egypt Computer Engineering and Control Systems Department Faculty of EngineeringMansoura UniversityMansoura35516Egypt Robotics and Intelligent Machines Department Faculty of Artificial IntelligenceKafrelsheikh UniversityKafrelsheikh33516Egypt

In computer vision,emotion recognition using facial expression images is considered an important research *** learning advances in recent years have aided in attaining improved results in this *** to recent studies,multiple facial expressions may be included in facial photographs representing a particular type of *** is feasible and useful to convert face photos into collections of visual words and carry out global expression *** main contribution of this paper is to propose a facial expression recognitionmodel(FERM)depending on an optimized Support Vector Machine(SVM).To test the performance of the proposed model(FERM),AffectNet is *** uses 1250 emotion-related keywords in six different languages to search three major search engines and get over 1,000,000 facial photos *** FERM is composed of three main phases:(i)the Data preparation phase,(ii)Applying grid search for optimization,and(iii)the categorization *** discriminant analysis(LDA)is used to categorize the data into eight labels(neutral,happy,sad,surprised,fear,disgust,angry,and contempt).Due to using LDA,the performance of categorization via SVM has been obviously *** search is used to find the optimal values for hyperparameters of SVM(C and gamma).The proposed optimized SVM algorithm has achieved an accuracy of 99%and a 98%F1 score.

关键词： Facial expression recognition machine learning linear dis-criminant analysis(LDA) support vector machine(SVM) grid search

来源：评论

学校读者我要写书评

暂无评论

Integrating Self Sovereign Identity in XACML: The MERGE Approach 32

Integrating Self Sovereign Identity in XACML: The MERGE Appr...

引用

32nd International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, WETICE 2024

作者： De Salve, Andrea Di Francesco Maesa, Damiano Mori, Paolo Piva, Giulio Ricci, Laura Institute of Applied Sciences and Intelligent Systems National Research Council Lecce Italy University of Pisa Department of Computer Science Pisa Italy Institute of Informatics and Telematics National Research Council Pisa Italy

ISBN: (纸本)9798331505875

Attribute-Based Access Control (ABAC) systems are commonly used for protecting resources from unauthorized accesses. They perform the access decision process taking into account a set of attributes describing the features of the subjects executing the accesses, the resources being accessed, and the environment. In this paper, we propose to enhance traditional ABAC systems by integrating them with the novel Self Sovereign Identity (SSI) paradigm. More precisely, we propose a novel access control framework, leveraging the well known eXtensible Access Control Markup Language (XACML) standard for ABAC systems, which allows to exploit SSI credentials as sources of users' attributes for policy evaluation. Finally, we showcase a prototype implementation of our proposal, and we analyze its performance when evaluating XACML policies integrating SSI credentials with a variable number of attributes. © 2024 IEEE.

关键词： Access Control Blockchain decentralized identity Privacy self sovereign identity

来源：评论

学校读者我要写书评

暂无评论

Extinction Chains Reveal Intermediate Phases Between the Safety and Collapse in Mutualistic Ecosystems

引用

Engineering 2024年第12期43卷 89-98页

作者： Guangwei Wang Xueming Liu Ying Xiao Ye Yuan Linqiang Pan Xiaohong Guan Jianxi Gao Hai-Tao Zhang The MOE Engineering Research Center of Autonomous Intelligent Unmanned Systems State Key Laboratory of Digital Manufacturing Equipment and TechnologySchool of Artificial Intelligence and AutomationHuazhong University of Science and TechnologyWuhan 430074China Guangdong HUST Industrial Technology Research Institute Huazhong University of Science and TechnologyDongguan 523808China Guangdong Provincial Engineering Technology Center of Autonomous Unmanned Vessels Dongguan 523808China MOE Key Laboratory of Intelligent Networks and Network Security&State Key Laboratory of Manufacturing Systems Xi’an Jiaotong UniversityXi’an 710049China Tsinghua National Laboratory of Information Science and Technology Department of AutomationTsinghua UniversityBeijing 100084China Department of Computer Science Rensselaer Polytechnic InstituteTroyNY 12180USA

Ecosystems are undergoing unprecedented persistent deterioration due to unsustainable anthropogenic human activities,such as overfishing and deforestation,and the effects of such damage on ecological stability are *** recent advances in experimental and theoretical studies on regime shifts and tipping points,theoretical tools for understanding the extinction chain,which is the sequence of species extinctions resulting from overexploitation,are still lacking,especially for large-scale nonlinear networked *** this study,we developed a mathematical tool to predict regime shifts and extinction chains in ecosystems under multiple exploitation situations and verified it in 26 real-world mutualistic networks of various sizes and *** discovered five phases during the exploitation process:safe,partial extinction,bistable,tristable,and collapse,which enabled the optimal design of restoration strategies for degraded or collapsed *** validated our approach using a 20-year dataset from an eelgrass restoration ***,we also found a specific region in the diagram spanning exploitation rates and competition intensities,where exploiting more species helps increase *** computational tool provides insights into harvesting,fishing,exploitation,or deforestation plans while conserving or restoring the biodiversity of mutualistic ecosystems.

关键词： Complex system Network science Overexploitation Regime shift Metastability

来源：评论

学校读者我要写书评

暂无评论

Real-Time Human Fall Detection Using a Lightweight Pose Estimation Technique 5th

Real-Time Human Fall Detection Using a Lightweight Pose Est...

引用

5th International Conference on Computational Intelligence in Communications and Business Analytics, CICBA 2023

作者： Alam, Ekram Sufian, Abu Dutta, Paramartha Leo, Marco Department of Computer Science Gour Mahavidyalaya West Bengal Mangalbari India Department of Computer Science University of Gour Banga Malda India Department of Computer and System Sciences Visva-Bharati University Bolpur India National Research Council of Italy Institute of Applied Sciences and Intelligent Systems Lecce73100 Italy

ISBN: (纸本)9783031488788

The elderly population is increasing rapidly around the world. There are no enough caretakers for them. Use of AI-based in-home medical care systems is gaining momentum due to this. Human fall detection is one of the most important tasks of medical care system for the aged people. Human fall is a common problem among elderly people. Detection of a fall and providing medical help as early as possible is very important to reduce any further complexity. The chances of death and other medical complications can be reduced by detecting and providing medical help as early as possible after the fall. There are many state-of-the-art fall detection techniques available these days, but the majority of them need very high computing power. In this paper, we proposed a lightweight and fast human fall detection system using pose estimation. We used ‘Movenet’ for human joins key-points extraction. Our proposed method can work in real-time on any low-computing device with any basic camera. All computation can be processed locally, so there is no problem of privacy of the subject. We used two datasets ‘GMDCSA’ and ‘URFD’ for the experiment. We got the sensitivity value of 0.9375 and 0.9167 for the dataset ‘GMDCSA’ and ‘URFD’ respectively. The source code and the dataset GMDCSA of our work are available online to access. © 2024, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Fall detection

来源：评论

学校读者我要写书评

暂无评论

Int-HRL: towards intention-based hierarchical reinforcement learning

引用

Neural Computing and Applications 2024年 1-12页

作者： Penzkofer, Anna Schaefer, Simon Strohm, Florian Bâce, Mihai Leutenegger, Stefan Bulling, Andreas Institute for Visualisation and Interactive Systems University of Stuttgart Pfaffenwaldring 5A Stuttgart70569 Germany Machine Learning for Robotics Technical University of Munich Boltzmannstrasse 3 Munich85748 Germany Department of Computer Science KU Leuven box 2600 Andreas Vesaliusstraat 13 Leuven3000 Belgium

While deep reinforcement learning (RL) agents outperform humans on an increasing number of tasks, training them requires data equivalent to decades of human gameplay. Recent hierarchical RL methods have increased sample efficiency by incorporating information inherent to the structure of the decision problem but at the cost of having to discover or use human-annotated sub-goals that guide the learning process. We show that intentions of human players, i.e. the precursor of goal-oriented decisions, can be robustly predicted from eye gaze even for the long-horizon sparse rewards task of Montezuma’s Revenge–one of the most challenging RL tasks in the Atari2600 game suite. We propose Int-HRL: Hierarchical RL with intention-based sub-goals that are inferred from human eye gaze. Our novel sub-goal extraction pipeline is fully automatic and replaces the need for manual sub-goal annotation by human experts. Our evaluations show that replacing hand-crafted sub-goals with automatically extracted intentions leads to an HRL agent that is significantly more sample efficient than previous methods. © The Author(s) 2024.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Optimization Methods for High-Dimensional Expensive Problems:A Survey

引用

IEEE/CAA Journal of Automatica Sinica 2024年第5期11卷 1092-1105页

作者： MengChu Zhou Meiji Cui Dian Xu Shuwei Zhu Ziyan Zhao Abdullah Abusorrah Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA School of Information and Electronic Engineering Zhejiang Gongshang UniversityHangzhou 310018China School of Intelligent Manufacturing Nanjing University of Science and TechnologyNanjing 210094China Institute of Systems Engineering Macao University of Science and TechnologyMacao 999078China School of Artificial Intelligence and Computer Jiangnan UniversityWuxi 214122China School of Information Science and Engineering Northeastern UniversityShenyang 110819China Center of Research Excellence in Renewable Energy and Power Systems Department of Electrical and Computer EngineeringFaculty of EngineeringKing Abdulaziz UniversityJeddah 21589Saudi Arabia K.A.CARE Energy Research and Innovation Center King Abdulaziz UniversityJeddah 21589Saudi Arabia

Evolutionary computation is a rapidly evolving field and the related algorithms have been successfully used to solve various real-world optimization *** past decade has also witnessed their fast progress to solve a class of challenging optimization problems called high-dimensional expensive problems(HEPs).The evaluation of their objective fitness requires expensive resource due to their use of time-consuming physical experiments or computer ***,it is hard to traverse the huge search space within reasonable resource as problem dimension *** evolutionary algorithms(EAs)tend to fail to solve HEPs competently because they need to conduct many such expensive evaluations before achieving satisfactory *** reduce such evaluations,many novel surrogate-assisted algorithms emerge to cope with HEPs in recent *** there lacks a thorough review of the state of the art in this specific and important *** paper provides a comprehensive survey of these evolutionary algorithms for *** start with a brief introduction to the research status and the basic concepts of ***,we present surrogate-assisted evolutionary algorithms for HEPs from four main *** also give comparative results of some representative algorithms and application ***,we indicate open challenges and several promising directions to advance the progress in evolutionary optimization algorithms for HEPs.

关键词： computer optimization evolutionary

来源：评论

学校读者我要写书评

暂无评论

DELPHIC OFFLINE REINFORCEMENT LEARNING UNDER NONIDENTIFIABLE HIDDEN CONFOUNDING 12

DELPHIC OFFLINE REINFORCEMENT LEARNING UNDER NONIDENTIFIABLE...

引用

12th International Conference on Learning Representations, ICLR 2024

作者： Pace, Alizée Yèche, Hugo Schölkopf, Bernhard Rätsch, Gunnar Tennenholtz, Guy ETH AI Center Switzerland Department of Computer Science ETH Zürich Switzerland Max Planck Institute for Intelligent Systems Tübingen Germany Google Research United States

A prominent challenge of offline reinforcement learning (RL) is the issue of hidden confounding: unobserved variables may influence both the actions taken by the agent and the observed outcomes. Hidden confounding can compromise the validity of any causal conclusion drawn from data and presents a major obstacle to effective offline RL. In the present paper, we tackle the problem of hidden confounding in the nonidentifiable setting. We propose a definition of uncertainty due to hidden confounding bias, termed delphic uncertainty, which uses variation over world models compatible with the observations, and differentiate it from the well-known epistemic and aleatoric uncertainties. We derive a practical method for estimating the three types of uncertainties, and construct a pessimistic offline RL algorithm to account for them. Our method does not assume identifiability of the unobserved confounders, and attempts to reduce the amount of confounding bias. We demonstrate through extensive experiments and ablations the efficacy of our approach on a sepsis management benchmark, as well as on electronic health records. Our results suggest that nonidentifiable hidden confounding bias can be mitigated to improve offline RL solutions in practice. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

The Role of Generative AI in Deepfake Detection: A Systematic Literature Review

The Role of Generative AI in Deepfake Detection: A Systemati...

引用

International Conference on Smart Business and technology, ICSBT 2024

作者： Acim, Btissam Kharmoum, Nassim Lagmiri, Souad Najoua Ziti, Soumia Department of Computer Science Intelligent Processing & Security of Systems Faculty of Sciences Mohammed V University in Rabat Rabat Morocco Rabat Morocco IT Networking Security and Management Laboratory Higher Institute of Management Administration and Computer Engineering Rabat Morocco

ISBN: (纸本)9783031866975

There is a possibility that deepfakes will increase a great deal of false information in a very realistic way, but it seems that today such technology appears to be extremely dangerous. While generative Artificial Intelligence (AI) does expand possibilities and give an opportunity to achieve terrific outcomes and has innumerable potential uses. This systematic literature review focuses on the role of generative AI in the improvement of deepfake detection technologies, providing a comparison between different methods and assessing their effectiveness. By analyzing recent studies, it depicts the techniques employed most frequently in deepfake detection, such as the ones concentrating on the intricacies between the visual and auditory elements, the temporal domains, as well as any minor signs of alteration. Due to the fact that generative AI is rapidly improving, the methods that are used to detect its use are often inadequate, which calls for more studies on the subject matter. Besides, by combining audio and visual elements when performing the analysis, calling it as a method that can be useful in focusing the detection growth potential with diverse and unstructured data. Also, this study evaluates the advantages and limitations of the techniques existing today and demonstrates their relative effectiveness in controlled and real conditions. Clarifying that measures aimed at detecting AI generated content should be preoccupied with a technique that is able to keep pace with changes in generative AI. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game

引用

IEEE/CAA Journal of Automatica Sinica 2023年第2期10卷 512-523页

作者： Jie Chen Kaiyi Luo Changbing Tang Zhao Zhang Xiang Li the Adaptive Networks and Control Laboratory Department of Electronic EngineeringFudan UniversityShanghai 200433China the College of Mathematics and Computer Science Zhejiang Normal UniversityJinhua 321004 Yuxi Middle School Taizhou 317399China IEEE the College of Physics and Electronics Information Engineering Zhejiang Normal UniversityJinhua 321004China the College of Mathematics and Computer Science Zhejiang Normal UniversityJinhua 321004China the Adaptive Networks and Control Laboratory Department of Electronic EngineeringFudan UniversityShanghai 200433 the Institute of Complex Networks and Intelligent Systems Shanghai Research Institute for Intelligent Autonomous SystemsTongji UniversityShanghai 201210China

Weighted vertex cover(WVC)is one of the most important combinatorial optimization *** this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted *** first model the WVC problem as a general game on weighted *** the framework of a game,we newly define several cover states to describe the WVC ***,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the ***,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial ***,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the ***,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.

关键词： Game-based asynchronous algorithm(GAA) game optimization polynomial time strict Nash equilibrium(SNE) weighted vertex cover(WVC)

来源：评论

学校读者我要写书评

暂无评论

Deep Image Clustering by Spiking Neural Networks

Deep Image Clustering by Spiking Neural Networks

引用

2023 IEEE Applied Imagery Pattern Recognition Workshop, AIPR 2023

作者： Mahyari, Arash Aliakbarpour, Hadi PensacolaFL United States University of West Florida Department of Intelligent Systems and Robotics PensacolaFL United States Saint Louis University Department of Computer Science St. LouisMO United States

ISBN: (纸本)9798350359527

Neuromorphic cameras, or event cameras, are biologically-inspired sensors that detect changes in illumination at a pixel level, different from traditional cameras where each pixel independently and asynchronously outputs when it senses illumination changes. The neuromorphic cameras exhibit high-Temporal resolution and dynamic range, useful in various applications. Spiking Neural Networks (SNNs), mimicking biological neurons, are efficient in processing neuromorphic images due to their event-driven, low-power nature. However, training SNNs is challenging because of the non-differentiability of neuron models which require different optimization techniques. Inspired by recent works on unsupervised deep clustering in conventional deep learning, we introduce a novel deep clustering algorithm that employs SNNs to extract and group visual features from neuromorphic images into clusters. It utilizes an SNN feature extractor for neuromorphic images, grouping the extracted features using K-means clustering. This algorithm, which doesn't require pre-Trained SNN weights, alternates between cluster updates and SNN weight adjustments. The extracted feature vectors in SNN are clustered and used as pseudo-labels for supervised training of the SNN extractor. The performance of the proposed algorithm is evaluated on two datasets of MNIST and NMNIST, and its effectiveness is assessed using the Normalized Mutual Information (NMI) metric. The performance of our SNN system with neuromorphic images, while marginally below its counterparts of ANNs with traditional images, demonstrates considerable potential. © 2023 IEEE.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：