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

arXiv 2023年

作者： Roy, Saikat Koehler, Gregor Ulrich, Constantin Baumgartner, Michael Petersen, Jens Isensee, Fabian Jaeger, Paul F. Maier-Hein, Klaus Heidelberg Germany Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Germany Faculty of Mathematics and Computer Science Heidelberg University Germany Helmholtz Imaging German Cancer Research Center Heidelberg Germany NCT Heidelberg A partnership between DKFZ University Medical Center Heidelberg Germany Interactive Machine Learning Group German Cancer Research Center Heidelberg Germany

There has been exploding interest in embracing Transformer-based architectures for medical image segmentation. However, the lack of large-scale annotated medical datasets make achieving performances equivalent to those in natural images challenging. Convolutional networks, in contrast, have higher inductive biases and consequently, are easily trainable to high performance. Recently, the ConvNeXt architecture attempted to modernize the standard ConvNet by mirroring Transformer blocks. In this work, we improve upon this to design a modernized and scalable convolutional architecture customized to challenges of data-scarce medical settings. We introduce MedNeXt, a Transformer-inspired large kernel segmentation network which introduces – 1) A fully ConvNeXt 3D Encoder-Decoder Network for medical image segmentation, 2) Residual ConvNeXt up and downsampling blocks to preserve semantic richness across scales, 3) A novel technique to iteratively increase kernel sizes by upsampling small kernel networks, to prevent performance saturation on limited medical data, 4) Compound scaling at multiple levels (depth, width, kernel size) of MedNeXt. This leads to state-of-the-art performance on 4 tasks on CT and MRI modalities and varying dataset sizes, representing a modernized deep architecture for medical image segmentation. Our code is made publicly available at: https://***/MIC-DKFZ/MedNeXt. © 2023, CC BY.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Explainability and transparency in the realm of digital humanities: toward a historian XAI

引用

International Journal of Digital Humanities 2023年第2期5卷 299-331页

作者： El-Hajj, Hassan Eberle, Oliver Merklein, Anika Siebold, Anna Shlomi, Noga Büttner, Jochen Martinetz, Julius Müller, Klaus-Robert Montavon, Grégoire Valleriani, Matteo Max Planck Institute for the History of Science Berlin Germany BIFOLD – Berlin Institute for the Foundations of Learning and Data Berlin Germany Machine Learning Group Technische Universität Berlin Berlin Germany German Center for Art History Paris (DFK Paris) Paris France The Cohn Institute for the History and Philosophy of Science and Ideas Faculty of Humanities Tel-Aviv University Tel-Aviv Israel Department of Artificial Intelligence Korea University Seoul South Korea Max Planck Institute for Informatics Saarbrüken Germany Department of Mathematics and Computer Science Freie Universität Berlin Berlin Germany

The recent advancements in the field of Artificial Intelligence (AI) translated to an increased adoption of AI technology in the humanities, which is often challenged by the limited amount of annotated data, as well as its heterogeneity. Despite the scarcity of data it has become common practice to design increasingly complex AI models, usually at the expense of human readability, explainability, and trust. This in turn has led to an increased need for tools to help humanities scholars better explain and validate their models as well as their hypotheses. In this paper, we discuss the importance of employing Explainable AI (XAI) methods within the humanities to gain insights into historical processes as well as ensure model reproducibility and a trustworthy scientific result. To drive our point, we present several representative case studies from the Sphaera project where we analyze a large, well-curated corpus of early modern textbooks using an AI model, and rely on the XAI explanatory outputs to generate historical insights concerning their visual content. More specifically, we show that XAI can be used as a partner when investigating debated subjects in the history of science, such as what strategies were used in the early modern period to showcase mathematical instruments and machines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Uncertainty quantification for sparse Fourier recovery

arXiv

引用

arXiv 2022年

作者： Hoppe, Frederik Krahmer, Felix Verdun, Claudio Mayrink Menzel, Marion I. Rauhut, Holger Mathematics of Information Processing RWTH Aachen University Aachen Germany Department of Mathematics Munich Data Science Institute Technical University of Munich Munich Center for Machine Learning Munich Germany Department of Mathematics Department of Electrical and Computer Engineering Technical University of Munich Munich Center for Machine Learning Munich Germany AImotion Bavaria Faculty of Electrical Engineering and Information Technology Technische Hochschule Ingolstadt Ingolstadt Department of Physics Technical University of Munich Garching and GE Healthcare Munich Germany Department of Mathematics LMU Munich Germany

