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

Fuzzy Logic Based Brake Failure Detection & Collision Avoidance Model for Automated Driving System

学校读者我要写书评

暂无评论

Fuzzy Logic Based Brake Failure Detection & Collision Avoida...

International Conference on Robotics and Artificial Intelligence (ICRAI)

作者： Amil Roohani Dar Faisal Riaz Department of CS&IT University of Kotli (AJ&K) Kotli AJ&K Pakistan Control Automotive and Robotics Lab Affiliated Lab of National Centre of Robotics and Automation (NCRA) HEC Islamabad Pakistan Department of Computer Science & Information Technology Mirpur University of Sceince & Technology (MUST) Mirpur Pakistan

ISBN: (数字)9798350355703

ISBN: (纸本)9798350355710

The manual and automated braking system is intended to prevent rear-end collisions. However, unforeseen malfunctions within the vehicle's system during braking could potentially cause accidents. Collision Warning (CW) systems are safety technologies in vehicles that aid drivers in preventing collisions. This paper introduces a fuzzy-assisted pre-warning system for brake testing that considers multiple factors contributing to brake failure, along with a post-failure CW algorithm tailored for heavy commercial vehicles. Simulations conducted using NetLogo demonstrate that accidents can be prevented during brake failure through appropriate adjustments in vehicle speed. The proposed collision avoidance system has been validated for its effectiveness, and the results are encouraging and enhance road user safety.

关键词： Robot sensing systems Software Road safety Safety Brakes Collision avoidance Robotics and automation Accidents Vehicles Testing

Learning Probabilistic Coordinate Fields for Robust Correspondences

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhao, Weiyue Lu, Hao Ye, Xinyi Cao, Zhiguo Li, Xin Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China The Lane Department of Computer Science and Electrical Engineering West Virginia University MorgantownWV26506-6109 United States

We introduce Probabilistic Coordinate Fields (PCFs), a novel geometric-invariant coordinate representation for image correspondence problems. In contrast to standard Cartesian coordinates, PCFs encode coordinates in correspondence-specific barycentric coordinate systems (BCS) with affine invariance. To know when and where to trust the encoded coordinates, we implement PCFs in a probabilistic network termed PCF-Net, which parameterizes the distribution of coordinate fields as Gaussian mixture models. By jointly optimizing coordinate fields and their confidence conditioned on dense flows, PCF-Net can work with various feature descriptors when quantifying the reliability of PCFs by confidence maps. An interesting observation of this work is that the learned confidence map converges to geometrically coherent and semantically consistent regions, which facilitates robust coordinate representation. By delivering the confident coordinates to keypoint/feature descriptors, we show that PCF-Net can be used as a plug-in to existing correspondence-dependent approaches. Extensive experiments on both indoor and outdoor datasets suggest that accurate geometric invariant coordinates help to achieve the state of the art in several correspondence problems, such as sparse feature matching, dense image registration, camera pose estimation, and consistency filtering. Further, the interpretable confidence map predicted by PCF-Net can also be leveraged to other novel applications from texture transfer to multi-homography classification. Copyright © 2023, The Authors. All rights reserved.

关键词： Textures

A2B: Anchor to Barycentric Coordinate for Robust Correspondence

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhao, Weiyue Lu, Hao Cao, Zhiguo Li, Xin The Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Lane Department of Computer Science and Electrical Engineering West Virginia University Commonwealth of Virginia Morgantown 15461 United States

There is a long-standing problem of repeated patterns in correspondence problems, where mismatches frequently occur because of inherent ambiguity. The unique position information associated with repeated patterns makes coordinate representations a useful supplement to appearance representations for improving feature correspondences. However, the issue of appropriate coordinate representation has remained unresolved. In this study, we demonstrate that geometric-invariant coordinate representations, such as barycentric coordinates, can significantly reduce mismatches between features. The first step is to establish a theoretical foundation for geometrically invariant coordinates. We present a seed matching and filtering network (SMFNet) that combines feature matching and consistency filtering with a coarse-to-fine matching strategy in order to acquire reliable sparse correspondences. We then introduce DEGREE, a novel anchor-to-barycentric (A2B) coordinate encoding approach, which generates multiple affine-invariant correspondence coordinates from paired images. DEGREE can be used as a plug-in with standard descriptors, feature matchers, and consistency filters to improve the matching quality. Extensive experiments in synthesized indoor and outdoor datasets demonstrate that DEGREE alleviates the problem of repeated patterns and helps achieve state-of-the-art performance. Furthermore, DEGREE also reports competitive performance in the third Image Matching Challenge at CVPR 2021. This approach offers a new perspective to alleviate the problem of repeated patterns and emphasizes the importance of choosing coordinate representations for feature correspondences. Copyright © 2023, The Authors. All rights reserved.

