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

Image Processing, computer Vision and Machine Learning (ICICML), International Conference on

作者： Yuqing Wu Jun Wang Rui Wang Jian Wang Kecheng Zhou Xiaoxin Zhang School of Computer Science and Technology Shenyang University of Chemical Technology Key Laboratory of Industrial Intelligence Technology on Chemical Process Liaoning Province Shenyang China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang China Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Department of Emergency Zhongyi Northeast International Hospital Co. Ltd. Shenyang China

ISBN: (数字)9798350355413

ISBN: (纸本)9798350355420

This paper presents a cardiac MRI image segmentation model based on an improved U-Net architecture. Accurate segmentation of cardiac MRI images is critical for the diagnosis and treatment of cardiovascular diseases, yet existing U-Net models exhibit limitations in handling complex cardiac structures and multi-scale features. To address these challenges, this paper proposes two key enhancements. First, we propose a Multi-Dimensional Context Attention module, designed to improve the integration of global and local information within the skip connections, thereby enhancing segmentation accuracy for intricate cardiac structures. Furthermore, we propose a Reverse Feature Modulation module, which generates reverse masks and dynamically adjusts feature weights across different classes using adaptive weighting, effectively mitigating class imbalance issues in multi-class segmentation tasks and improving focus on difficult-to-segment regions. Experimental results demonstrate that the proposed model outperforms the standard U-Net on the ACDC dataset, achieving significant improvements in evaluation metrics such as the Dice coefficient. These enhancements underscore the model's efficacy and robustness in complex cardiac image segmentation tasks, offering new technical support for automated cardiovascular disease diagnosis.

关键词： Image segmentation Accuracy Magnetic resonance imaging Computational modeling Modulation Context awareness Robustness Medical diagnosis Cardiovascular diseases Context modeling

来源：评论

学校读者我要写书评

暂无评论

Prototype Model of an IoT-based Digital and Smart Door Locking System with Enhanced Security

Prototype Model of an IoT-based Digital and Smart Door Locki...

引用

International Conference on Mathematics, Actuarial science, computer science and Statistics (MACS)

作者： M. Adil Khan Kashif Nisar Ehtisham Lodhi Jawad Khan Muhammad Imran Khan Tariq Rahim Soomro Sana Nisar Department of Computer Science and Technology Chang'an University Xi'an China Victorian Institute of Technology (VIT) Adelaide South Australia The SKL for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Department Computer Science Abbottabad University of Science and Technology Havelian KP Pakistan Department of Computer Science Abdul Wali Khan University Mardan Pakistan CCSIS Institute of Business Management Karachi Pakistan Faculty of Computing and Informatics University Malaysia Sabah Jalan UMS Kota Kinabalu Sabah Malaysia

ISBN: (纸本)9781665460729

Biometric-based digital door locking system plays a significant role in providing authentication, reducing the workforce in smart homes, and building automation scenarios. This paper proposes a prototype model of an IoT-based Smart Door Locking System (SDLS) with reliable double-access authentication. The IoT and biometric technology authentication mechanism is adopted to make SDLS more secure and reachable with the alert mechanism on unauthorized access. The SDLS contains a biometric scanner, and a thumb impression is made either from a mobile or a biometric-mounted device on the door and both are connected to the centralized cloud-hosted real-time database. The proposed system was tested in real-time and has shown competitive results compared to other Radio-Frequency Identification (RFID) and password-based door locks. Hence, the overall performance efficiency of SDLS is satisfactory and provides biometric-based remote access to control and monitor door locks with the alert system on unauthorized access.

关键词： Biometrics (access control) Biological system modeling Authentication Prototypes Smart homes Real-time systems Security

来源：评论

学校读者我要写书评

暂无评论

FusionPlanner: A Multi-task Motion Planner for Mining Trucks via Multi-sensor Fusion

arXiv

引用

arXiv 2023年

作者： Teng, Siyu Li, Luxi Li, Yuchen Hu, Xuemin Li, Lingxi Ai, Yunfeng Chen, Long Department of Computer Science Hong Kong Baptist University Hong Kong Department of Computer Science BNU-HKBU United International College Zhuhai China The School of Artificial Intelligence Hubei University Wuhan China Waytous Inc. Haidian Distinct Beijing China Indianapolis United States School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences China

