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

arXiv 2021年

作者： Tian, Yu Liu, Fengbei Pang, Guansong Chen, Yuanhong Liu, Yuyuan Verjans, Johan W. Singh, Rajvinder Carneiro, Gustavo Harvard Ophthalmology AI Lab Harvard Medical School United States Australian Institute for Machine Learning University of Adelaide Australia Faculty of Health and Medical Sciences University of Adelaide Australia South Australian Health and Medical Research Institute Australia School of Computing and Information Systems Singapore Management University Singapore Centre for Vision Speech and Signal Processing University of Surrey United Kingdom

Unsupervised anomaly detection (UAD) methods are trained with normal (or healthy) images only, but during testing, they are able to classify normal and abnormal (or disease) images. UAD is an important medical image analysis (MIA) method to be applied in disease screening problems because the training sets available for those problems usually contain only normal images. However, the exclusive reliance on normal images may result in the learning of ineffective low-dimensional image representations that are not sensitive enough to detect and segment unseen abnormal lesions of varying size, appearance, and shape. Pre-training UAD methods with self-supervised learning, based on computer vision techniques, can mitigate this challenge, but they are sub-optimal because they do not explore domain knowledge for designing the pretext tasks, and their contrastive learning losses do not try to cluster the normal training images, which may result in a sparse distribution of normal images that is ineffective for anomaly detection. In this paper, we propose a new self-supervised pre-training method for MIA UAD applications, named Pseudo Multiclass Strong Augmentation via Contrastive learning (PMSACL). PMSACL consists of a novel optimisation method that contrasts a normal image class from multiple pseudo classes of synthesised abnormal images, with each class enforced to form a dense cluster in the feature space. In the experiments, we show that our PMSACL pre-training improves the accuracy of SOTA UAD methods on many MIA benchmarks using colonoscopy, fundus screening and Covid-19 Chest X-ray datasets. The code is made publicly available via this link. Copyright © 2021, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Tackling Instance-Dependent label Noise via a Universal Probabilistic Model

arXiv

引用

arXiv 2021年

作者： Wang, Qizhou Han, Bo Liu, Tongliang Niu, Gang Yang, Jian Gong, Chen Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of MoE School of Computer Science and Engineering Nanjing University of Science and Technology China Department of Computer Science Hong Kong Baptist University Hong Kong Trustworthy Machine Learning Lab School of Computer Science Faculty of Engineering The University of Sydney Australia Japan Department of Computing Hong Kong Polytechnic University Hong Kong

The drastic increase of data quantity often brings the severe decrease of data quality, such as incorrect label annotations, which poses a great challenge for robustly training Deep Neural Networks (DNNs). Existing learning methods with label noise either employ ad-hoc heuristics or restrict to specific noise assumptions. However, more general situations, such as instance-dependent label noise, have not been fully explored, as scarce studies focus on their label corruption process. By categorizing instances into confusing and unconfusing instances, this paper proposes a simple yet universal probabilistic model, which explicitly relates noisy labels to their instances. The resultant model can be realized by DNNs, where the training procedure is accomplished by employing an alternating optimization algorithm. Experiments on datasets with both synthetic and real-world label noise verify that the proposed method yields significant improvements on robustness over state-of-the-art counterparts. Copyright © 2021, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

OLSR+: A new routing method based on fuzzy logic in flying ad-hoc networks (FANETs)

引用

Vehicular Communications 2022年 36卷

作者： Rahmani, Amir Masoud Ali, Saqib Yousefpoor, Efat Yousefpoor, Mohammad Sadegh Javaheri, Danial Lalbakhsh, Pooia Hassan Ahmed, Omed Hosseinzadeh, Mehdi Lee, Sang-Woong Future Technology Research Center National Yunlin University of Science and Technology Yunlin Taiwan Department of Information Systems College of Economics and Political Science Sultan Qaboos University Al Khoudh Muscat Oman Department of Computer Engineering Dezful Branch Islamic Azad University Dezful Iran Department of Computer Engineering Chosun University Gwangju 61452 South Korea Department of Data Science and Artificial Intelligence Faculty of Information Technology Monash University Clayton 3800 VIC Australia Department of Information Technology University of Human Development Sulaymaniyah Iraq Pattern Recognition and Machine Learning Lab Gachon University 1342 Seongnamdaero Sujeonggu Seongnam 13120 South Korea

