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

Difficulty adjustable and scalable constrained multiobjective test problem toolkit

学校读者我要写书评

暂无评论

Evolutionary Computation 2019年第3期28卷 339-378页

作者： Fan, Zhun Li, Wenji Cai, Xinye Li, Hui Wei, Caimin Zhang, Qingfu Deb, Kalyanmoy Goodman, Erik Department of Electronic Engineering Shantou University Guangdong515063 China Key Lab of Digital Signal and Image Processing of Guangdong Province Guangdong China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Jiangsu210016 China School of Mathematics and Statistics Xi’an Jiaotong University Shan’xi710049 China Department of Computer Science City University of Hong Kong Hong Kong BEACON Center for the Study of Evolution in Action Michigan State University East LansingMI United States

Multiobjective evolutionary algorithms (MOEAs) have progressed significantly in recent decades, butmost of them are designed to solve unconstrained multiobjective optimization problems. In fact, many real-world multiobjective problems contain a number of constraints. To promote research on constrained multiobjective optimization, we first propose a problem classification scheme with three primary types of difficulty, which reflect various types of challenges presented by real-world optimization problems, in order to characterize the constraint functions in constrained multiobjective optimization problems (CMOPs). These are feasibility-hardness, convergence-hardness, and diversity-hardness. We then develop a general toolkit to construct difficulty adjustable and scalable CMOPs (DAS-CMOPs, or DAS-CMaOPs when the number of objectives is greater than three) with three types of parameterized constraint functions developed to capture the three proposed types of difficulty. In fact, the combination of the three primary constraint functions with different parameters allows the construction of a large variety of CMOPs, with difficulty that can be defined by a triplet, with each of its parameters specifying the level of one of the types of primary difficulty. Furthermore, the number of objectives in this toolkit can be scaled beyond three. Based on this toolkit, we suggest nine difficulty adjustable and scalable CMOPs and nine CMaOPs, to be called DAS-CMOP1-9 and DAS-CMaOP1-9, respectively. To evaluate the proposed test problems, two popular CMOEAs—MOEA/D-CDP (MOEA/D with constraint dominance principle) and NSGA-II-CDP (NSGA-II with constraint dominance principle) and two popular constrainedmany-objective evolutionary algorithms (CMaOEAs)—C-MOEA/DD and C-NSGA-III—are used to compare performance on DAS-CMOP1-9 and DAS-CMaOP1-9 with a variety of difficulty triplets, respectively. The experimental results reveal that mechanisms in MOEA/D-CDP may be more effective in solving conv

关键词： Hardness

Neighborhood Interval Observer Based Coordination Control for Multi-agent Systems with Disturbances ⁎

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2020年第2期53卷 10994-10999页

作者： Xiaoling Wang Guo-Ping Jiang Wen Yang Housheng Su Xiaofan Wang College of Automation Nanjing University of Posts and Telecommunications Nanjing 210023 China and also with Jiangsu Engineering Lab for IOT Intelligent Robots (IOTRobot) Nanjing 210023 China Key Laboratory of Advanced Control and Optimization for Chemical Processes East China University of Science and Technology Shanghai 200237 China School of Artifcial Intelligence and Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Luoyu Road 1037 Wuhan 430074 China Department of Automation Shanghai University Shanghai 200072 China

This paper focuses on multi-agent systems with uncertain disturbances, in which only the bounding functions on the disturbances and the bounds on the initial state of each agent are known. By designing a neighborhood interval observer for this kind of multi-agent system, the estimation of the sum of the relative state of each agent associated with itself and its neighbors is frstly realized. Then, on the basis of these estimated information, local control algorithm is designed to drive the system to achieve bounded consensus.

关键词： Multi-agent system disturbance neighborhood interval observer bounded consensus