One of the most prominent methods for uncertainty quantification in high-dimensional statistics is the desparsified LASSO that relies on unconstrained 1-minimization. The majority of initial works focused on real (sub-)Gaussian designs. However, in many applications, such as magnetic resonance imaging (MRI), the measurement process possesses a certain structure due to the nature of the problem. The measurement operator in MRI can be described by a subsampled Fourier matrix. The purpose of this work is to extend the uncertainty quantification process using the desparsified LASSO to design matrices originating from a bounded orthonormal system, which naturally generalizes the subsampled Fourier case and also allows for the treatment of the case where the sparsity basis is not the standard basis. In particular we construct honest confidence intervals for every pixel of an MR image that is sparse in the standard basis provided the number of measurements satisfies n Á maxts log2 s log p, s log2 pu or that is sparse with respect to the Haar wavelet basis provided a slightly larger number of measurements. Copyright © 2022, The Authors. All rights reserved.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Touchstone benchmark: are we on the right way for evaluating AI algorithms for medical segmentation? 24

Touchstone benchmark: are we on the right way for evaluating...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Pedro R. A. S. Bassi Wenxuan Li Yucheng Tang Fabian Isensee Zifu Wang Jieneng Chen Yu-Cheng Chou Saikat Roy Yannick Kirchhoff Maximilian Rokuss Ziyan Huang Jin Ye Junjun He Tassilo Wald Constantin Ulrich Michael Baumgartner Klaus H. Maier-Hein Paul Jaeger Yiwen Ye Yutong Xie Jianpeng Zhang Ziyang Chen Yong Xia Zhaohu Xing Lei Zhu Yousef Sadegheih Afshin Bozorgpour Pratibha Kumari Reza Azad Dorit Merhof Pengcheng Shi Ting Ma Yuxin Du Fan Bai Tiejun Huang Bo Zhao Haonan Wang Xiaomeng Li Hanxue Gu Haoyu Dong Jichen Yang Maciej A. Mazurowski Saumya Gupta Linshan Wu Jiaxin Zhuang Hao Chen Holger Roth Daguang Xu Matthew B. Blaschko Sergio Decherchi Andrea Cavalli Alan L. Yuille Zongwei Zhou Department of Computer Science Johns Hopkins University and Department of Pharmacy and Biotechnology University of Bologna and Center for Biomolecular Nanotechnologies Istituto Italiano di Tecnologia Department of Computer Science Johns Hopkins University NVIDIA Division of Medical Image Computing German Cancer Research Center (DKFZ) and Helmholtz Imaging German Cancer Research Center (DKFZ) ESAT-PSI KU Leuven Division of Medical Image Computing German Cancer Research Center (DKFZ) and Faculty of Mathematics and Computer Science Heidelberg University Division of Medical Image Computing German Cancer Research Center (DKFZ) and Faculty of Mathematics and Computer Science Heidelberg University and HIDSS4Health - Helmholtz Information and Data Science School for Health Shanghai Jiao Tong University Shanghai Artificial Intelligence Laboratory Division of Medical Image Computing German Cancer Research Center (DKFZ) Division of Medical Image Computing German Cancer Research Center (DKFZ) and Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Helmholtz Imaging German Cancer Research Center (DKFZ) and Interactive Machine Learning Group (IML) DKFZ School of Computer Science and Engineering Northwestern Polytechnical University Australian Institute for Machine Learning The University of Adelaide College of Computer Science and Technology Zhejiang University Hong Kong University of Science and Technology (Guangzhou) Hong Kong University of Science and Technology (Guangzhou) and Hong Kong University of Science and Technology Faculty of Informatics and Data Science University of Regensburg Faculty of Electrical Engineering and Information Technology RWTH Aachen University Faculty of Informatics and Data Science University of Regensburg and Fraunhofer Institute for Digital Medicine MEVIS Electronic & Information Engineering School Harbin Institute of Technology (Shenzhen) Shanghai Jiao Tong University and Beijing Academy of Artificial Intelligence (BAAI) S

ISBN: (纸本)9798331314385