In recent years, significant achievements have been made in motion planning for intelligent vehicles. However, as a typical unstructured environment, open-pit mining attracts limited attention due to its complex operational conditions and adverse environmental factors. A comprehensive paradigm for unmanned transportation in open-pit mines is proposed in this research. Firstly, we propose a multi-task motion planning algorithm, called FusionPlanner, for autonomous mining trucks by the multi-sensor fusion method to adapt both lateral and longitudinal control tasks for unmanned transportation. Then, we develop a novel benchmark called MiningNav, which offers three validation approaches to evaluate the trustworthiness and robustness of well-trained algorithms in transportation roads of open-pit mines. Finally, we introduce the Parallel Mining Simulator (PMS), a new high-fidelity simulator specifically designed for open-pit mining scenarios. PMS enables the users to manage and control open-pit mine transportation from both the single-truck control and multi-truck scheduling perspectives. The performance of FusionPlanner is tested by MiningNav in PMS, and the empirical results demonstrate a significant reduction in the number of collisions and takeovers of our planner. We anticipate our unmanned transportation paradigm will bring mining trucks one step closer to trustworthiness and robustness in continuous round-the-clock unmanned transportation. Copyright © 2023, The Authors. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

A Prediction Approach Based on Long Short-Term Memory Networks for Dynamic Multiobjective Optimization

SSRN

引用

SSRN 2024年

作者： Xu, Biao Rang, Gejie Li, Wenji Fan, Zhun Gong, Dunwei Yang, Shengxiang He, Jie College of Engineering Shantou University Shantou515063 China College of Automation and Electronic Engineering Qingdao University of Science and Technology Qingdao266100 China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Wuzhou543002 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom School of Energy and Mechanical Engineering Nanchang Institute of Technology Nanchang330013 China Minjiang University China

Dynamic multiobjective optimization problems (DMOPs) have posed considerable hurdles for traditional evolutionary optimization techniques due to the perpetual variations in their Pareto-optimal sets (PSs) and fronts (PFs). Prediction-based methods have shown promise in swiftly tracking these alterations. However, the majority of current methods rely on linear models to anticipate changing PSs, which can be limiting. When PSs across different environments exhibit nonlinear patterns, accurately predicting the PS in a novel problem becomes challenging. To address this issue, this study introduces a dynamic multiobjective evolutionary optimization algorithm leveraging long short-term memory (LSTM) network predictions. In our approach, the PS of each problem is first divided into several clusters, and the center of each cluster can then be obtained. Thereafter, the cluster centers for the PSs of the problems with different environments form a number of time series. Subsequently, the LSTM network models are trained using the time seriesdata as training samples. Furthermore, the cluster centers of the new PS are predicted utilizing the trained models. LSTM networks excel at capturing historical information and modeling nonlinear relationships, ensuring high prediction accuracy. To enhance the algorithm’s performance, a novel population-generation strategy is employed, ensuring a well-converged and diverse initial population. The proposed algorithm is rigorously tested using benchmark functions, and the results demonstrate its effectiveness in handling DMOPs, outperforming state-of-the-art algorithms. © 2024, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Prediction Approach Based on Long Short-Term Memory Networks for Dynamic Multiobjective Optimization

SSRN

引用

SSRN 2024年

作者： Xu, Biao Rang, Gejie Li, Wenji Gong, Dunwei Fan, Zhun Yang, Shengxiang He, Jie College of Engineering Shantou University Shantou515063 China College of Automation and Electronic Engineering Qingdao University of Science and Technology Qingdao266100 China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Wuzhou543002 China Shenzhen institute for Advanced Study UESTC Shenzhen518110 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom Minjiang University China