关键词：

LU2Net: A Lightweight Network for Real-time Underwater Image Enhancement

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Haodong Xu, Jisheng Lin, Zhiliang He, Jianping The Department of Computer Science Shanghai Jiao Tong University China The Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China The School of Ocean and Civil Engineering Shanghai Jiao Tong University State Key Laboratory of Ocean Engineering Shanghai200240 China

computer vision techniques have empowered underwater robots to effectively undertake a multitude of tasks, including object tracking and path planning. However, underwater optical factors like light refraction and absorption present challenges to underwater vision, which cause degradation of underwater images. A variety of underwater image enhancement methods have been proposed to improve the effectiveness of underwater vision perception. Nevertheless, for real-time vision tasks on underwater robots, it is necessary to overcome the challenges associated with algorithmic efficiency and real-time capabilities. In this paper, we introduce Lightweight Underwater Unet (LU2Net), a novel U-shape network designed specifically for real-time enhancement of underwater images. The proposed model incorporates axial depthwise convolution and the channel attention module, enabling it to significantly reduce computational demands and model parameters, thereby improving processing speed. The extensive experiments conducted on the dataset and real-world underwater robots demonstrate the exceptional performance and speed of proposed model. It is capable of providing well-enhanced underwater images at a speed 8 times faster than the current state-of-the-art underwater image enhancement method. Moreover, LU2Net is able to handle real-time underwater video enhancement. Copyright © 2024, The Authors. All rights reserved.

关键词： Motion planning

A Single-Cell Clustering Algorithm Based on Structure Perturbation Non-Negative Matrix Factorization

学校读者我要写书评

暂无评论

A Single-Cell Clustering Algorithm Based on Structure Pertur...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hanjing Jiang Meineng Wang Luping Zhang Yu-An Huang Yangyuan Li Yabing Huang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology China University of Mining and Technology Xuzhou China School of Mathematics and Computer Science Yichun University Yichun China School of Information Engineering East China University of Technology Nanchang China School of Computer Science Northwestern Polytechnical University Xi’an China Department of Pathology Renmin Hospital of Wuhan University Wuhan China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The advent of single-cell RNA sequencing (scRNA-seq) has facilitated the acquisition of high-resolution data regarding cell heterogeneity across various tissues. A fundamental and critical step in the analysis of scRNA-seq data is cell type identification. An appropriate graph construction strategy can reflect the topological structure between cells and allows for detailed exploration of the relationships between cells and genes. Given the sparsity of scRNA-seq data and the pronounced noise generated by shallow sequencing, choosing an appropriate graph construction strategy has become a significant challenge. In this paper, we propose a single-cell clustering method, named Sc-PNNMF, based on structural perturbation of nonnegative matrix factorization. Sc-PNNMF employs a structural perturbation algorithm to optimize the gene expression matrix. The optimized matrix guides the matrix factorization process, effectively overcoming the impact of data sparsity and significant noise in gene expression data on the graph construction strategy. We compared the clustering abilities of Sc-PNNMF with five other methods on ten real datasets.

关键词： Sequential analysis Perturbation methods Clustering methods RNA Noise Clustering algorithms Sparse matrices Gene expression Unsupervised learning Periodic structures

Efficient Time-Delay System Optimization with Auto-Configured Metaheuristics

学校读者我要写书评

暂无评论

Efficient Time-Delay System Optimization with Auto-Configure...

IEEE International Conference on Systems, Man and Cybernetics

