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

nnDetection: A Self-configuring Method for Medical Object Detection

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Baumgartner, Michael Jäger, Paul F. Isensee, Fabian Maier-Hein, Klaus H. Division of Medical Image Computing German Cancer Research Center Heidelberg Germany Interactive Machine Learning Group German Cancer Research Center Germany HIP Applied Computer Vision Lab. German Cancer Research Center Germany Pattern Analysis and Learning Group Heidelberg University Hospital Germany

Simultaneous localisation and categorization of objects in medical images, also referred to as medical object detection, is of high clinical relevance because diagnostic decisions often depend on rating of objects rather than e.g. pixels. For this task, the cumbersome and iterative process of method configuration constitutes a major research bottleneck. Recently, nnU-Net has tackled this challenge for the task of image segmentation with great success. Following nnU-Net’s agenda, in this work we systematize and automate the configuration process for medical object detection. The resulting self-configuring method, nnDetection, adapts itself without any manual intervention to arbitrary medical detection problems while achieving results en par with or superior to the state-of-the-art. We demonstrate the effectiveness of nnDetection on two public benchmarks, ADAM and LUNA16, and propose 11 further medical object detection tasks on public data sets for comprehensive method evaluation. Code is at https://***/MIC-DKFZ/nnDetection. Copyright © 2021, The Authors. All rights reserved.

关键词： Object recognition

Selection of deep web database based on query relevance

学校读者我要写书评

暂无评论

Journal of Information and Computational Science 2009年第3期6卷 1113-1120页

作者： Yuan, Fang Fan, Jingchuan Liu, Shuang Zhang, Ming College of Mathematics and Computer Science Hebei University Hebei Baoding 071002 China Key Lab. in Machine Learning and Computational Intelligence of Hebei Province Hebei Baoding 071002 China College of Quality Technology Supervision Hebei University Hebei Baoding 071000 China

During recent years, there are more and more high-quality information in the Web database. Thus, it is becoming more and more important to find the most relevant Web database to user's query. In this paper, we propose a method to calculate the relevance of Web database with respect to user's query. The method submits frequent query to Web database, classifies the obtained results from the Web database by their characteristic, and calculates the relevance between the query and each type of obtained results together with the proportion of each type of the obtained result occupying all the results from all Web database. Meanwhile, the relevance between the query and the Web database is obtained through the weighted sum of the foresaid relevance and proportion. Experimental results on several actual Web databases demonstrate the effectiveness of the proposed method in evaluating the Web database's supporting power with specific queries. 1548-7741/ Copyright © 2009 Binary Information Press.

关键词： Query languages

A Review of Artificial Fish Swarm Algorithms: Recent Advances and Applications

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Pourpanah, Farhad Wang, Ran Lim, Chee Peng Wang, Xi-Zhao Yazdani, Danial College of Mathematics and Statistics Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China Department of Electrical and Computer Engineering University of Windsor Canada College of Mathematics and Statistics Shenzhen Key Lab. of Advanced Machine Learning and Applications Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China Institute for Intelligent Systems Research and Innovation Deakin University Australia College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China School of Computer Science and Engineering Southern University of Science and Technology China

The Artificial Fish Swarm Algorithm (AFSA) is inspired by the ecological behaviors of fish schooling in nature, viz., the preying, swarming and following behaviors. Owing to a number of salient properties, which include flexibility, fast convergence, and insensitivity to the initial parameter settings, the family of AFSA has emerged as an effective Swarm Intelligence (SI) methodology that has been widely applied to solve real-world optimization problems. Since its introduction in 2002, many improved and hybrid AFSA models have been developed to tackle continuous, binary, and combinatorial optimization problems. This paper aims to present a concise review of the continuous AFSA, encompassing the original ASFA, its improvements and hybrid models, as well as their associated applications. We focus on articles published in high-quality journals since 2013. Our review provides insights into AFSA parameters modifications, procedure and sub-functions. The main reasons for these enhancements and the comparison results with other hybrid methods are discussed. In addition, hybrid, multi-objective and dynamic AFSA models that have been proposed to solve continuous optimization problems are elucidated. We also analyse possible AFSA enhancements and highlight future research directions for advancing AFSA-based models. Copyright © 2020, The Authors. All rights reserved.