Dynamic multiobjective optimization problems (DMOPs) present significant challenges to conventional evolutionary optimization methods because of the continuous changes in their Pareto-optimal sets (PSs) and fronts (PFs). Prediction-driven approaches have demonstrated potential in rapidly adapting to these changes. However, many existing methods depend on linear models to forecast the evolving PSs, which may be restrictive. To counteract this limitation, this research presents a novel dynamic multiobjective evolutionary optimization algorithm that incorporates predictions from long short-term memory (LSTM) networks. Initially, in our methodology, the PS for each problem is segmented into multiple clusters, and the centroid of each cluster is identified. These cluster centroids, representing the PSs across various environmental conditions, are then transformed into a series of time series data. The LSTM network models are subsequently trained on this time series data as input samples. Utilizing these refined models, the centroids of the evolving PSs are predicted with improved precision. Moreover, to enhance the performance of the algorithm, an innovative population-generation strategy is also introduced that guarantees a well-converged and diverse starting population. Our proposed algorithm undergoes rigorous testing using benchmark functions, and the outcomes validate its proficiency in tackling DMOPs, showing superior performance compared to existing state-of-the-art algorithms. © 2024, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Spatial-temporal Transformer for Skeleton-based Action Recognition

Spatial-temporal Transformer for Skeleton-based Action Recog...

引用

2021 China automation Congress, CAC 2021

作者： Zhang, Qipeng Liu, Kexin Wang, Tian Shi, Peng Zhang, Mengyi Snoussi, Hichem School of Automation Science and Electrical Engineering Beihang University Beijing China Jiangsu Key Laboratory of Image and Video Understanding for Social Safety Nanjing University of Science and Technology Nanjing China Institute of Artificial Intelligence Beihang University Beijing China School of Mathematics and Computer Science Fujian Normal University Fujian China College of Electrical Engineering and Control Science Nanjing Tech University Nanjing China Institute Charles Delaunay-LM2S University of Technology of Troyes Troyes France

ISBN: (纸本)9781665426473

In the area of skeleton-based human action recognition, GCN has achieved good results in previous research due to its excellent modeling ability on graph data. Recently, transformers have achieved extraordinary results in many computer vision fields. Comparing transformer and GCN, from a certain point of view, we can regard transformer as a kind of dynamic GCN, and the weight of each node is dynamically determined by data. In this work, a three-dimensional position encoding was proposed by us to solve the representation of node spatial information, in order to apply the transformer to the graph data. In addition, similar to Spatial-Temporal Graph Convolutional Networks (ST-GCN), we proposed a Space-Time Transformer (ST-TR), which applies transformers in space and time to extract spatiotemporal feature of skeleton data to complete action recognition. © 2021 IEEE

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

RLSAC: Reinforcement Learning enhanced Sample Consensus for End-to-End Robust Estimation

arXiv

引用

arXiv 2023年

作者： Nie, Chang Wang, Guangming Liu, Zhe Cavalli, Luca Pollefeys, Marc Wang, Hesheng Department of Automation Key Laboratory of System Control and Information Processing Ministry of Education Shanghai Jiao Tong University China MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University China Department of Computer Science ETH Zürich Switzerland Microsoft Mixed Reality AI Zürich Lab Switzerland

Robust estimation is a crucial and still challenging task, which involves estimating model parameters in noisy environments. Although conventional sampling consensus-based algorithms sample several times to achieve robustness, these algorithms cannot use data features and historical information effectively. In this paper, we propose RLSAC, a novel Reinforcement Learning enhanced SAmple Consensus framework for end-to-end robust estimation. RLSAC employs a graph neural network to utilize both data and memory features to guide exploring directions for sampling the next minimum set. The feedback of downstream tasks serves as the reward for unsupervised training. Therefore, RLSAC can avoid differentiating to learn the features and the feedback of downstream tasks for end-to-end robust estimation. In addition, RLSAC integrates a state transition module that encodes both data and memory features. Our experimental results demonstrate that RLSAC can learn from features to gradually explore a better hypothesis. Through analysis, it is apparent that RLSAC can be easily transferred to other sampling consensus-based robust estimation tasks. To the best of our knowledge, RLSAC is also the first method that uses reinforcement learning to sample consensus for end-to-end robust estimation. We release our codes at https://***/IRMVLab/RLSAC. © 2023, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Model Free Adaptive control Algorithm based on ReOSELM for Autonomous Driving Vehicles

Model Free Adaptive Control Algorithm based on ReOSELM for A...

引用

第40届中国控制会议

