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

arXiv 2022年

作者： Maier-Hein, Lena Reinke, Annika Godau, Patrick Tizabi, Minu D. Buettner, Florian Christodoulou, Evangelia Glocker, Ben Isensee, Fabian Kleesiek, Jens Kozubek, Michal Reyes, Mauricio Riegler, Michael A. Wiesenfarth, Manuel Emre Kavur, A. Sudre, Carole H. Baumgartner, Michael Eisenmann, Matthias Heckmann-Nötzel, Doreen Rädsch, Tim Acion, Laura Antonelli, Michela Arbel, Tal Bakas, Spyridon Benis, Arriel Blaschko, Matthew B. Jorge Cardoso, M. Cheplygina, Veronika Cimini, Beth A. Collins, Gary S. Farahani, keyvan Ferrer, Luciana Galdran, Adrian Ginneken, Bram Van Haase, Robert Hashimoto, Daniel A. Hoffman, Michael M. Huisman, Merel Jannin, Pierre Kahn, Charles E. Kainmueller, Dagmar Kainz, Bernhard Karargyris, Alexandros Karthikesalingam, Alan Kenngott, Hannes Kofler, Florian Kopp-Schneider, Annette Kreshuk, Anna Kurc, Tahsin Landman, Bennett A. Litjens, Geert Madani, Amin Maier-Hein, Klaus Martel, Anne L. Mattson, Peter Meijering, Erik Menze, Bjoern Moons, Karel G.M. Müller, Henning Nichyporuk, Brennan Nickel, Felix Petersen, Jens Rajpoot, Nasir Rieke, Nicola Saez-Rodriguez, Julio Sánchez, Clara I. Shetty, Shravya Smeden, Maarten Van Summers, Ronald M. Taha, Abdel A. Tiulpin, Aleksei Tsaftaris, Sotirios A. Calster, Ben Van Varoquaux, Gaël Jäger, Paul F. Heidelberg Division of Intelligent Medical Systems and HI Helmholtz Imaging Germany Faculty of Mathematics and Computer Science and Medical Faculty Heidelberg University Heidelberg Germany NCT Heidelberg a partnership between DKFZ University Medical Center Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Heidelberg Division of Intelligent Medical Systems Germany partner site Frankfurt/Mainz a partnership between DKFZ and UCT Frankfurt-Marburg Germany Heidelberg Goethe University Frankfurt Germany Department of Medicine Goethe University Frankfurt Germany Department of Informatics Frankfurt Cancer Insititute Germany Department of Computing Imperial College London London United Kingdom Heidelberg Division of Medical Image Computing and HI Applied Computer Vision Lab Germany Institute for AI in Medicine University Medicine Essen Essen Germany Centre for Biomedical Image Analysis Faculty of Informatics Masaryk University Brno Czech Republic ARTORG Center for Biomedical Engineering Research University of Bern Bern Switzerland Department of Radiation Oncology University Hospital Bern University of Bern Bern Switzerland Simula Metropolitan Center for Digital Engineering Oslo Norway UiT The Arctic University of Norway Romsø Norway Heidelberg Division of Biostatistics Germany Heidelberg Division of Intelligent Medical Systems Division of Medical Image Computing HI Applied Computer Vision Lab Germany MRC Unit for Lifelong Health and Ageing UCL Centre for Medical Image Computing Department of Computer Science University College London London United Kingdom School of Biomedical Engineering and Imaging Science King’s College London London United Kingdom Heidelberg Division of Medical Image Computing Germany Instituto de Cálculo CONICET – Universidad de Buenos Aires Buenos Aires Argentina Centre for Medical Image Computing University College London London United Kingdom McGill University Montréal

Increasing evidence shows that flaws in machine learning (ML) algorithm validation are an underestimated global problem. Particularly in automatic biomedical image analysis, chosen performance metrics often do not reflect the domain interest, thus failing to adequately measure scientific progress and hindering translation of ML techniques into practice. To overcome this, we created Metrics Reloaded, a comprehensive framework guiding researchers in the problem-aware selection of metrics. It was developed by a large international consortium in a multi-stage Delphi process and is based on the novel concept of a problem fingerprint – a structured representation of the given problem that captures all aspects that are relevant for metric selection, from the domain interest to the properties of the target structure(s), data set and algorithm output. Based on the problem fingerprint, users are guided through the process of choosing and applying appropriate validation metrics while being made aware of potential pitfalls. Metrics Reloaded targets image analysis problems that can be interpreted as a classification task at image, object or pixel level, namely image-level classification, object detection, semantic segmentation, and instance segmentation tasks. To improve the user experience, we implemented the framework in the Metrics Reloaded online tool. Following the convergence of ML methodology across application domains, Metrics Reloaded fosters the convergence of validation methodology. Its applicability is demonstrated for various biomedical use cases. © 2022, CC BY.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