Flying ad-hoc networks (FANETs) have many applications in military, industrial and agricultural areas. Due to specific features of FANETs, such as high-speed nodes, low density of nodes in the network, and rapid changes in the topology, most routing protocols designed for mobile ad hoc networks (MANETs) or vehicular ad hoc networks (VANETs) are not compatible with FANETs. In this paper, we propose a fuzzy logic-based routing approach called OLSR+ for FANETs. In this scheme, we seek to improve the optimized link state routing protocol (OLSR) so that it can efficiently be used in FANETs. OLSR+ includes four main phases: 1) Discovering neighboring nodes. In this phase, we propose a new and efficient technique for estimating the lifetime of the link between two unmanned ariel vehicles (UAVs) based on the link quality, distance, relative velocity, and movement direction. 2) Selecting multipoint relays (MPRs). In this phase, we present a fuzzy mechanism for selecting a set of MPR nodes. According to this mechanism, when a node has higher residual energy, higher link lifetime, and more neighborhood degree compared to others, it achieves more fitness to be selected as MPR. 3) Discovering the network topology. In this phase, we modify the format of the topology control (TC) message and add two fields, including route energy and route lifetime to this message. 4) Calculating the routing table. In OLSR+, we consider two parameters, including route energy and route lifetime, for establishing stable paths. Finally, we simulate OLSR+ using NS3 and compare its performance with two methods, namely greedy optimized link state routing (G-OLSR) and optimized link state routing (OLSR). The simulation results show that OLSR+ successfully reduces delay compared to G-OLSR and OLSR. In addition, it has higher packet delivery rate and throughput than others. Also, it improves energy consumption in the network. However, OLSR+ has more routing overhead than G-OLSR. © 2022 Elsevier Inc.

关键词： Artificial intelligence (AI) Flying ad hoc networks (FANETs) Fuzzy logic Routing Unmanned ariel vehicles (UAVs)

来源：评论

学校读者我要写书评

暂无评论

DCFH: A dynamic clustering approach based on fire hawk optimizer in flying ad hoc networks

引用

Vehicular Communications 2024年 47卷

作者： Hosseinzadeh, Mehdi Ali, Saqib Ahmad, Husham Jawad Alanazi, Faisal Yousefpoor, Mohammad Sadegh Yousefpoor, Efat Darwesh, Aso Rahmani, Amir Masoud 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 Department of Communication and Computer Engineering Cihan University-Erbil Kurdistan Region Iraq Department of Electrical Engineering College of Engineering Prince Sattam bin Abdulaziz University Al-Kharj 11942 Saudi Arabia Center of Research and Strategic Studies Lebanese French University Kurdistan Region Iraq Department of Information Technology University of Human Development Kurdistan Region Sulaymaniyah Iraq Future Technology Research Center National Yunlin University of Science and Technology Yunlin Taiwan Pattern Recognition and Machine Learning Lab Gachon University 1342 Seongnamdaero Sujeonggu Seongnam 13120 South Korea