关键词： Multiobjective optimization

A mathematical model for efficient extraction of key locations from point-cloud data in track area

学校读者我要写书评

暂无评论

Industrial Artificial Intelligence 2023年第1期1卷 1-14页

作者： Chen, Shuyue Wu, Jiaolv Lu, Jian Wang, Xizhao College of Mathematics and Statistics Shenzhen University Shenzhen China School of Software Engineering Shenzhen Institue of Information Technology Shenzhen China Shenzhen No. 3 Vocational School of Technology Shenzhen China College of Engineering Huaqiao University Quanzhou China Shenzhen Key Lab. of Advanced Machine Learning and Applications Shenzhen University Shenzhen China Guangdong Key Lab. of Intelligent Information Process Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

During the construction of a metro system, it is inevitable that deviations will occur between the excavated tunnel and the original designed scheme. As such, it is necessary to adjust the designed scheme to accommodate these discrepancies. Specifically, the adjustment of the designed scheme involves a rigorous process of repeatedly selecting and verifying the feasibility of the proposed modifications using point-cloud data obtained from the tunnel. However, this process can be considerably time-consuming due to the large-scale and potentially redundant nature of the point-cloud data. This paper proposes a mathematical model for point-cloud data acquired in measuring a mined tunnel, which may deviate from the originally designed one. The modeling, which mainly includes determining its normal plane, and building the equation of tunnel point-cloud data, is to quickly extract several key locations in the tunnel surface for modifying the original design in order to achieve a minimum error between the modified design and the mined tunnel. In comparison with the conventional processing of extracting several key locations directly from point-cloud data, our model shows a significant promotion of extraction efficiency under an acceptable error bound. The model is tested in a real tunnel point-cloud data and the testing results confirm the increase of fitting accuracy and the decrease of computational load.

关键词：

A study on the uncertainty of convolutional layers in deep neural networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Shen, Haojing Chen, Sihong Wang, Ran Big Data Institute College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University ShenzhenGuangdong518060 China College of Mathematics and Statistics Shenzhen University Shenzhen518060 China Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China

This paper shows a Min-Max property existing in the connection weights of the convolutional layers in a neural network structure, i.e., the LeNet. Specifically, the Min-Max property means that, during the back propagation-based training for LeNet, the weights of the convolutional layers will become far away from their centers of intervals, i.e., decreasing to their minimum or increasing to their maximum. From the perspective of uncertainty, we demonstrate that the Min-Max property corresponds to minimizing the fuzziness of the model parameters through a simplified formulation of convolution. It is experimentally confirmed that the model with the Min-Max property has a stronger adversarial robustness, thus this property can be incorporated into the design of loss function. This paper points out a changing tendency of uncertainty in the convolutional layers of LeNet structure, and gives some insights to the interpretability of convolution. © 2020, CC-BY.

关键词： Convolution

Incorporating Hidden Layer representation into Adversarial Attacks and Defences

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Shen, Haojing Chen, Sihong Wang, Ran Wang, Xizhao Big Data Institute College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University Guangdong Shenzhen518060 China The College of Mathematics and Statistics Shenzhen University Shenzhen518060 China The Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China

In this paper, we propose a defence strategy to improves adversarial robustness incorporating hidden layer representation. The key of this defence strategy aims to compress or filter input’s information including adversarial perturbation. And this defence strategy can be regarded as an activation function which can be applied any kind of neural networks. We also prove theoretically the effectiveness of this defense strategy under certain conditions. Besides, incorporating hidden layer representation we propose three types of adversarial attacks to generate three types of adversarial examples, respectively. The experiments show that our defence method can significantly improve the adversarial robustness of deep neural networks which achieves the state-of-the-art performance even though we do not adopt adversarial training. © 2020, CC BY.

关键词： Deep neural networks

Adversarial learning with Cost-Sensitive Classes

学校读者我要写书评

暂无评论

arXiv 2021年