REFUGE2 CHALLENGE: A TREASURE TROVE FOR MULTI-DIMENSION ANALYSIS AND EVALUATION IN GLAUCOMA SCREENING

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Fang, Huihui Li, Fei Wu, Junde Fu, Huazhu Sun, Xu Son, Jaemin Yu, Shuang Zhang, Menglu Yuan, Chenglang Bian, Cheng Lei, Baiying Zhao, Benjian Xu, Xinxing Li, Shaohua Fumero, Francisco Sigut, José Almubarak, Haidar Bazi, Yakoub Guo, Yuanhao Zhou, Yating Baid, Ujjwal Innani, Shubham Guo, Tianjiao Yang, Jie Orlando, José Ignacio Bogunović, Hrvoje Zhang, Xiulan Xu, Yanwu The REFUGE2 Challenge Australia State Key Laboratory of Ophthalmology Zhongshan Ophthalmic Center Sun Yat-Sen University Guangdong Provincial Key Laboratory of Ophthalmology and Visual Science Guangzhou China Intelligent Healthcare Unit Baidu Inc. Beijing China The Institute of High Performance Computing Agency for Science Technology and Research Singapore Yatiris Group PLADEMA Institute CONICET UNICEN Tandil Argentina Christian Doppler Lab for Artificial Intelligence in Retina Department of Ophthalmology and Optometry Medical University of Vienna Vienna Austria VUNO Inc Seoul Korea Republic of Tencent HealthCare Tencent Shenzhen China Computer Vision Institute College of Computer Science and Software Engineering of Shenzhen University Shenzhen China School of Biomedical Engineering Health Science Center Shenzhen University China Xiaohe Healthcare ByteDance Guangdong Guangzhou510000 China School of Biomedical Engineering Shenzhen University China College of Computer Science & Software Engineering Shenzhen University China Department of Computer Science and Systems Engineering Universidad de La Laguna Spain Saudi Electronic University Saudi Arabia King Saud University Saudi Arabia Institute of Automation Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China SGGS Institute of Engineering and Technology India Institute of Medical Robotics Shanghai Jiao Tong University China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China

With the rapid development of artificial intelligence (AI) in medical image processing, deep learning in color fundus photography (CFP) analysis is also evolving. Although there are some open-source, labeled datasets of CFPs in the ophthalmology community, large-scale datasets for screening only have labels of disease categories, and datasets with annotations of fundus structures are usually small in size. In addition, labeling standards are not uniform across datasets, and there is no clear information on the acquisition device. Here we release a multi-annotation, multi-quality, and multi-device color fundus image dataset for glaucoma analysis on an original challenge-Retinal Fundus Glaucoma Challenge 2nd Edition (REFUGE2). The REFUGE2 dataset contains 2000 color fundus images with annotations of glaucoma classification, optic disc/cup segmentation, as well as fovea localization. Meanwhile, the REFUGE2 challenge sets three sub-tasks of automatic glaucoma diagnosis and fundus structure analysis and provides an online evaluation framework. Based on the characteristics of multi-device and multi-quality data, some methods with strong generalizations are provided in the challenge to make the predictions more robust. This shows that REFUGE2 brings attention to the characteristics of real-world multi-domain data, bridging the gap between scientific research and clinical application. © 2022, CC BY-NC-ND.

关键词： Color

Are pathologist-defined labels reproducible? Comparison of the TUPAC16 mitotic figure dataset with an alternative set of labels

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Bertram, Christof A. Veta, Mitko Marzahl, Christian Stathonikos, Nikolas Maier, Andreas Klopfleisch, Robert Aubreville, Marc Institute of Veterinary Pathology Freie Universitt Berlin Berlin Germany Medical Image Analysis Group Eindhoven University of Technology Eindhoven Netherlands Pattern Recognition Lab Computer Science Friedrich-Alexander-Universitt Erlangen-Nrnberg Erlangen Germany Department of Pathology University Medical Center Utrecht Utrecht Netherlands

Pathologist-defined labels are the gold standard for histopathological data sets, regardless of well-known limitations in consistency for some tasks. To date, some datasets on mitotic figures are available and were used for development of promising deep learning-based algorithms. In order to assess robustness of those algorithms and reproducibility of their methods it is necessary to test on several independent datasets. The influence of different labeling methods of these available datasets is currently unknown. To tackle this, we present an alternative set of labels for the images of the auxiliary mitosis dataset of the TUPAC16 challenge. Additional to manual mitotic figure screening, we used a novel, algorithm-aided labeling process, that allowed to minimize the risk of missing rare mitotic figures in the images. All potential mitotic figures were independently assessed by two pathologists. The novel, publicly available set of labels contains 1,999 mitotic figures (+28.80%) and additionally includes 10,483 labels of cells with high similarities to mitotic figures (hard examples). We found significant difference comparing F1 scores between the original label set (0.549) and the new alternative label set (0.735) using a standard deep learning object detection architecture. The models trained on the alternative set showed higher overall confidence values, suggesting a higher overall label consistency. Findings of the present study show that pathologists-defined labels may vary significantly resulting in notable difference in the model performance. Comparison of deep learning-based algorithms between independent datasets with different labeling methods should be done with caution. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

Spatial group-wise enhance: Improving semantic feature learning in convolutional networks

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Li, Xiang Hu, Xiaolin Yang, Jian Pca Lab Key Lab of Intelligent Percept. and Syst. for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Momenta Department of Computer Science and Technology Tsinghua University