作者： Roman Senkerik Aleksander Byrski Hubert Guzowski Peter Janku Tomas Kadavy Zuzana Kominkova Oplatkova Radek Matusu Michal Pluhacek Libor Pekar Maciej Smolka Adam Viktorin Department of Informatics and Artificial Intelligence A.I. Lab Faculty of Applied Informatics Tomas Bata University in Zlin Czech Republic Department of Automation and Control Engineering Faculty of Applied Informatics Tomas Bata University in Zlin Czech Republic Institute of Computer Science AGH University of Science and Technology Krakow Poland

This paper presents an experimental study that compares the performance of four selected metaheuristic algorithms for optimizing a time delay system model. Time delay system models are complex and challenging to optimize due to their inherent characteristics, such as non-linearity, multi-modality, and constraints. The study includes an explanation of the choice and core functionality of the selected algorithms, which are both baseline and state-of-the-art variants of self-organizing migrating algorithm (SOMA), state-of-the-art variant from the Success-History-based Adaptive Differential Evolution family of algorithms, with emphasis on diverse search (DISH algorithm), and Covariance Matrix Adaptation Evolution Strategy (CMA-ES) algorithm. The hyperparameters of the metaheuristic algorithms were set using the iRace automatic algorithm configuration framework. The paper emphasizes the importance of metaheuristic algorithms in control engineering for time-delay systems to develop more effective and efficient control strategies and precise model identifications. The experimental results highlight the effectiveness of the state-of-the-art algorithms with specific adaptive mechanisms like population organization process, diverse search and adaptation mechanisms ensuring a gradual transition from exploration to exploitation. Overall, this study contributes to understanding the challenges and advantages of using metaheuristic algorithms in control engineering for time delay systems. The results provide valuable insights into the performance of modern metaheuristic algorithms and can help guide the selection of appropriate adaptive mechanisms of metaheuristics.

关键词：

Towards a Test Framework for Reactive (Type 2) Asset Administration Shell Implementations

学校读者我要写书评

暂无评论

Towards a Test Framework for Reactive (Type 2) Asset Adminis...

International Conference on Emerging Technologies and Factory automation (ETFA)

作者： Torben Miny Sebastian Heppner Igor Garmaev Marko Ristin Björn Otto Nico Braunisch Michael Jacoby Tobias Kleinert Hans Wernher van de Venn Martin Wollschlaeger Chair of Information and Automation Systems RWTH Aachen University Aachen Germany Institute of Mechatronic Systems Zurich University of Applied Sciences (ZHAW) Zurich Switzerland Institute for Automation and Communication Otto von Guericke University Magdeburg Germany Institute of Applied Computer Science TU Dresden Dresden Germany Department Information Management and Production Control (ILT) Fraunhofer IOSB Karlsruhe Germany

ISBN: (数字)9798350361230

ISBN: (纸本)9798350361247

As Industrie 4.0 (I4.0) technologies continue to advance, ensuring the reliability and robustness of emerging standards like Asset Administration Shells (AAS) becomes paramount. This paper introduces a comprehensive testing approach for reactive (a.k.a. Type 2) AAS implementations, addressing the challenges posed by their intricate and dynamic nature. Our methodology adopts a design-by-contract approach to formalize API behavior. We design the client as a test oracle, where code contracts extensively validate the AAS operations, their interactions and effects. The related test cases cover various operation chains, including superpaths, service specifications, and serialization modifiers. The objective of this approach is to enhance the reliability and effectiveness of testing in the evolving landscape of AAS Type 2 implementations.

关键词： Industries Codes Robustness Standards Manufacturing automation Contracts Testing

Relational Prompt-based Pre-trained Language Models for Social Event Detection

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Pu, L.I. Xiaoyan, Y.U. Peng, Hao Xian, Yantuan Wang, Linqin Li, S.U.N. Zhang, Jingyun Philip, S.Y.U. Faculty of Information Engineering and Automation Yunnan Key Laboratory of Artificial Intelligence Kunming University of Science and Technology Kunming650500 China School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China School of Cyber Science and Technology Beihang University No. 37 Xue Yuan Road Haidian District Beijing100191 China School of Control and Computer Engineering North China Electric Power University Beijing102206 China Department of Computer Science University of Illinois at Chicago ChicagoIL60607 United States