作者： Xiaofei Zhang Hongbin Ma Zhichao Wang Mingyu Fan Bolin Zhao School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology The College of Computer Science and Artificial Intelligence Wenzhou University

Different road conditions and dynamic environment bring significant challenges to the control system of autonomous driving vehicle（ADV）. As is known, historical data collected from ADV contains valuable information about control systems,therefore, it is a promising thing to study adaptive control algorithms that have certain learning ability. In order to improve the control performance of ADV and the efficiency in data usage, in this paper, a model free adaptive control algorithm based on regularized online sequential extreme learning machine（ReOSELM） is introduced, it is difficult to analyze the algorithm based on neural network, and the system stability by improved update algorithm of ReOSELM is proved. Simulation results indicate that the proposed algorithm is effective in improving control precision when ADV is turning, and experimental results on an autonomous driving vehicle show that this algorithm is effective in real environment.

关键词： data-driven control autonomous driving vehicle model free adaptive control regularized online sequential extreme learning machine

来源：评论

学校读者我要写书评

暂无评论

EDOLAB: An Open-Source Platform for Education and Experimentation with Evolutionary Dynamic Optimization Algorithms

arXiv

引用

arXiv 2023年

作者： Peng, Mai Yazdani, Delaram She, Zeneng Yazdani, Danial Luo, Wenjian Li, Changhe Branke, Juergen Nguyen, Trung Thanh Gandomi, Amir H. Yang, Shengxiang Jin, Yaochu Yao, Xin School of Automation China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Research Institute Faculty of Engineering and Technology Liverpool John Moores University United Kingdom School of Computer Science and Technology Harbin Institute of Technology China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and Technology Harbin Institute of Technology Peng Cheng Laboratory China School of Artificial Intelligence Anhui University of Sciences & Technology China Information Systems Management and Analytics in Warwick Business School University of Warwick United Kingdom Faculty of Engineering & Information Technology University of Technology Sydney Australia Obuda University Hungary School of Computer Science and Informatics De Montfort University United Kingdom Department of Artificial Intelligence School of Engineering Westlake University China School of Computer Science University of Birmingham United Kingdom

Many real-world optimization problems exhibit dynamic characteristics, posing significant challenges for traditional optimization techniques. Evolutionary Dynamic Optimization Algorithms (EDOAs) are designed to address these challenges effectively. However, in existing literature, the reported results for a given EDOA can vary significantly. This inconsistency often arises because the source codes for many EDOAs, which are typically complex, have not been made publicly available, leading to error-prone re-implementations. To support researchers in conducting experiments and comparing their algorithms with various EDOAs, we have developed an open-source MATLAB platform called the Evolutionary Dynamic Optimization LABoratory (EDOLAB). This platform not only facilitates research but also includes an educational module designed for instructional purposes. The education module allows users to observe: a) a 2-dimensional problem space and its morphological changes following each environmental change, b) the behaviors of individuals over time, and c) how the EDOA responds to environmental changes and tracks the moving optimum. The current version of EDOLAB features 25 EDOAs and four fully parametric benchmark generators. © 2023, CC BY-NC-SA.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Research and optimization of conflict search algorithm for multi-agent path planning based on incremental heuristic 2

Research and optimization of conflict search algorithm for m...

引用

2nd International Conference on computer Vision and Data Mining, ICVDM 2021

作者： Li, Yang Wang, Jun Zhang, Hualiang School of Computer Science Shenyang University of Chemical Technology Shenyang110142 China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang110016 China Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang110169 China

Conflict Based Search(CBS) is used for multi-agent Pathfinding (MAPF) to enable each Agent to reach the target node. The CBS algorithm uses the heuristic algorithm A* search to calculate the MAPF solution, and the path planning uses forward search, which cannot explore the path of the unknown region. On this basis, this paper proposes that, in the case of unknown map and changing environment at any time, when encountering new obstacles, the information obtained from previous search should be used without completely replanning the path. Because of the idea of incremental programming, the number of reprogramming times and the number of affected nodes can be reduced. The optimized algorithm consumes less time and memory, and improves the efficiency of path planning. © 2021 institute of Physics Publishing. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：