How can we test AI performance? This question seems trivial, but it isn't. Standard benchmarks often have problems such as in-distribution and small-size test sets, oversimplified metrics, unfair comparisons, and short-term outcome pressure. As a consequence, good performance on standard benchmarks does not guarantee success in real-world scenarios. To address these problems, we present Touchstone, a large-scale collaborative segmentation benchmark of 9 types of abdominal organs. This benchmark is based on 5,195 training CT scans from 76 hospitals around the world and 5,903 testing CT scans from 11 additional hospitals. This diverse test set enhances the statistical significance of benchmark results and rigorously evaluates AI algorithms across out-of-distribution scenarios. We invited 14 inventors of 19 AI algorithms to train their algorithms, while our team, as a third party, independently evaluated these algorithms. In addition, we also evaluated pre-existing AI frameworks—which, differing from algorithms, are more flexible and can support different algorithms—including MONAI from NVIDIA, nnU-Net from DKFZ, and numerous other open-source frameworks. We are committed to expanding this benchmark to encourage more innovation of AI algorithms for the medical domain.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A scalable generative model for dynamical system reconstruction from neuroimaging data 24

A scalable generative model for dynamical system reconstruct...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Eric Volkmann Alena Brändle Daniel Durstewitz Georgia Koppe Department of Theoretical Neuroscience Central Institute of Mental Health (CIMH) Medical Faculty Mannheim Heidelberg University Mannheim Germany and Institute for Machine Learning Johannes Kepler University Linz Austria Department of Theoretical Neuroscience Central Institute of Mental Health (CIMH) Medical Faculty Mannheim Heidelberg University Mannheim Germany and Interdisciplinary Center for Scientific Computing Heidelberg University Heidelberg Germany and Faculty of Physics and Astronomy Heidelberg University Heidelberg Germany Interdisciplinary Center for Scientific Computing Heidelberg University Heidelberg Germany and Hector Institute for AI in Psychiatry & Dept. for Psychiatry and Psychotherapy CIMH and Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany

ISBN: (纸本)9798331314385

Data-driven inference of the generative dynamics underlying a set of observed time series is of growing interest in machine learning and the natural sciences. In neuroscience, such methods promise to alleviate the need to handcraft models based on biophysical principles and allow to automatize the inference of inter-individual differences in brain dynamics. Recent breakthroughs in training techniques for state space models (SSMs) specifically geared toward dynamical systems (DS) reconstruction (DSR) enable to recover the underlying system including its geometrical (attractor) and long-term statistical invariants from even short time series. These techniques are based on control-theoretic ideas, like modern variants of teacher forcing (TF), to ensure stable loss gradient propagation while training. However, as it currently stands, these techniques are not directly applicable to data modalities where current observations depend on an entire history of previous states due to a signal's filtering properties, as common in neuroscience (and physiology more generally). Prominent examples are the blood oxygenation level dependent (BOLD) signal in functional magnetic resonance imaging (fMRI) or Ca2+ imaging data. Such types of signals render the SSM's decoder model non-invertible, a requirement for previous TF-based methods. Here, exploiting the recent success of control techniques for training SSMs, we propose a novel algorithm that solves this problem and scales exceptionally well with model dimensionality and filter length. We demonstrate its efficiency in reconstructing dynamical systems, including their state space geometry and long-term temporal properties, from just short BOLD time series.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Large-Scale Neutral Comparison Study of Survival Models on Low-Dimensional Data

arXiv

引用

arXiv 2024年

作者： Burk, Lukas Zobolas, John Bischl, Bernd Bender, Andreas Wright, Marvin N. Sonabend, Raphael Department of Statistics LMU Munich Munich Germany Leibniz Institute for Prevention Research and Epidemiology - BIPS Bremen Germany Faculty of Mathematics and Computer Science University of Bremen Bremen Germany Munich Center for Machine Learning Munich Germany Department of Cancer Genetics Institute for Cancer Research Oslo University Hospital Oslo Norway Department of Public Health University of Copenhagen Copenhagen Denmark OSPO Now London United Kingdom Imperial College London London United Kingdom