Social Event Detection (SED) aims to identify significant events from social streams, and has a wide application ranging from public opinion analysis to risk management. In recent years, Graph Neural Network (GNN) based solutions have achieved state-of-the-art performance. However, GNN-based methods often struggle with missing and noisy edges between messages, affecting the quality of learned message embedding. Moreover, these methods statically initialize node embedding before training, which, in turn, limits the ability to learn from message texts and relations simultaneously. In this paper, we approach social event detection from a new perspective based on Pre-trained Language Models (PLMs), and present RPLM (Relational prompt-based Pre-trained Language Models for Social Event Detection). We first propose a new pairwise message modeling strategy to construct social messages into message pairs with multi-relational sequences. Secondly, a new multi-relational prompt-based pairwise message learning mechanism is proposed to learn more comprehensive message representation from message pairs with multi-relational prompts using PLMs. Thirdly, we design a new clustering constraint to optimize the encoding process by enhancing intra-cluster compactness and inter-cluster dispersion, making the message representation more distinguishable. We evaluate the RPLM on three real-world datasets, demonstrating that the RPLM model achieves state-of-the-art performance in offline, online, low-resource, and long-tail distribution scenarios for social event detection tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Risk assessment

The applied principles of EEG analysis methods in neuroscience and clinical neurology

学校读者我要写书评

暂无评论

Military Medical Research 2024年第6期11卷 907-941页

作者： Hao Zhang Qing-Qi Zhou He Chen Xiao-Qing Hu Wei-Guang Li Yang Bai Jun-Xia Han Yao Wang Zhen-Hu Liang Dan Chen Feng-Yu Cong Jia-Qing Yan Xiao-Li Li School of Systems Science Beijing Normal UniversityBeijing 100875China College of Electrical and Control Engineering North China University of TechnologyBeijing 100041China School of Automation Science and Engineering South China University of TechnologyGuangzhou 510641China Department of Psychology the State Key Laboratory of Brain and Cognitive Sciencesthe University of Hong KongHong Kong SAR 999077China HKU-Shenzhen Institute of Research and Innovation Shenzhen 518057GuangdongChina Department of Health Technology and Informatics the Hong Kong Polytechnic UniversityHong Kong SAR 999077China Department of Rehabilitation Medicine the First Afliated Hospital of Nanchang UniversityNanchang 330006China Rehabilitation Medicine Clinical Research Center of Jiangxi Province Nanchang 330006China Beijing Key Laboratory of Learning and Cognition School of PsychologyCapital Normal UniversityBeijing 100048China School of Communication Science Beijing Language and Culture UniversityBeijing 100083China Institute of Electrical Engineering Yanshan UniversityQinhuangdao 066004HebeiChina School of Computer Science Wuhan UniversityWuhan 430072China School of Biomedical Engineering Faculty of Electronic Information and Electrical EngineeringDalian University of TechnologyDalian 116081LiaoningChina Guangdong Artifcial Intelligence and Digital Economy Laboratory(Guangzhou) Guangzhou 510335China.

Electroencephalography(EEG)is a non-invasive measurement method for brain *** to its safety,high resolution,and hypersensitivity to dynamic changes in brain neural signals,EEG has aroused much interest in scientific research and medical *** article reviews the types of EEG signals,multiple EEG signal analysis methods,and the application of relevant methods in the neuroscience feld and for diagnosing neurological ***,3 types of EEG signals,including time-invariant EEG,accurate event-related EEG,and random event-related EEG,are ***,5 main directions for the methods of EEG analysis,including power spectrum analysis,time-frequency analysis,connectivity analysis,source localization methods,and machine learning methods,are described in the main section,along with diferent sub-methods and effect evaluations for solving the same ***,the application scenarios of different EEG analysis methods are emphasized,and the advantages and disadvantages of similar methods are *** article is expected to assist researchers in selecting suitable EEG analysis methods based on their research objectives,provide references for subsequent research,and summarize current issues and prospects for the future.

关键词： Electroencephalogram analysis methods Applied principles Neuroscience Diagnosis Neurological diseases