It is necessary to improve the performance of some special classes or to particularly protect them from attacks in adversarial learning. This paper proposes a framework combining cost-sensitive classification and adversarial learning together to train a model that can distinguish between protected and unprotected classes, such that the protected classes are less vulnerable to adversarial examples. We find in this framework an interesting phenomenon during the training of deep neural networks, called Min-Max property, that is, the absolute values of most parameters in the convolutional layer approach zero while the absolute values of a few parameters are significantly larger becoming bigger. Based on this Min-Max property which is formulated and analyzed in a view of random distribution, we further build a new defense model against adversarial examples for adversarial robustness improvement. An advantage of the built model is that it performs better than the standard one and can combine with adversarial training to achieve an improved performance. It is experimentally confirmed that, regarding the average accuracy of all classes, our model is almost as same as the existing models when an attack does not occur and is better than the existing models when an attack occurs. Specifically, regarding the accuracy of protected classes, the proposed model is much better than the existing models when an attack occurs. © 2021, CC BY.

关键词： Deep neural networks

An Ordinal Random Forest and Its Parallel Implementation with MapReduce

学校读者我要写书评

暂无评论

An Ordinal Random Forest and Its Parallel Implementation wit...

IEEE International Conference on Systems, Man and Cybernetics

作者： Shanshan Wang Junhai Zhai Sufang Zhang Hong Zhu School of Computer Science and Technology Hebei University Baoding China Key Lab. of Machine Learning and Computational Intelligence Hebei University Baoding China College of Mathematics Zhejiang Normal University Jinhua China Hebei Branch of Meteorological Cadres Training Institute China Meteorological Administration Baoding China

ISBN: (纸本)9781479986989

Ordinal decision tree (ODT) can effectively deal with monotonic classification problems. However, it is difficult for the existing ordinal decision tree algorithms to learning ODT from large data sets. Based on the variable consistency dominance based rough set approach (VC-DRSA), an ordinal random forest algorithm is proposed in this paper. Combining with the computing framework of MapReduce, the proposed ordinal random forest algorithm is paralleled on the platform of Hadoop, which improves the efficiency of the proposed algorithm. The feasibility and effectiveness of the proposed algorithm is verified by the experimental results.

关键词： Conferences Decision trees Vegetation

A review of uncertainty quantification in deep learning: Techniques, applications and challenges

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Abdar, Moloud Pourpanah, Farhad Hussain, Sadiq Rezazadegan, Dana Liu, Li Ghavamzadeh, Mohammad Fieguth, Paul Cao, Xiaochun Khosravi, Abbas Rajendra Acharya, U. Makarenkov, Vladimir Nahavandi, Saeid Deakin University Australia College of Mathematics and Statistics Guangdong Key Lab. of Intelligent Information Processing Shenzhen University Shenzhen518060 China Dibrugarh University Dibrugarh India Department of Computer Science and Software Engineering Swinburne University of Technology Melbourne Australia Center for Machine Vision and Signal Analysis University of Oulu Oulu Finland Google research United States Department of Systems Design Engineering University of Waterloo Waterloo Canada State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing China Department of Electronics and Computer Engineering Ngee Ann Polytechnic Clementi Singapore Department of Computer Science University of Quebec in Montreal MontrealQC Canada

—Uncertainty quantification (UQ) plays a pivotal role in the reduction of uncertainties during both optimization and decision making, applied to solve a variety of real-world applications in science and engineering. Bayesian approximation and ensemble learning techniques are two of the most widely-used UQ methods in the literature. In this regard, researchers have proposed different UQ methods and examined their performance in a variety of applications such as computer vision (e.g., self-driving cars and object detection), image processing (e.g., image restoration), medical image analysis (e.g., medical image classification and segmentation), natural language processing (e.g., text classification, social media texts and recidivism risk-scoring), bioinformatics, etc. This study reviews recent advances in UQ methods used in deep learning, investigates the application of these methods in reinforcement learning, and highlight the fundamental research challenges and directions associated with the UQ field. Copyright © 2020, The Authors. All rights reserved.

关键词： Image segmentation