This work presents the first large-scale neutral benchmark experiment focused on single-event, right-censored, low-dimensional survival data. Benchmark experiments are essential in methodological research to scientifically compare new and existing model classes through proper empirical evaluation. Existing benchmarks in the survival literature are often narrow in scope, focusing, for example, on high-dimensional data. Additionally, they may lack appropriate tuning or evaluation procedures, or are qualitative reviews, rather than quantitative comparisons. This comprehensive study aims to fill the gap by neutrally evaluating a broad range of methods and providing generalizable conclusions. We benchmark 18 models, ranging from classical statistical approaches to many common machine learning methods, on 32 publicly available datasets. The benchmark tunes for both a discrimination measure and a proper scoring rule to assess performance in different settings. Evaluating on 8 survival metrics, we assess discrimination, calibration, and overall predictive performance of the tested models. Using discrimination measures, we find that no method significantly outperforms the Cox model. However, (tuned) Accelerated Failure Time models were able to achieve significantly better results with respect to overall predictive performance as measured by the right-censored log-likelihood. machine learning methods that performed comparably well include Oblique Random Survival Forests under discrimination, and Cox-based likelihood-boosting under overall predictive performance. We conclude that for predictive purposes in the standard survival analysis setting of low-dimensional, right-censored data, the Cox Proportional Hazards model remains a simple and robust method, sufficient for practitioners. © 2024, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Anatomy-informed Data Augmentation for Enhanced Prostate Cancer Detection

arXiv

引用

arXiv 2023年

作者： Kovacs, Balint Netzer, Nils Baumgartner, Michael Eith, Carolin Bounias, Dimitrios Meinzer, Clara Jäger, Paul F. Zhang, Kevin S. Floca, Ralf Schrader, Adrian Isensee, Fabian Gnirs, Regula Görtz, Magdalena Schütz, Viktoria Stenzinger, Albrecht Hohenfellner, Markus Schlemmer, Heinz-Peter Wolf, Ivo Bonekamp, David Maier-Hein, Klaus H. Heidelberg Germany Division of Radiology DKFZ Heidelberg Germany Medical Faculty Heidelberg Heidelberg University Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Germany Helmholtz Imaging DKFZ Heidelberg Germany Interactive Machine Learning Group DKFZ Heidelberg Germany Department of Urology University of Heidelberg Medical Center Germany Junior Clinical Cooperation Unit’Multiparametric methods for early detection of prostate cancer’ DKFZ Heidelberg Germany Institute of Pathology University of Heidelberg Medical Center Germany Mannheim University of Applied Sciences Mannheim Germany Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Heidelberg Germany

Data augmentation (DA) is a key factor in medical image analysis, such as in prostate cancer (PCa) detection on magnetic resonance images. State-of-the-art computer-aided diagnosis systems still rely on simplistic spatial transformations to preserve the pathological label post transformation. However, such augmentations do not substantially increase the organ as well as tumor shape variability in the training set, limiting the model’s ability to generalize to unseen cases with more diverse localized soft-tissue deformations. We propose a new anatomy-informed transformation that leverages information from adjacent organs to simulate typical physiological deformations of the prostate and generates unique lesion shapes without altering their label. Due to its lightweight computational requirements, it can be easily integrated into common DA frameworks. We demonstrate the effectiveness of our augmentation on a dataset of 774 biopsy-confirmed examinations, by evaluating a state-of-the-art method for PCa detection with different augmentation settings. Copyright © 2023, The Authors. All rights reserved.

关键词： Magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

Touchstone Benchmark: Are We on the Right Way for Evaluating AI Algorithms for Medical Segmentation?

arXiv

引用

arXiv 2024年