In flying ad hoc networks (FANETs), unmanned aerial vehicles (UAVs) communicate with each other without any fixed infrastructure. Because of frequent topological changes, instability of wireless communication, three-dimensional movement of UAVs, and limited resources, especially energy, FANETs deal with many challenges, especially the instability of UAV swarms. One solution to address these problems is clustering because it maintains network performance and increases scalability. In this paper, a dynamic clustering scheme based on fire hawk optimizer (DCFH) is proposed for FANETs. In DCFH, each cluster head calculates the period of hello messages in its cluster based on its velocity. Then, a fire hawk optimizer (FHO)-based dynamic clustering operation is carried out to determine the role of each UAV (cluster head (CH) or cluster member (CM)) in the network. To calculate the fitness value of each fire hawk, a fitness function is suggested based on four elements, namely the balance of energy consumption, the number of isolated clusters, the distribution of CHs, and the neighbor degree. To improve cluster stability, each CH manages the movement of its CMs and adjusts it based on its movement in the network. In the last phase, DCFH defines a greedy routing process to determine the next-hop node based on a score, which consists of distance between CHs, energy, and buffer capacity. Finally, DCFH is simulated using the network simulator version 2 (NS2), and its performance is compared with three methods, including the mobility-based weighted cluster routing scheme (MWCRSF), the dynamic clustering mechanism (DCM), and the Grey wolf optimization (GWO)-based clustering protocol. The simulation results show that DCFH well manages the number of clusters in the network. It improves the cluster construction time (about 55.51%), cluster lifetime (approximately 11.13%), energy consumption (about 15.16%), network lifetime (about 2.6%), throughput (approximately 3.9%), packet deliver

关键词： Artificial intelligence (AI) Clustering Flying ad hoc networks (FANETs) Optimization algorithms Unmanned aerial vehicles (UAVs)

来源：评论

学校读者我要写书评

暂无评论

Gait Verification using Deep learning with a Pairwise Loss

Gait Verification using Deep Learning with a Pairwise Loss

引用

International Conference of the Biometrics Special Interest Group (BIOSIG)

作者： Vijaya Krishna Yalavarthi Josif Grabocka Hareesh Mandalapu Lars Schmidt-Thieme Information Systems and Machine Learning Lab University of Hildesheim Germany Computer Science Department Hochschule Darmstadt Germany

ISBN: (纸本)9781728126777;9783885796909

A unique walking pattern to every individual makes gait a promising biometric. Gait is becoming an increasingly important biometric because it can be captured non-intrusively through accelerometers positioned at various locations on the human body. The advent of wearable sensors technology helps in collecting the gait data seamlessly at a low cost. Thus gait biometrics using accelerometers play a significant role in security-related applications like identity verification and recognition. In this work, we deal with the problem of identity verification using gait. As the data received through the sensors is indexed in time order, we consider identity verification through gait data as the time series binary classification problem. We present deep learning model with a pairwise loss function for the classification. We conducted experiments using two datasets: publicly available ZJU dataset of more than 150 subjects and our self-collected dataset with 15 subjects. With our model, we obtained an Equal Error Rate of 0.05% over ZJU dataset and 0.5% over our dataset, which shows that our model is superior to the state-of-the-art baselines.

关键词： Sensors Accelerometers Biometrics (access control) Time series analysis Feature extraction Deep learning Convolution

来源：评论

学校读者我要写书评

暂无评论

learning with Group Noise

arXiv

引用

arXiv 2021年

作者： Wang, Qizhou Yao, Jiangchao Gong, Chen Liu, Tongliang Gong, Mingming Yang, Hongxia Han, Bo Department of Computer Science Hong Kong Baptist University Hong Kong Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of MoE School of Computer Science and Engineering Nanjing University of Science and Technology China Data Analytics and Intelligence Lab Alibaba Group China Department of Computing Hong Kong Polytechnic University Hong Kong Trustworthy Machine Learning Lab School of Computer Science University of Sydney Australia School of Mathematics and Statistics University of Melbourne Australia