A survey on context-aware mobile visual recognition

A survey on context-aware mobile visual recognition

引用

作者： Min, Weiqing Jiang, Shuqiang Wang, Shuhui Xu, Ruihan Cao, Yushan Herranz, Luis He, Zhiqiang Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing100190 China Higher Education Institution Teacher Online Training Center Beijing China Lenovo Corporate Research Beijing100085 China

The phenomenal growth of the usage of mobile devices (e.g., mobile phones and tablet PCs) opens up a new service, namely mobile visual recognition, which has been widely used in many areas, such as mobile shopping and augmented reality. The rich contextual information (e.g., location, time and direction information), easily acquired by the mobile devices, provides useful clues to facilitate mobile visual recognition, including speeding up the recognition time and improving the recognition performance. This survey focuses on recent advances in Context-Aware Mobile Visual Recognition (CAMVR) and reviews related work regarding to different contextual information, recognition methods, recognition types, and various application scenarios. Finally, we discuss future research directions in this field. © 2016, Springer-Verlag Berlin Heidelberg.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Fast stochastic ordinal embedding with variance reduction and adaptive step size

arXiv

引用

arXiv 2019年

作者： Ma, Ke Zeng, Jinshan Xiong, Jiechao Xu, Qianqian Cao, Xiaochun Liu, Wei Yao, Yuan School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China School of Computer Information Engineering Jiangxi Normal University NanchangJiangxi330022 China Tencent AI Lab Shenzhen Guangdong China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Cyberspace Security Research Center Peng Cheng Laboratory Shenzhen518055 China School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China Department of Mathematics and by courtesy Department of Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong

—Learning representation from relative similarity comparisons, often called ordinal embedding, gains rising attention in recent years. Most of the existing methods are based on semi-definite programming (SDP), which is generally time-consuming and degrades the scalability, especially confronting large-scale data. To overcome this challenge, we propose a stochastic algorithm called SVRG-SBB, which has the following features: i) achieving good scalability via dropping positive semi-definite (PSD) constraints as serving a fast algorithm, i.e., stochastic variance reduced gradient (SVRG) method, and ii) adaptive learning via introducing a new, adaptive step size called the stabilized Barzilai-Borwein (SBB) step size. Theoretically, under some natural assumptions, we show the O(T1 ) rate of convergence to a stationary point of the proposed algorithm, where T is the number of total iterations. Under the further Polyak-Lojasiewicz assumption, we can show the global linear convergence (i.e., exponentially fast converging to a global optimum) of the proposed algorithm. Numerous simulations and real-world data experiments are conducted to show the effectiveness of the proposed algorithm by comparing with the state-of-the-art methods, notably, much lower computational cost with good prediction performance. Copyright © 2019, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Protein-coding genes combined with long noncoding RNA as a novel transcriptome molecular staging model to predict the survival of patients with esophageal squamous cell carcinoma

引用

Cancer Communications 2018年第1期38卷 50-62页

作者： Jin-Cheng Guo Yang Wu Yang Chen Feng Pan Zhi-Yong Wu Jia-Sheng Zhang Jian-Yi Wu Xiu-E Xu Jian-Mei Zhao En-Min Li Yi Zhao Li-Yan Xu Key Laboratory of Molecular Biology in High Cancer Incidence Coastal Chaoshan Area of Guangdong Higher Education Institutes Shantou University Medical CollegeShantouGuangdong 515041P.R.China Department of Biochemistry and Molecular Biology Shantou University Medical CollegeShantouGuangdong 515041P.R.China Departments of Oncology Surgery Shantou Central HospitalAffiliated Shantou Hospital of Sun Yat-Sen UniversityShantouGuangdong 515041P.R.China Institute of Oncologic Pathology Shantou University Medical CollegeShantouGuangdong 515041P.R.China Key Laboratory of Intelligent Information Processing Advanced Computer Research CenterState Key Laboratory of Computer ArchitectureInstitute of Computing TechnologyChinese Academy of SciencesBeijing 100190P.R.China

