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

27th International Conference on Pattern Recognition, ICPR 2024

作者： Ray, Amartya Gayen, Soumyajit Kaplun, Dmitrii Sarkar, Ram Department of Computer Science and Engineering Jadavpur University Kolkata India Artificial Intelligence Research Institute China University of Mining and Technology Xuzhou China Department of Automation and Control Processes Saint Petersburg Electrotechnical University "LETI" Saint Petersburg Russia

ISBN: (纸本)9783031781032

Skin cancer poses a serious global health challenge, where timely and precise diagnosis is essential to improve patient outcomes. Recently, neural networks have proven to be highly effective tools for automated skin cancer classification, significantly advancing the field of dermatology. This paper introduces a novel approach to generate edge maps from dermoscopic images using a holistically nested edge detector model. These edge maps enhance the detection of shape and symmetry irregularities, which are key indicators of malignancy, and improve the focus on relevant regions of interest. We then propose an edge-guided dual-branch neural network, called EDB-Net, for the classification task. Branch 1 handles edge maps, while Branch 2 processes original dermoscopic images. To highlight significant regions and focus on specific lesion areas, we incorporate a novel channel-spatial synergistic attention block within Branch 2. Additionally, we introduce a unique strategy to modulate the generated attention maps using edge features extracted from the edge maps in Branch 1, creating edge-guided features that refine the overall feature representation. In the final stage, both edge-guided and attention-aided features are combined, producing more distinct and contextually relevant outputs, thereby significantly enhancing classification performance. Our model achieves accuracies of 0.927 and 0.848 on the challenging HAM10000 and ISIC 2016 datasets, respectively, without employing any data augmentation. The source code of the proposed model is available at: https://***/Cmatermedicalimageanalysis/EDB_Net. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

Multiple Robots Autonomous Task Planning Based on Improved Genetic Algorithm

Multiple Robots Autonomous Task Planning Based on Improved G...

引用

IEEE International Conference on Robotics and Biomimetics

作者： Zhiyuan Yang Qingjie Zhao Xingchen Lv Lei Wang Wangwang Liu School of Computer Science and Technology Beijing Institute of Technology Beijing China Beijing Institute of Control Engineering Beijing China

ISBN: (数字)9798331509644

ISBN: (纸本)9798331509651

This paper presents an autonomous task planning method for multiple collecting robots on improved genetic algorithm. Considering the limited capacity of collecting robots and the suitability of hopping robots in the microgravity environment of small celestial bodies, we developed a task planning model based on the Capacitated Vehicle Routing Problem (CVRP) and proposed an improved genetic algorithm to simultaneously allocate tasks and plan paths for multiple collecting robots. During robot movement, the A * algorithm is employed for active obstacle avoidance when unknown obstacles are encountered. Experimental results demonstrated that our algorithm, can efficiently allocate tasks for the robot group, and each robot actively avoiding obstacles during movement.

关键词： Vehicle routing Wheels Path planning Planning Safety Resource management Mobile robots Robots Genetic algorithms Capacity planning

来源：评论

学校读者我要写书评

暂无评论

Landing location planning based on genetic cooperative particle swarm optimization

Landing location planning based on genetic cooperative parti...

引用

International Symposium on Autonomous Systems (ISAS)

作者： Xinyu Yao Qingjie Zhao Xingchen Lv Lei Wang Wangwang Liu School of Computer Science & Technology Beijing Institute of Technology Beijing China Beijing Institute of Control Engineering Beijing China

ISBN: (数字)9798350363173

ISBN: (纸本)9798350363180

Being able to safely land on the surface is one of the primary challenges when a probe exploring an asteroid. In order to ensure landing safety, the landing location planning needs to comprehensively consider the terrain characteristics and avoid obstacles such as protruding rocks, craters and slopes. Relatively flat areas are suitable for landing. If multiple landers are landing together, in order to avoid collisions and maintain good communication, appropriate distance should be maintained between the landers. In this paper, we first establish a landing environment model, and then propose a landing location planning method for a lander-group using genetic cooperative particle swarm optimization (GCPSO), which ensures the autonomous movement of individual landers while maintaining a certain safe landing distance between them. Taking a group of three landers as an example, simulation experiments show that the algorithm proposed in this paper can ensure the group to achieve stable landing and keep safe distances between them.

关键词： Collaboration Land surface Genetics Rocks Planning Solar system Safety

来源：评论

学校读者我要写书评

暂无评论

A Registration and Fusion Method of 3D Cross-source Point Cloud Data for Modeling Accurate Models of Small Celestial Bodies

A Registration and Fusion Method of 3D Cross-source Point Cl...

引用

IEEE International Conference on Robotics and Biomimetics

作者： Xuan He Qingjie Zhao Xingchen Lv Lei Wang Wangwang Liu School of Computer Science and Technology Beijing Institute of Technology Beijing China Beijing Institute of Control Engineering Beijing China

ISBN: (数字)9798331509644