作者： Bassi, Pedro R.A.S. Li, Wenxuan Tang, Yucheng Isensee, Fabian Wang, Zifu Chen, Jieneng Chou, Yu-Cheng Roy, Saikat Kirchhoff, Yannick Rokuss, Maximilian Huang, Ziyan Ye, Jin He, Junjun Wald, Tassilo Ulrich, Constantin Baumgartner, Michael Maier-Hein, Klaus H. Jaeger, Paul Ye, Yiwen Xie, Yutong Zhang, Jianpeng Chen, Ziyang Xia, Yong Xing, Zhaohu Zhu, Lei Sadegheih, Yousef Bozorgpour, Afshin Kumari, Pratibha Azad, Reza Merhof, Dorit Shi, Pengcheng Ma, Ting Du, Yuxin Bai, Fan Huang, Tiejun Zhao, Bo Wang, Haonan Li, Xiaomeng Gu, Hanxue Dong, Haoyu Yang, Jichen Mazurowski, Maciej A. Gupta, Saumya Wu, Linshan Zhuang, Jiaxin Chen, Hao Roth, Holger Xu, Daguang Blaschko, Matthew B. Decherchi, Sergio Cavalli, Andrea Yuille, Alan L. Zhou, Zongwei Department of Computer Science Johns Hopkins University United States Department of Pharmacy and Biotechnology University of Bologna Italy Center for Biomolecular Nanotechnologies Istituto Italiano di Tecnologia Italy NVIDIA United States Germany Germany ESAT-PSI KU Leuven Belgium Faculty of Mathematics and Computer Science Heidelberg University Germany HIDSS4Health - Helmholtz Information and Data Science School for Health Germany Shanghai Jiao Tong University China Shanghai Artificial Intelligence Laboratory China Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Germany DKFZ Germany School of Computer Science and Engineering Northwestern Polytechnical University China Australian Institute for Machine Learning The University of Adelaide Australia College of Computer Science and Technology Zhejiang University China Hong Kong University of Science and Technology Guangzhou China Hong Kong University of Science and Technology Hong Kong Faculty of Informatics and Data Science University of Regensburg Germany Faculty of Electrical Engineering and Information Technology RWTH Aachen University Germany Fraunhofer Institute for Digital Medicine MEVIS Germany Electronic & Information Engineering School Harbin Institute of Technology Shenzhen China China The Chinese University of Hong Kong Hong Kong Peking University China Department of Electrical and Computer Engineering Duke University United States Stony Brook University United States Department of Computer Science and Engineering Department of Chemical and Biological Engineering Division of Life Science Hong Kong University of Science and Technology Hong Kong Data Science and Computation Facility Fondazione Istituto Italiano di Tecnologia Italy Ecole Polytechnique Fédérale de Lausanne Switzerland

How can we test AI performance? This question seems trivial, but it isn’t. Standard benchmarks often have problems such as in-distribution and small-size test sets, oversimplified metrics, unfair comparisons, and short-term outcome pressure. As a consequence, good performance on standard benchmarks does not guarantee success in real-world scenarios. To address these problems, we present Touchstone, a large-scale collaborative segmentation benchmark of 9 types of abdominal organs. This benchmark is based on 5,195 training CT scans from 76 hospitals around the world and 5,903 testing CT scans from 11 additional hospitals. This diverse test set enhances the statistical significance of benchmark results and rigorously evaluates AI algorithms across out-of-distribution scenarios. We invited 14 inventors of 19 AI algorithms to train their algorithms, while our team, as a third party, independently evaluated these algorithms. In addition, we also evaluated pre-existing AI frameworks—which, differing from algorithms, are more flexible and can support different algorithms—including MONAI from NVIDIA, nnU-Net from DKFZ, and numerous other open-source frameworks. We are committed to expanding this benchmark to encourage more innovation of AI algorithms for the medical domain. Copyright © 2024, The Authors. All rights reserved.

关键词： Open systems

来源：评论

学校读者我要写书评

暂无评论

Unlocking the Potential of Digital Pathology: Novel Baselines for Compression

arXiv

引用

arXiv 2024年

作者： Fischer, Maximilian Neher, Peter Schuffler, Peter Ziegler, Sebastian Xiao, Shuhan Peretzke, Robin Clunie, David Ulrich, Constantin Baumgartner, Michael Muckenhuber, Alexander Almeida, Silvia Dias Gotz, Michael Kleesiek, Jens Nolden, Marco Braren, Rickmer Maier-Hein, Klaus Heidelberg Germany Partner site Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Medical Faculty Heidelberg University Heidelberg Germany Clinic of Diagnostics and Interventional Radiology Section Experimental Radiology Ulm University Medical Centre Ulm Germany Institute of Pathology TUM School of Medicine and Health Technical University of Munich Munich Germany Department of Diagnostic and Interventional Radiology Faculty of Medicine Technical University of Munich Munich Germany University Medicine Essen Essen Germany Partner site Essen Germany Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Heidelberg Germany NCT Heidelberg a partnership between DKFZ University Medical Center Heidelberg Germany Research Campus M2OLIE Mannheim Germany PixelMed Publishing BangorPA United States Munich Center for Machine Learning Munich Germany Helmholtz Imaging German Cancer Research Center Germany