Background:Esophageal squamous cell carcinoma(ESCC)is the predominant subtype of esophageal carcinoma in *** study was to develop a staging model to predict outcomes of patients with ***:Using Cox regression analysis,principal component analysis(PCA),partitioning clustering,Kaplan-Meier analysis,receiver operating characteristic(ROC)curve analysis,and classification and regression tree(CART)analysis,we mined the Gene Expression Omnibus database to determine the expression profiles of genes in 179 patients with ESCC from GSE63624 and GSE63622 ***:Univariate cox regression analysis of the GSE63624 dataset revealed that 2404 protein-coding genes(PCGs)and 635 long non-coding RNAs(lncRNAs)were associated with the survival of patients with *** categorized these PCGs and lncRNAs into three principal components(PCs),which were used to cluster the patients into three *** analysis demonstrated that the predictive ability of PCG-lncRNA PCs when applied to new patients was better than that of the tumor-node-metastasis staging(area under ROC curve[AUC]:0.69 vs.0.65,P<0.05).Accord-ingly,we constructed a molecular disaggregated model comprising one lncRNA and two PCGs,which we desig-nated as the LSB staging model using CART analysis in the GSE63624 *** LSB staging model classified the GSE63622 dataset of patients into three different groups,and its effectiveness was validated by analysis of another cohort of 105 ***:The LSB staging model has clinical significance for the prognosis prediction of patients with ESCC and may serve as a three-gene staging microarray.

关键词： Long non-coding RNA Protein-coding gene Esophageal squamous cell carcinoma Overall survival Staging model Transcriptome

来源：评论

学校读者我要写书评

暂无评论

An automatic biomedical ontology meta-matching technique

Journal of Network Intelligence

引用

Journal of Network Intelligence 2019年第3期4卷 109-113页

作者： Xue, Xingsi Yang, Haiyan Zhang, Jie Zhang, Jing Chen, Dongxu College of Information Science and Engineering Intelligent Information Processing Research Center Fujian Key Lab for Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology No.3 Xueyuan Road University Town Minhou Fuzhou CityFujian Province350118 China College of Information Science and Engineering Fujian University of Technology No.33 Xuefu South Road University Town Minhou Fuzhou CityFujian Province350118 China School of Computer Science and Engineering Yulin Normal University No.299 Education Middle Road Yulin CityGuanxi Province537000 China School of Computing Ulster University Jordanstown BT370QB United Kingdom Fujian Medical University Union Hospital No.29 Xinquan Road Gulou Fuzhou CityFujian Province350001 China

Biomedical ontology matching aims at determining the heterogeneous biomed-ical concepts, and bridging the semantic gap between heterogeneous biomedical ontologies. The foundation of a biomedical ontology matching technique is the Biomedical Concept Similarity Measure (BCSM), which calculates the similarity value between two biomed-ical concepts. Since various BCSMs have different advantages, usually several BCSMs are aggregated together to improve the result’s confidence. How to tune the aggregating weights to ensure the quality of the alignment is called biomedical ontology meta-matching problem, which is a challenge in the ontology matching domain. Currently, researchers mainly focus on how to tune the aggregating weights for various similarity measures to improve the quality of the ontology alignments. However, the ignorance of the effects brought about by different biomedical concept mapping’s preference on different similarity measures significantly reduces the alignment’s quality. To overcome this drawback, in this work, we formally define the biomedical ontology meta-matching problem, and then present an Ordered Weighted Average (OWA) based approach to automatically aggregate various biomedical concept similarity measures. In our method, the aggregating weights determined for each concept mapping is associated with the ordered position of the similarity value instead of a particular concept similarity measure. The experiment utilizes the large biomed track provided by Ontology Alignment Evaluation Initiative (OAEI) to test our proposal’s performance, and the experimental results show the effectiveness of our proposal. © 2019, Taiwan Ubiquitous information. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Correction to: Predicting protein inter-residue contacts using composite likelihood maximization and deep learning

引用

BMC bioinformatics 2019年第1期20卷 616页

作者： Haicang Zhang Qi Zhang Fusong Ju Jianwei Zhu Yujuan Gao Ziwei Xie Minghua Deng Shiwei Sun Wei-Mou Zheng Dongbo Bu Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China. University of Chinese Academy of Sciences Beijing China. Center for Quantitative Biology School of Mathematical Sciences Center for Statistical Sciences Peking University Beijing China. College of Life Science and Technology Huazhong University of Science and Technology Wuhan China. Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China. dwsun@***. Institute of Theoretical Physics Chinese Academy of Sciences Beijing China. zheng@***. Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China. dbu@***. University of Chinese Academy of Sciences Beijing China. dbu@***.

Following publication of the original article [1], the author explained that there are several errors in the original article.