machine learning in the context of noise is a challenging but practical setting to plenty of real-world applications. Most of the previous approaches in this area focus on the pairwise relation (casual or correlational relationship) with noise, such as learning with noisy labels. However, the group noise, which is parasitic on the coarse-grained accurate relation with the fine-grained uncertainty, is also universal and has not been well investigated. The challenge under this setting is how to discover true pairwise connections concealed by the group relation with its fine-grained noise. To overcome this issue, we propose a novel Max-Matching method for learning with group noise. Specifically, it utilizes a matching mechanism to evaluate the relation confidence of each object (cf. Figure 1) w.r.t. the target, meanwhile considering the Non-IID characteristics among objects in the group. Only the most confident object is considered to learn the model, so that the fine-grained noise is mostly dropped. The performance on a range of real-world datasets in the area of several learning paradigms demonstrates the effectiveness of Max-Matching. Copyright © 2021, The Authors. All rights reserved.

关键词： machine learning

来源：评论

学校读者我要写书评

暂无评论

Multi-label Classification with High-rank and High-order label Correlations

arXiv

引用

arXiv 2022年

作者： Si, Chongjie Jia, Yuheng Wang, Ran Zhang, Min-Ling Feng, Yanghe Qu, Chongxiao The Chien-Shiung Wu College Southeast University Nanjing210096 China The MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai200240 China The School of Computer Science and Engineering Southeast University Nanjing210096 China Ministry of Education China School of Computing & Information Sciences Caritas Institute of Higher Education Hong Kong The Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China The School of Mathematical Science Shenzhen University Shenzhen518060 China Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China The College of Systems Engineering National University of Defense Technology China The 52nd Research Institute of China Electronics Technology Group China

Exploiting label correlations is important to multi-label classification. Previous methods capture the high-order label correlations mainly by transforming the label matrix to a latent label space with low-rank matrix factorization. However, the label matrix is generally a full-rank or approximate full-rank matrix, making the low-rank factorization inappropriate. Besides, in the latent space, the label correlations will become implicit. To this end, we propose a simple yet effective method to depict the high-order label correlations explicitly, and at the same time maintain the high-rank of the label matrix. Moreover, we estimate the label correlations and infer model parameters simultaneously via the local geometric structure of the input to achieve mutual enhancement. Comparative studies over twelve benchmark data sets validate the effectiveness of the proposed algorithm in multi-label classification. The exploited high-order label correlations are consistent with common sense empirically. Our code is publicly available at https://***/Chongjie-Si/HOMI. Copyright © 2022, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

A Q-learning-based smart clustering routing method in flying Ad Hoc networks

引用

Journal of King Saud University - Computer and information Sciences 2024年第1期36卷

作者： Hosseinzadeh, Mehdi Tanveer, Jawad Rahmani, Amir Masoud Aurangzeb, Khursheed Yousefpoor, Efat Yousefpoor, Mohammad Sadegh Darwesh, Aso Lee, Sang-Woong Fazlali, Mahmood 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 Computer Science and Engineering Sejong University Seoul 05006 South Korea Future Technology Research Center National Yunlin University of Science and Technology Yunlin Taiwan Department of Computer Engineering College of Computer and Information Sciences King Saud University P.O. Box 51178 Riyadh 11543 Saudi Arabia Department of Computer Engineering Dezful Branch Islamic Azad University Dezful Iran Department of Information Technology University of Human Development Sulaymaniyah Iraq Pattern Recognition and Machine Learning Lab Gachon University 1342 Seongnamdaero Sujeonggu Seongnam 13120 South Korea Cybersecurity and Computing Systems Research Group School of Physics Engineering and Computer Science University of Hertfordshire Hertfordshire AL10 9AB United Kingdom