ISBN: (纸本)9798331509651

High-precision three-dimensional models of small celestial bodies are important for deep space exploration tasks. The homologous point cloud obtained from a single sensor has limitations in terms of accuracy and density. For example, the point cloud obtained by RGB camera has rich information and high density, but low precision. The point cloud obtained by laser scanning has high precision but low density. Therefore, we hope to register and fuse the point clouds obtained from different sensors, synthesize the advantages of cross-source point clouds obtained from different source domains, and improve the density, accuracy and other aspects of small celestial point clouds. To solve the common problems of cross-source point clouds, we adopt an end-to-end feature measurement point cloud registration framework, which does not need to search the corresponding points between two point clouds, and reduces the difficulty of processing cross-source point cloud data. Aiming at the problem that some stray points on the registered point cloud surface affect the accuracy of the point cloud, a point cloud fusion optimization method based on Euclidean distance is proposed. The stray points around the point cloud are removed to reduce the loss of normal points. The accuracy of point cloud is improved by the fusion after registration. Experiments show that the proposed method can effectively improve the density and accuracy of small celestial body models.

关键词： Point cloud compression Solid modeling Accuracy Three-dimensional displays Euclidean distance Feature extraction Data models Space exploration Laser fusion Surface treatment

来源：评论

学校读者我要写书评

暂无评论

Interior Scene Intelligent Generated for Smart Homes Based on GAN-ID Algorithms

Journal of Network Intelligence

引用

Journal of Network Intelligence 2024年第2期9卷 1046-1055页

作者： Zhang, Fu-Quan Ma, Lin-Juan Zhou, Jun-Xian Wang, Run-Hong Zhang, Guang-Zhen College of Computer and Control Engineering Minjiang University Fuzhou China Digital Media Art Key Laboratory of Sichuan Province Sichuan Conservatory of Music Chengdu China Fuzhou Technology Innovation Center of Intelligent Manufacturing Information System Minjiang University Fuzhou China Fujian Province University Fuzhou China School of Computer Science and Technology Beijing Institute of Technology Beijing China Minjiang University Fuzhou China Information Media School of Tianjin Technician Institute of Mechanical & Electrical Technology Tianjin China

The purpose of this paper is to present a new GAN-ID algorithm to gener-ate interior scene intelligently based on Artificial Intelligence of Things (AIoT). Although great progress has been made when GAN algorithm applied in smart homes and smart cities, the issue of the trade-off between the accuracy and the efficiency in interior scene has been overlooked. A number of experiments were performed to check the performance and it is indicated that the results of the proposed GAN-ID has great advantages in model sample generation than other common methods when generating interior scene intelligently, which is similar to state-of-the-art. It is meaningful when it can be applied in smart cities and smart homes filed based on AIoT in the future. © 2024, J. Network Intell. All rights reserved.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

Synergistically Learning Class-specific Tokens for Multi-class Whole Slide Image Classification

Synergistically Learning Class-specific Tokens for Multi-cla...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Sun, Pengzhong Wang, Wei Li, Xiangyu Dong, Suyu Li, Shuo Wang, Kuanquan Luo, Gongning Harbin Institute of Technology Faculty of Computing Harbin China Harbin Institute of Technology Faculty of Computing Shenzhen China Northeast Forestry University College of Computer and Control Engineering Harbin China Case Western Reserve University Case School of Engineering Cleveland United States

ISBN: (纸本)9798350337488

The application of transformer architecture in analyzing whole slide images (WSIs) has become increasingly popular due to its remarkable ability to learn complex associations. Nevertheless, a significant drawback emerges in the multiclass analysis of WSIs. The majority of the transformer-based methods available currently rely primarily on a single, class-agnostic token. This approach might not ideally capture the subtleties of class-discriminative information. To address this challenge, we present an innovative approach tailored for multi-class WSI analysis that harnesses the power of class-specific tokens. Central to our method is a novel attention mechanism designed to foster a synergistic learning relationship between patch and class tokens, enhancing the granularity of information captured and ensuring a more comprehensive representation of the WSI. Complementing this, we introduce a dynamic class-centric training strategy designed to optimize token representation learning, ensuring each token is informatively aligned with its corresponding class. Through extensive experimentation on three challenging multi-class WSI analysis datasets, our method consistently demonstrates superior performance, underscoring its potential as a robust solution for multi-class WSI analysis tasks. © 2023 IEEE.

关键词： Multi-class whole slide image analysis Multiple instance learning Transformer

来源：评论

学校读者我要写书评

暂无评论

The differential fault analysis on block cipher FeW

引用

Cybersecurity 2023年第2期6卷 62-74页

作者： Haiyan Xiao Lifang Wang Jinyong Chang School of Computer Science Northwestern Polytechnical UniversityXiAn 710055People's Republic of China Engineering University of PAP XiAn 710055People's Republic of China School of Information and Control Engineering XiAn University of Architecture and TechnologyXi'An 710055People's Republic of China State Key Laboratory of Information Security(SKLOIS) Institute of Information EngineeringChinese Academy of SciencesBeijing 100089People's Republic of China