关键词：

来源：评论

学校读者我要写书评

暂无评论

WISERNet: Wider Separate-then-reunion Network for Steganalysis of Color Images

arXiv

引用

arXiv 2018年

作者： Zeng, Jishen Tan, Shunquan Liu, Guangqing Li, Bin Huang, Jiwu Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Guangdong Key Lab. of Intelligent Info. Processing and Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen518060 China Peng Cheng Laboratory Shenzhen518052 China

Until recently, deep steganalyzers in spatial domain have been all designed for gray-scale images. In this paper, we propose WISERNet (the wider separate-then-reunion network) for steganalysis of color images. We provide theoretical rationale to claim that the summation in normal convolution is one sort of "linear collusion attack" which reserves strong correlated patterns while impairs uncorrelated noises. Therefore in the bottom convolutional layer which aims at suppressing correlated image contents, we adopt separate channel-wise convolution without summation instead. Conversely, in the upper convolutional layers we believe that the summation in normal convolution is beneficial. Therefore we adopt united normal convolution in those layers and make them remarkably wider to reinforce the effect of "linear collusion attack". As a result, our proposed wide-and-shallow, separate-then-reunion network structure is specifically suitable for color image steganalysis. We have conducted extensive experiments on color image datasets generated from BOSSBase raw images and another large-scale dataset which contains 100,000 raw images, with di_erent demosaicking algorithms and downsampling algorithms. The experimental results show that our proposed network outperforms other state-of-the-art color image steganalytic models either hand-crafted or learned using deep networks in the literature by a clear margin. Specifically, it is noted that the detection performance gain is achieved with less than half the complexity compared to the most advanced deeplearning steganalyzer as far as we know, which is scarce in the literature. Copyright © 2018, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Shape DNA: Basic generating functions for geometric moment invariants

arXiv

引用

arXiv 2017年

作者： Erbo Li Yazhou Huang Dong Xu Li, Hua Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences

Geometric moment invariants (GMIs) have been widely used as basic tool in shape analysis and information retrieval. Their structure and characteristics determine efficiency and effectiveness. Two fundamental building blocks or generating functions (GFs) for invariants are discovered, which are dot product and vector product of point vectors in Euclidean space. The primitive invariants (PIs) can be derived by carefully selecting different products of GFs and calculating the corresponding multiple integrals, which translates polynomials of coordinates of point vectors into geometric moments. Then the invariants themselves are expressed in the form of product of moments. This procedure is just like DNA encoding proteins. All GMIs available in the literature can be decomposed into linear combinations of PIs. This paper shows that Hu's seven well known GMIs in computer vision have a more deep structure, which can be further divided into combination of simpler PIs. In practical uses, low order independent GMIs are of particular interest. In this paper, a set of PIs for similarity transformation and affine transformation in 2D are presented, which are simpler to use, and some of which are newly reported. The discovery of the two generating functions provides a new perspective of better understanding shapes in 2D and 3D Euclidean spaces, and the method proposed can be further extended to higher dimensional spaces and different manifolds, such as curves, surfaces and so on. Copyright © 2017, The Authors. All rights reserved.

关键词： DNA

来源：评论

学校读者我要写书评

暂无评论

Giant power output in lead-free ferroelectrics by shock-induced phase transition

引用

Physical Review Materials 2019年第3期3卷 035401-035401页

作者： Zhipeng Gao Wei Peng Bin Chen Simon A. T. Redfern Ke Wang Baojin Chu Qiang He Yi Sun Xuefeng Chen Hengchang Nie Wen Deng Lingkong Zhang Hongliang He Genshui Wang Xianlin Dong National Key Laboratory of Shock Wave and Detonation Physics Institute of Fluid Physics China Academy of Engineering Physics Mianyang 621900 China CAS Key Laboratory of Inorganic Functional Materials and Devices Shanghai Institute of Ceramics Chinese Academy of Sciences Shanghai 200050 China Center for High Pressure Science and Technology Advanced Research Shanghai 201203 China Department of Earth Sciences University of Cambridge Cambridge CB2 3EQ United Kingdom State Key Laboratory of New Ceramics and Fine Processing School of Materials Science and Engineering Tsinghua University Beijing 100084 China Information and Quantum Physics University of Science and Technology of China Hefei 230026 China The State Key Lab of High Performance and Superfine Microstructure Shanghai Institute of Ceramics Chinese Academy of Sciences Shanghai 200050 China