The Convolutional Neural Networks (CNNs) generate the feature representation of complex objects by collecting hierarchical and different parts of semantic subfeatures. These sub-features can usually be distributed in grouped form in the feature vector of each layer [43, 32], representing various semantic entities. However, the activation of these sub-features is often spatially affected by similar patterns and noisy backgrounds, resulting in erroneous localization and identification. We propose a Spatial Group-wise Enhance (SGE) module that can adjust the importance of each sub-feature by generating an attention factor for each spatial location in each semantic group, so that every individual group can autonomously enhance its learnt expression and suppress possible noise. The attention factors are only guided by the similarities between the global and local feature descriptors inside each group, thus the design of SGE module is extremely lightweight with almost no extra parameters and calculations. Despite being trained with only category supervisions, the SGE component is extremely effective in highlighting multiple active areas with various high-order semantics (such as the dog's eyes, nose, etc.). When integrated with popular CNN backbones, SGE can significantly boost the performance of image recognition tasks. Specifically, based on ResNet50 backbones, SGE achieves 1.2% Top-1 accuracy improvement on the imageNet benchmark and 1.0∼2.0% AP gain on the COCO benchmark across a wide range of detectors (Faster/Mask/Cascade RCNN and RetinaNet). Codes and pretrained models are available at https://***/implus/PytorchInsight. Copyright © 2019, The Authors. All rights reserved.

关键词： Semantics

Shape robust text detection with progressive scale expansion network

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Wang, Wenhai Xie, Enze Li, Xiang Hou, Wenbo Lu, Tong Yu, Gang Shao, Shuai National Key Lab for Novel Software Technology Nanjing University Department of Comuter Science and Technology Tongji University School of Computer and Engineering Nanjing University of Science and Technology Momenta Technology Inc PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China

Scene text detection has witnessed rapid progress especially with the recent development of convolutional neural networks. However, there still exists two challenges which prevent the algorithm into industry applications. On the one hand, most of the state-of-art algorithms require quadrangle bounding box which is in-accurate to locate the texts with arbitrary shape. On the other hand, two text instances which are close to each other may lead to a false detection which covers both instances. Traditionally, the segmentation-based approach can relieve the first problem but usually fail to solve the second challenge. To address these two challenges, in this paper, we propose a novel Progressive Scale Expansion Network (PSENet), which can precisely detect text instances with arbitrary shapes. More specifically, PSENet generates the different scale of kernels for each text instance, and gradually expands the minimal scale kernel to the text instance with the complete shape. Due to the fact that there are large geometrical margins among the minimal scale kernels, our method is effective to split the close text instances, making it easier to use segmentation-based methods to detect arbitrary-shaped text instances. Extensive experiments on CTW1500, Total-Text, ICDAR 2015 and ICDAR 2017 MLT validate the effectiveness of PSENet. Notably, on CTW1500, a dataset full of long curve texts, PSENet achieves a F-measure of 74.3% at 27 FPS, and our best F-measure (82.2%) outperforms state-of-art algorithms by 6.6%. The code will be released in the future. Copyright © 2019, The Authors. All rights reserved.

关键词： Chemical detection

Selective kernel networks

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Li, Xiang Wang, Wenhai Hu, Xiaolin Yang, Jian PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China Momenta National Key Lab for Novel Software Technology Nanjing University Department of Computer Science and Technology Tsinghua University China

In standard Convolutional Neural Networks (CNNs), the receptive fields of artificial neurons in each layer are designed to share the same size. It is well-known in the neuroscience community that the receptive field size of visual cortical neurons are modulated by the stimulus, which has been rarely considered in constructing CNNs. We propose a dynamic selection mechanism in CNNs that allows each neuron to adaptively adjust its receptive field size based on multiple scales of input information. A building block called Selective Kernel (SK) unit is designed, in which multiple branches with different kernel sizes are fused using softmax attention that is guided by the information in these branches. Different attentions on these branches yield different sizes of the effective receptive fields of neurons in the fusion layer. Multiple SK units are stacked to a deep network termed Selective Kernel Networks (SKNets). On the imageNet and CIFAR benchmarks, we empirically show that SKNet outperforms the existing state-of-the-art architectures with lower model complexity. Detailed analyses show that the neurons in SKNet can capture target objects with different scales, which verifies the capability of neurons for adaptively adjusting their receptive field sizes according to the input. The code and models are available at https://***/implus/SKNet. Copyright © 2019, The Authors. All rights reserved.

关键词： Neurons

The Multi-modality Cell Segmentation Challenge: Towards Universal Solutions

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Ma, Jun Xie, Ronald Ayyadhury, Shamini Ge, Cheng Gupta, Anubha Gupta, Ritu Gu, Song Zhang, Yao Lee, Gihun Kim, Joonkee Lou, Wei Li, Haofeng Upschulte, Eric Dickscheid, Timo de Almeida, José Guilherme Wang, Yixin Han, Lin Yang, Xin labagnara, Marco Gligorovski, Vojislav Scheder, Maxime Rahi, Sahand Jamal Kempster, Carly Pollitt, Alice Espinosa, Leon Mignot, Tâm Middeke, Jan Moritz Eckardt, Jan-Niklas Li, Wangkai Li, Zhaoyang Cai, Xiaochen Bai, Bizhe Greenwald, Noah F. Van Valen, David Weisbart, Erin Cimini, Beth A. Cheung, Trevor Brück, Oscar Bader, Gary D. Wang, Bo Peter Munk Cardiac Centre University Health Network TorontoON Canada Department of Laboratory Medicine and Pathobiology University of Toronto TorontoON Canada Vector Institute TorontoON Canada Department of Molecular Genetics University of Toronto TorontoON Canada Donnelly Centre University of Toronto TorontoON Canada Princess Margaret Cancer Centre University Health Network TorontoON Canada School of Medicine and Pharmacy Ocean University of China Qingdao China New Delhi India Laboratory Oncology Dr. BRA-IRCH All India Institute of Medical Sciences New Delhi India Department of Image Reconstruction Nanjing Anke Medical Technology Co. Ltd. Nanjing China Shanghai Artificial Intelligence Laboratory Shanghai China Graduate School of AI KAIST Seoul Korea Republic of Shenzhen Research Institute of Big Data Shenzhen China Shenzhen China Helmholtz AI Research Center Jülich Jülich Germany Faculty of Mathematics and Natural Sciences Institute of Computer Science Heinrich Heine University Düsseldorf Düsseldorf Germany Hinxton United Kingdom Champalimaud Foundation - Centre for the Unknown Lisbon Portugal Department of Bioengineering Stanford University Palo AltoCA United States Tandon School of Engineering New York University New YorkNY United States School of Biomedical Engineering Health Science Center Shenzhen University Shenzhen China Lausanne Switzerland School of Biological Sciences University of Reading Reading United Kingdom Laboratoire de Chimie Bactérienne CNRS Université Aix Marseille UMR Institut de Microbiologie de la Méditerranée Marseille France Department of Internal Medicine I University Hospital Dresden Technical University Dresden Dresden Germany Else Kroener Fresenius Center for Digital Health Technical University Dresden Dresden Germany Department of Automation University of Science and Technology of China Hefei China Institute of Advanced Technology University of Science and Technology of China Hefei Chi

Cell segmentation is a critical step for quantitative single-cell analysis in microscopy images. Existing cell segmentation methods are often tailored to specific modalities or require manual interventions to specify hyper-parameters in different experimental settings. Here, we present a multi-modality cell segmentation benchmark, comprising over 1500 labeled images derived from more than 50 diverse biological experiments. The top participants developed a Transformer-based deep-learning algorithm that not only exceeds existing methods but can also be applied to diverse microscopy images across imaging platforms and tissue types without manual parameter adjustments. This benchmark and the improved algorithm offer promising avenues for more accurate and versatile cell analysis in microscopy imaging. © 2023, CC BY-NC-ND.

关键词： Deep learning

Feedback alfa-rooting algorithm for medical image enhancement 17

学校读者我要写书评

暂无评论

Feedback alfa-rooting algorithm for medical image enhancemen...

17th image Processing: Algorithms and Systems Conference, IPAS 2019

作者： Voronin, V. Zelensky, A. Agaian, S. Don State Technical University Lab. «Mathematical Methods of Image Processing and Computer Vision Intelligent Systems» Gagarina 1 Rostov on Don Russia Moscow State University of Technology "STANKIN" Moscow Russia CUNY/ College of Staten Island Dept. of Computer Science New York United States

This paper presents a new combined local and global transform domain-based feedback image enhancement algorithm for medical diagnosis, treatment, and clinical research. The basic idea in using local alfa-rooting method is to apply it to different disjoint blocks with different sizes. The block size and alfa-rooting parameters driven through optimization using the Agaian's cost function (image enhancement non-reference quality measure). The presented new approach allows enhancing MRI and CT images with uneven lighting and brightness gradient by preserving the local image features/details. Extensive computer simulations (CS) on real medical images are offered to gage the presented method. CS shows that our method improves the contrast and enhances the details of the medical images effectively compared with the current state-of-art methods. © 2019, Society for Imaging science and technology.

关键词： Clinical research