Feather weight(FeW)cipher is a lightweight block cipher proposed by Kumar et *** 2019,which takes 64 bits plaintext as input and produces 64 bits *** Kumar et ***,FeW is a software oriented design with the aim of achieving high efficiency in software based *** seems that FeW is immune to many cryptographic attacks,like linear,impossible differential,differential and zero correlation ***,in recent work,Xie et *** the security of *** precisely,they proved that under the differential fault analysis(DFA)on the encryption states,an attacker can completely recover the master secret *** this paper,we revisit the block cipher FeW and consider the DFA on its key schedule algorithm,which is rather popular cryptanalysis for kinds of block *** particular,by respectively injected faults into the 30th and 29th round subkeys,one can recover about 55/80~69%bits of master *** the brute force searching remaining bits,one can obtain the full master secret *** simulations and experiment results show that our analysis is practical.

关键词： Differential fault analysis Block cipher FeW Side channel attack

来源：评论

学校读者我要写书评

暂无评论

Kernel-based multi-step predictors for data-driven analysis and control of nonlinear systems through the velocity form

arXiv

引用

arXiv 2024年

作者： Verhoek, Chris Tóth, Roland The Control Systems group The Dept. of Electrical Engineering The Eindhoven University of Technology Netherlands The Institute for Computer Science and Control Budapest Hungary

We propose kernel-based approaches for the construction of a single-step and multi-step predictor of the velocity form of nonlinear (NL) systems, which describes the time-difference dynamics of the corresponding NL system and admits a highly structured representation. The predictors in turn allow to formulate completely data-driven representations of the velocity form. The kernel-based formulation that we derive, inherently respects the structured quasi-linear and specific time-dependent relationship of the velocity form. This results in an efficient multi-step predictor for the velocity form and hence for nonlinear systems. Moreover, by using the velocity form, our methods open the door for data-driven behavioral analysis and control of nonlinear systems with global stability and performance guarantees. © 2024, CC BY-NC-SA.

关键词： Nonlinear simulations

来源：评论

学校读者我要写书评

暂无评论

Truthful Matching with Online Items and Offline Agents 50

Truthful Matching with Online Items and Offline Agents

引用

50th International Colloquium on Automata, Languages, and Programming, ICALP 2023

作者： Feldman, Michal Fusco, Federico Mauras, Simon Reiffenhäuser, Rebecca Blavatnik School of Computer Science Tel Aviv University Israel Microsoft Research Herzliya Israel Department of Computer Control and Management Engineering "Antonio Ruberti" Sapienza University of Rome Italy Institute for Logic Language and Computation University of Amsterdam Netherlands

ISBN: (纸本)9783959772785

We study truthful mechanisms for welfare maximization in online bipartite matching. In our (multiparameter) setting, every buyer is associated with a (possibly private) desired set of items, and has a private value for being assigned an item in her desired set. Unlike most online matching settings, where agents arrive online, in our setting the items arrive online in an adversarial order while the buyers are present for the entire duration of the process. This poses a significant challenge to the design of truthful mechanisms, due to the ability of buyers to strategize over future rounds. We provide an almost full picture of the competitive ratios in different scenarios, including myopic vs. non-myopic agents, tardy vs. prompt payments, and private vs. public desired sets. Among other results, we identify the frontier up to which the celebrated e/(e − 1) competitive ratio for the vertex-weighted online matching of Karp, Vazirani and Vazirani extends to truthful agents and online items. © Michal Feldman, Federico Fusco, Simon Mauras, and Rebecca Reiffenhäuser.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

Convex Equilibrium-Free Stability and Performance Analysis of Discrete-Time Nonlinear Systems

arXiv

引用

arXiv 2024年

作者： Koelewijn, Patrick J.W. Weiland, Siep Tóth, Roland Control Systems Group Department of Electrical Engineering Eindhoven University of Technology Netherlands Systems and Control Laboratory HUN-REN Institute for Computer Science and Control Hungary

This paper considers the equilibrium-free stability and performance analysis of discrete-time nonlinear systems. We consider two types of equilibrium-free notions. Namely, the universal shifted concept, which considers stability and performance w.r.t. all equilibrium points of the system, and the incremental concept, which considers stability and performance between trajectories of the system. In this paper, we show how universal shifted stability and performance of discrete-time systems can be analyzed by making use of the time-difference dynamics. Moreover, we extend the existing results for incremental dissipativity for discrete-time systems based on dissipativity analysis of the differential dynamics to more general state-dependent storage functions for less conservative results. Finally, we show how both these equilibrium-free notions can be cast as a convex analysis problem by making use of the linear parameter-varying framework, which is also demonstrated by means of an example. Copyright © 2024, The Authors. All rights reserved.

关键词： Nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：