The force-electric effect in ferroelectrics is characterized by the release of bound charge during pressure/shock-induced depolarization. In contrast to other electrical energy storage systems, the charge-storage/release by the force-electric effect of ferroelectrics is determined by polarization switching or polar-nonpolar phase transition. This offers a further set of options for materials design in the realm of energy conversion, especially for the high power density applications. Here, we report that a ferroelectric ceramic, Na0.5Bi0.5TiO3 (NBT), can generate a high power output (3.04×108W/kg) under shock compression, which is one of the highest values achieved by the force-electric effect. The in situ synchrotron x-ray diffraction studies reveal that this power output mainly arises from a polar-nonpolar phase transition (rhombohedral-orthorhombic). First-principles calculations show that this is a first-order phase transition that undergoes two-step structure changes. These results extend the application of the force-electric effect and are a key step in understanding the phase transition behaviors of NBT under high pressure.

关键词： Ferroelectricity Phase transitions Pressure effects

来源：评论

学校读者我要写书评

暂无评论

Why is the Winner the Best?

Why is the Winner the Best?

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： M. Eisenmann A. Reinke V. Weru M. D. Tizabi F. Isensee T. J. Adler S. Ali V. Andrearczyk M. Aubreville U. Baid S. Bakas N. Balu S. Bano J. Bernal S. Bodenstedt A. Casella V. Cheplygina M. Daum M. De Bruijne A. Depeursinge R. Dorent J. Egger D. G. Ellis S. Engelhardt M. Ganz N. Ghatwary G. Girard P. Godau A. Gupta L. Hansen K. Harada M. Heinrich N. Heller A. Hering A. Huaulmé P. Jannin A. E. Kavur O. Kodym M. Kozubek J. Li H. Li J. Ma C. Martín-Isla B. Menze A. Noble V. Oreiller N. Padoy S. Pati K. Payette T. Rädsch J. Rafael-Patiño V. Singh Bawa S. Speidel C. H. Sudre K. Van Wijnen M. Wagner D. Wei A. Yamlahi M. H. Yap C. Yuan M. Zenk A. Zia D. Zimmerer D. Aydogan B. Bhattarai L. Bloch R. Brüngel J. Cho C. Choi Q. Dou I. Ezhov C. M. Friedrich C. Fuller R. R. Gaire A. Galdran Á. García Faura M. Grammatikopoulou S. Hong M. Jahanifar I. Jang A. Kadkhodamohammadi I. Kang F. Kofler S. Kondo H. Kuijf M. Li M. Luu T. Martinčič P. Morais M. A. Naser B. Oliveira D. Owen S. Pang J. Park S. Park S. Płotka E. Puybareau N. Rajpoot K. Ryu N. Saeed A. Shephard P. Shi D. Štepec R. Subedi G. Tochon H. R. Torres H. Urien J. L. Vilaça K. A. Wahid H. Wang J. Wang L. Wang X. Wang B. Wiestler M. Wodzinski F. Xia J. Xie Z. Xiong S. Yang Y. Yang Z. Zhao K. Maier-Hein P. F. Jäger A. Kopp-Schneider L. Maier-Hein Division of Intelligent Medical Systems German Cancer Research Center (DKFZ) Heidelberg Germany Helmholtz Imaging German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Division of Biostatistics German Cancer Research Center (DKFZ) Heidelberg Germany Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Engineering and Physical Sciences School of Computing University of Leeds Leeds UK Institute of Informatics School of Management HES-SO Valais-Wallis University of Applied Sciences and Arts Western Switzerland Sierre Switzerland Department of Nuclear Medicine and Molecular Imaging Lausanne University Hospital Lausanne Switzerland Technische Hochschule Ingolstadt Ingolstadt Germany Center for Artificial Intelligence and Data Science for Integrated Diagnostics (AI2D) and Center for Biomedical Image Computing and Analytics (CBICA) University of Pennsylvania Philadelphia PA USA Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology University of Washington Seattle WA USA Department of Computer Science Wellcome/EPSRC Centre for Interventional and Surgical Sciences (WEISS) University College London London UK Universitat Autònoma de Barcelona & Computer Vision Center Barcelona Spain Division of Translational Surgical Oncology National Center for Tumor Diseases (NCT/UCC) Dresden Dresden Germany Department of Advanced Robotics Istituto Italiano di Tecnologia Italy Department of Electronics Information and Bioengineering Politecnico di Milano Milan Italy IT University of Copenhagen Copenhagen Denmark Department of General Visceral and Transplantation Surgery Heidelberg University Hospital Heidelberg Germany Department of Radiology and Nuc

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multicenter study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and post-processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：