Digital pathology offers a groundbreaking opportunity to transform clinical practice in histopathological image analysis, yet faces a significant hurdle: the substantial file sizes of pathological Whole Slide Images (WSI). While current digital pathology solutions rely on lossy JPEG compression to address this issue, lossy compression can introduce color and texture disparities, potentially impacting clinical decision-making. While prior research addresses perceptual image quality and downstream performance independently of each other, we jointly evaluate compression schemes for perceptual and downstream task quality on four different datasets. In addition, we collect an initially uncompressed dataset for an unbiased perceptual evaluation of compression schemes. Our results show that deep learning models fine-tuned for perceptual quality outperform conventional compression schemes like JPEG-XL or WebP for further compression of WSI. However, they exhibit a significant bias towards the compression artifacts present in the training data and struggle to generalize across various compression schemes. We introduce a novel evaluation metric based on feature similarity between original files and compressed files that aligns very well with the actual downstream performance on the compressed WSI. Our metric allows for a general and standardized evaluation of lossy compression schemes and mitigates the requirement to independently assess different downstream tasks. Our study provides novel insights for the assessment of lossy compression schemes for WSI and encourages a unified evaluation of lossy compression schemes to accelerate the clinical uptake of digital pathology. © 2024, CC BY-NC-SA.

关键词： Image compression

来源：评论

学校读者我要写书评

暂无评论

A smart filtering-based adaptive optimized link state routing protocol in flying ad hoc networks for traffic monitoring

引用

Journal of King Saud University - computer and Information sciences 2024年第4期36卷

作者： Hosseinzadeh, Mehdi Ali, Saqib Rahmani, Amir Masoud Lansky, Jan Nulicek, Vladimir Yousefpoor, Mohammad Sadegh Yousefpoor, Efat Darwesh, Aso Lee, Sang-Woong Institute of Research and Development Duy Tan University Da Nang Viet Nam School of Medicine and Pharmacy Duy Tan University Da Nang Viet Nam Department of Information Systems College of Economics and Political Science Sultan Qaboos University Al Khoudh Muscat Oman Future Technology Research Center National Yunlin University of Science and Technology Yunlin Taiwan Department of Computer Science and Mathematics Faculty of Economic Studies University of Finance and Administration Prague Czech Republic Center of Research and Strategic Studies Lebanese French University Kurdistan Region Iraq Department of Information Technology University of Human Development Sulaymaniyah Kurdistan region Iraq Pattern Recognition and Machine Learning Lab Gachon University 1342 Seongnamdaero Sujeonggu Seongnam 13120 South Korea

Nowadays, the use of drones as a fundamental element of smart cities has attracted the attention of many researchers to monitor and control the traffic of vehicles. Because of the high flexibility of multi-drone systems, like flying ad hoc networks (FANETs), they provide various services and improve modern life in smart cities. However, due to the unique features of FANET, especially the high speed of drones and rapid changes in network topology, communication reliability is a serious challenge in this network. Hence, traditional routing protocols, such as optimized link state routing (OLSR) scheme, cannot work well in these networks. In this paper, a smart filtering-based adaptive optimized link state routing (SFA-OLSR) scheme is proposed in FANETs. To increase adaptability to the FANET environment, SFA-OLSR provides a new solution to adjust the hello broadcast period so that each flying node specifies its broadcast period based on a new scale called cosine similarity between real and predicted positions. Furthermore, in SFA-OLSR, each flying node develops a filtering algorithm based on two parameters, namely link lifetime and remaining energy. The purpose of this algorithm is to reduce the size of the single-hop neighboring set of each flying node and minimize the search space when finding multi-point relays (MPRs). This increases the convergence speed of the algorithm. Then, SFA-OLSR exploits the sparrow search algorithm (SSA) to single out the best MPRs. This algorithm introduces a multi-objective function by focusing on three components, including energy, link lifespan, and neighbor degree. Lastly, the simulation process of SFA-OLSR is performed by the NS3 simulator. This process evaluates the performance of the proposed method and three schemes, namely Gangopadhyay et al., P-OLSR, and OLSR-ETX. These evaluations show that SFA-OLSR has a good performance in terms of three scales, namely packet delivery ratio, delay, and throughput, but its overhead is more than

关键词： Artificial intelligence (AI) Flying ad hoc networks (FANETs) Meta-heuristic algorithms Reliability Routing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：