Flying ad hoc networks (FANETs) have particular importance in various military and civilian applications due to their specific features, including frequent topological changes, the movement of drones in a three-dimensional space, and their restricted energy. These features have created challenges for designing cluster-based routing protocols. In this paper, a Q-learning-based smart clustering routing method (QSCR) is suggested in FANETs. In QSCR, each node discovers its neighbors through the periodic exchange of hello messages. The hello time interval is different in each cluster, and cluster leaders determine this interval based on the average speed similarity. Next, an adaptive clustering process is presented for categorizing drones in the clusters. In this step, the cluster leader is selected based on a new parameter called merit value, which includes residual energy, centrality, neighbor degree, speed similarity, and link validity time. Then, a centralized Q-learning model is presented to tune weight coefficients related to merit parameters dynamically. In the last step, the routing process is done using a greedy forwarding technique. Finally, QSCR is run on NS2, and the simulation results of QSCR are compared with those of ICRA, WCA, and DCA. These results show that QSCR carries out the clustering process rapidly but has less cluster stability than ICRA. QSCR gets energy efficiency and improves network lifetime. In the routing process, QSCR has a high packet delivery rate compared to other schemes. Also, the number of isolated clusters created in QSCR is less than other clustering methods. However, the proposed scheme has a higher end-to-end delay than ICRA. Also, this scheme experiences more communication overhead than ICRA slightly. © 2024 The Author(s)

关键词： Clustering Flying ad hoc networks (FANETs) machine learning (ML) Reinforcement learning (RL) Unmanned aerial vehicles (UAVs)

来源：评论

学校读者我要写书评

暂无评论

Physical Testing in Sports Rehabilitation: Implications on a Potential Return to Sport

引用

Arthroscopy, Sports Medicine, and Rehabilitation 2022年第1期4卷 e189-e198页

作者： Fares, Mohamad Y. Khachfe, Hussein H. Salhab, Hamza A. Bdeir, Ahmad Fares, Jawad Baydoun, Hasan College of Medical Veterinary and Life Sciences University of Glasgow Glasgow Scotland UK United Kingdom Department of General Surgery University of Pittsburgh Medical Center Pittsburgh PA United States National Hospital for Neurology and Neurosurgery University College London London UK United Kingdom Information Systems and Machine Learning Lab Universität Hildesheim Hildesheim Germany Department of Neurological Surgery Feinberg School of Medicine Northwestern University Chicago IL United States Department of Orthopedics Mubadala Healthpoint Sheikh Zayed Sports City Abu Dhabi United Arab Emirates

Strength and power constitute vital predictors for an individual's quality of life and athletic performance. Measurement of these two parameters is very important in the world of sports science and medicine and necessitates a high level of accuracy and reliability. Several tests are used to measure strength and power, including the isometric maximal voluntary contraction test, the 1-repetition maximum test, and the Wingate test, as well as other tests that target upper and lower limbs. The unique characteristics present in each of these tests entail a subsequently unique mode of application during the process of rehabilitation. This helps athletic trainers and medical personnel evaluate recovery and decide on a potential return to sport. A comprehensive holistic approach that includes multiple testing, psychosocial assessment, and a gradual return to activity is best to achieve promising outcomes and preinjury athletic levels. Level of Evidence: V, expert opinion © 2021 The Authors

关键词：

来源：评论

学校读者我要写书评

暂无评论

Handwritten Amharic character recognition using a convolutional neural network

arXiv

引用

arXiv 2019年

作者： Gondere, Mesay Samuel Schmidt-Thieme, Lars Boltena, Abiot Sinamo Jomaa, Hadi Samer Arba Minch University Faculty of Computing and Software Engineering Information Systems and Machine Learning Lab Hildesheim31141 Germany Ethiopian Institute of Technology-Mekelle School of Computing

Amharic is the official language of the Federal Democratic Republic of Ethiopia. There are lots of historic Amharic and Ethiopic handwritten documents addressing various relevant issues including governance, science, religious, social rules, cultures and art works which are very reach indigenous knowledge. The Amharic language has its own alphabet derived from Ge’ez which is currently the liturgical language in Ethiopia. Handwritten character recognition for non Latin scripts like Amharic is not addressed especially using the advantages of the state of the art techniques. This research work designs for the first time a model for Amharic handwritten character recognition using a convolutional neural network. The dataset was organized from collected sample handwritten documents and data augmentation was applied for machine learning. The model was further enhanced using multi-task learning from the relationships of the characters. Promising results are observed from the later model which can further be applied to word prediction. Copyright © 2019, The Authors. All rights reserved.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：