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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FEEDING THE ZOMBIES: SYNTHESIZING BRAIN VOLUMES USING A 3D PROGRESSIVE GROWING GAN

arXiv

引用

arXiv 2019年

作者： Eklund, Anders Division of Medical Informatics Department of Biomedical Engineering Division of Statistics and Machine learning Department of Computer and Information Science Center for Medical Image Science and Visualization Linköping University Linköping Sweden

Deep learning requires large datasets for training (convolutional) networks with millions of parameters. In neuroimaging, there are few open datasets with more than 100 subjects, which makes it difficult to, for example, train a classifier to discriminate controls from diseased persons. Generative adversarial networks (GANs) can be used to synthesize data, but virtually all research is focused on 2D images. In medical imaging, and especially in neuroimaging, most datasets are 3D or 4D. Here we therefore present preliminary results showing that a 3D progressive growing GAN can be used to synthesize MR brain volumes. Copyright © 2019, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

GENERATING FMRI VOLUMES FROM T1-WEIGHTED VOLUMES USING 3D CYCLEGAN

arXiv

引用

arXiv 2019年

作者： Abramian, David Eklund, Anders Division of Medical Informatics Department of Biomedical Engineering Division of Statistics and Machine learning Department of Computer and Information Science Center for Medical Image Science and Visualization Linköping University Linköping Sweden

Registration between an fMRI volume and a T1-weighted volume is challenging, since fMRI volumes contain geometric distortions. Here we present preliminary results showing that 3D CycleGAN can be used to synthesize fMRI volumes from T1-weighted volumes, and vice versa, which can facilitate registration. Copyright © 2019, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Correction: Understanding overfitting in random forest for probability estimation: a visualization and simulation study

引用

Diagnostic and prognostic research 2025年第1期9卷 9页

作者： Lasai Barreñada Paula Dhiman Dirk Timmerman Anne-Laure Boulesteix Ben Van Calster Department of Development and Regeneration Louvain KU Belgium. Leuven Unit for Health Technology Assessment Research (LUHTAR) Louvain KU Belgium. Centre for Statistics in Medicine Nuffield Department of Orthopaedics Rheumatology and Musculoskeletal Sciences University of Oxford Oxford UK. Department of Obstetrics and Gynecology University Hospitals Leuven Louvain Belgium. Institute for Medical Information Processing Biometry and Epidemiology Faculty of Medicine LMU Munich Munich Germany. Munich Center for Machine Learning Munich Germany. Department of Development and Regeneration Louvain KU Belgium. ben.vancalster@kuleuven.be. Leuven Unit for Health Technology Assessment Research (LUHTAR) Louvain KU Belgium. ben.vancalster@kuleuven.be. Department of Biomedical Data Sciences Leiden University Medical Centre Leiden the Netherlands. ben.vancalster@kuleuven.be.

来源：评论

学校读者我要写书评

暂无评论

Variational Policy Gradient Method for Reinforcement learning with General Utilities

arXiv

引用

arXiv 2020年

作者： Zhang, Junyu Koppel, Alec Bedi, Amrit Singh Szepesvari, Csaba Wang, Mengdi Department of Industrial and Systems Engineering University of Minnesota MinneapolisMN55455 United States Computational and Information Sciences Directorate US Army Research Laboratory AdelphiMD20783 United States Department of Computer Science DeepMind University of Alberta PrincetonNJ08544 United States Department of Electrical Engineering Center for Statistics and Machine Learning Princeton University Deepmind PrincetonNJ08544 United States

In recent years, reinforcement learning (RL) systems with general goals beyond a cumulative sum of rewards have gained traction, such as in constrained problems, exploration, and acting upon prior experiences. In this paper, we consider policy optimization in Markov Decision Problems, where the objective is a general concave utility function of the state-action occupancy measure, which subsumes several of the aforementioned examples as special cases. Such generality invalidates the Bellman equation. As this means that dynamic programming no longer works, we focus on direct policy search. Analogously to the Policy Gradient Theorem Sutton et al. (2000) available for RL with cumulative rewards, we derive a new Variational Policy Gradient Theorem for RL with general utilities, which establishes that the parametrized policy gradient may be obtained as the solution of a stochastic saddle point problem involving the Fenchel dual of the utility function. We develop a variational Monte Carlo gradient estimation algorithm to compute the policy gradient based on sample paths. We prove that the variational policy gradient scheme converges globally to the optimal policy for the general objective, though the optimization problem is nonconvex. We also establish its rate of convergence of the order O(1/t) by exploiting the hidden convexity of the problem, and proves that it converges exponentially when the problem admits hidden strong convexity. Our analysis applies to the standard RL problem with cumulative rewards as a special case, in which case our result improves the available convergence rate. Copyright © 2020, The Authors. All rights reserved.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Strategic priorities for transformative progress in advancing biology with proteomics and artificial intelligence

arXiv

引用

arXiv 2025年

作者： Sun, Yingying Jun, A. Liu, Zhiwei Sun, Rui Qian, Liujia Payne, Samuel H. Bittremieux, Wout Ralser, Markus Li, Chen Chen, Yi Dong, Zhen Perez-Riverol, Yasset Khan, Asif Sander, Chris Aebersold, Ruedi Vizcaíno, Juan Antonio Krieger, Jonathan R. Yao, Jianhua Wen, Han Zhang, Linfeng Zhu, Yunping Xuan, Yue Sun, Benjamin Boyang Qiao, Liang Hermjakob, Henning Tang, Haixu Gao, Huanhuan Deng, Yamin Zhong, Qing Chang, Cheng Bandeira, Nuno Li, Ming Weinan, E. Sun, Siqi Yang, Yuedong Omenn, Gilbert S. Zhang, Yue Xu, Ping Fu, Yan Liu, Xiaowen Overall, Christopher M. Wang, Yu Deutsch, Eric W. Chen, Luonan Cox, Jürgen Demichev, Vadim He, Fuchu Huang, Jiaxing Jin, Huilin Liu, Chao Li, Nan Luan, Zhongzhi Song, Jiangning Yu, Kaicheng Wan, Wanggen Wang, Tai Zhang, Kang Zhang, Le Bell, Peter A. Mann, Matthias Zhang, Bing Guo, Tiannan Affiliated Hangzhou First People’s Hospital State Key Laboratory of Medical Proteomics School of Medicine Westlake University Zhejiang Province Hangzhou China Westlake Center for Intelligent Proteomics Westlake Laboratory of Life Sciences and Biomedicine Zhejiang Province Hangzhou China Biology Department Brigham Young University ProvoUT84602 United States Department of Computer Science University of Antwerp Antwerp2020 Belgium Department of Biochemistry CharitéUniversitätsmedizin Berlin Berlin Germany Biomedicine Discovery Institute Department of Biochemistry and Molecular Biology Monash University MelbourneVICVIC 3800 Australia Wellcome Genome Campus Hinxton CambridgeCB10 1SD United Kingdom Harvard Medical School Ludwig Center at Harvard United States Harvard Medical School Broad Institute Ludwig Center at Harvard Dana-Farber Cancer Institute United States Department of Biology Institute of Molecular Systems Biology ETH Zürich Zürich Switzerland Bruker Ltd. MiltonONL9T 6P4 Canada AI for Life Sciences Lab Tencent Shenzhen518057 China State Key Laboratory of Medical Proteomics AI for Science Institute Beijing100080 China Beijing Institute of Lifeomics Beijing102206 China Thermo Fisher Scientific GmbH Hanna-Kunath Str. 11 Bremen28199 Germany Informatics and Predictive Sciences Research Bristol Myers Squibb United States Department of Chemistry Fudan University Songhu Road 2005 Shanghai200438 China Department of Computer Science Luddy School of Informatics Computing and Engineering Indiana University IN47408 United States ProCan® Children’s Medical Research Institute Faculty of Medicine and Health The University of Sydney WestmeadNSW Australia La Jolla CA United States Central China Institute of Artificial Intelligence University of Waterloo Canada AI for Science Institute Center for Machine Learning Research School of Mathematical Sciences Peking University China Research Institute of Intelligent Complex Systems Fudan U

Artificial intelligence (AI) is transforming scientific research, including proteomics. Advances in mass spectrometry (MS)-based proteomics data quality, diversity, and scale, combined with groundbreaking AI techniques, are unlocking new challenges and opportunities in biological discovery. Here, we highlight key areas where AI is driving innovation, from data analysis to new biological insights. These include developing an AI-friendly ecosystem for proteomics data generation, sharing, and analysis;improving peptide and protein identification and quantification;characterizing protein-protein interactions and protein complexes;advancing spatial and perturbation proteomics;integrating multi-omics data;and ultimately enabling AI-empowered virtual cells. © 2025, CC BY.

关键词： Biotic

来源：评论

学校读者我要写书评

暂无评论

Erratum to ‘Model-Based Cost-Utility Analysis of Combined Low-Dose Computed Tomography Screening for Lung Cancer, Chronic Obstructive Pulmonary Disease, and Cardiovascular Disease’ [JTO Clinical and Research Reports Volume 6 Issue 5 (2025) 100813]

引用

JTO Clinical and Research Reports 2025年第7期6卷

作者： Carina M. Behr Maarten J. IJzerman Michelle M.A. Kip Harry J.M. Groen Marjolein A. Heuvelmans Maarten van den Berge Pim van der Harst Marleen Vonder Rozemarijn Vliegenthart Hendrik Koffijberg Health Technology and Services Research TechMed Centre University of Twente Enschede The Netherlands Erasmus School of Health Policy & Management Erasmus University Rotterdam Rotterdam The Netherlands Department of Pulmonary Diseases and Tuberculosis UMCG - University Medical Center Groningen Groningen The Netherlands Department of Epidemiology University Medical Center of Groningen University of Groningen Groningen The Netherlands Department of Pulmonary Diseases University of Groningen University Medical Center Groningen Groningen The Netherlands Groningen Research Institute for Asthma and COPD University of Groningen University Medical Center Groningen Groningen The Netherlands Department of Cardiology University Medical Center Utrecht Utrecht The Netherlands Department of Radiology Medical Imaging Center University Medical Center Groningen University of Groningen Groningen The Netherlands Machine Learning Lab Data Science Center in Health (DASH) University Medical Center Groningen University of Groningen Groningen The Netherlands

来源：评论

学校读者我要写书评

暂无评论

Constructing Impactful machine learning Research for Astronomy: Best Practices for Researchers and Reviewers

arXiv

引用

arXiv 2023年

作者： Huppenkothen, Daniela Ntampaka, Michelle Ho, Matthew Fouesneau, Morgan Nord, Brian Peek, J.E.G. Walmsley, Mike Wu, John F. Avestruz, C. Buck, Tobias Brescia, Massimo Finkbeiner, Douglas P. Goulding, Andy D. Kacprzak, T. Melchior, Peter Pasquato, Mario Ramachandra, Nesar Ting, Yuan-Sen van de Ven, Glenn Villar, Soledad Villar, V.A. Zinger, Elad SRON Netherlands Institute for Space Research Niels Bohrweg 4 Leiden2333CA Netherlands Anton Pannekoek Institute for Astronomy University of Amsterdam Science Park 904 Amsterdam1098 XH Netherlands Space Telescope Science Institute BaltimoreMD21218 United States Department of Physics & Astronomy Johns Hopkins University BaltimoreMD21218 United States UMR 7095 98 bis bd Arago ParisF-75014 France Königstuhl 17 HeidelbergD-69117 Germany Fermi National Accelerator Laboratory P. O. Box 500 BataviaIL60510 United States Kavli Institute for Cosmological Physics University of Chicago ChicagoIL60637 United States Department of Astronomy and Astrophysics University of Chicago ChicagoIL60637 United States Jodrell Bank Centre for Astrophysics Department of Physics & Astronomy University of Manchester ManchesterM13 9PL United Kingdom Dunlap Institute for Astronomy & Astrophysics University of Toronto 50 St. George Street TorontoONM5S 3H4 Canada Leinweber Center for Theoretical Physics University of Michigan Ann ArborMI48109 United States Department of Physics University of Michigan Ann ArborMI48109 United States Universität Heidelberg Interdisziplinäres Zentrum für Wissenschaftliches Rechnen Im Neuenheimer Feld 205 Heidelberg69120 Germany Universität Heidelberg Zentrum für Astronomie Institut für Theoretische Astrophysik Albert-Ueberle-Straße 2 Heidelberg69120 Germany Department of Physics "E. Pancini " University Federico II of Napoli Via Cinthia 21 NapoliI-80126 Italy INAF Astronomical Observatory of Capodimonte Salita Moiariello 16 NapoliI-80131 Italy Department of Physics Harvard University 17 Oxford St. CambridgeMA02138 United States Harvard-Smithsonian Center for Astrophysics 60 Garden St. CambridgeMA02138 United States Department of Astrophysical Sciences Princeton University PrincetonNJ08544 United States Swiss Data Science Center Paul Scherrer Institute Villigen5303 Switzerland Center for Statistics & Machine Learn

machine learning has rapidly become a tool of choice for the astronomical community. It is being applied across a wide range of wavelengths and problems, from the classification of transients to neural network emulators of cosmological simulations, and is shifting paradigms about how we generate and report scientific results. At the same time, this class of method comes with its own set of best practices, challenges, and drawbacks, which, at present, are often reported on incompletely in the astrophysical literature. With this paper, we aim to provide a primer to the astronomical community, including authors, reviewers, and editors, on how to implement machine learning models and report their results in a way that ensures the accuracy of the results, reproducibility of the findings, and usefulness of the method. Copyright © 2023, The Authors. All rights reserved.

关键词： machine learning

来源：评论

学校读者我要写书评

暂无评论

A Review of Generalized Zero-Shot learning Methods

arXiv

引用

arXiv 2020年

作者： Pourpanah, Farhad Abdar, Moloud Luo, Yuxuan Zhou, Xinlei Wang, Ran Lim, Chee Peng Wang, Xi-Zhao Jonathan Wu, Q.M. The Centre for Computer Vision and Deep Learning Department of Electrical and Computer Engineering University of Windsor WindsorONN9B 3P4 Canada Deakin University Australia The Department of Computer Science City University of Hong Kong Hong Kong The College of Mathematics and Statistics Shenzhen Key Lab. of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China The College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University Shenzhen518060 China

Generalized zero-shot learning (GZSL) aims to train a model for classifying data samples under the condition that some output classes are unknown during supervised learning. To address this challenging task, GZSL leverages semantic information of the seen (source) and unseen (target) classes to bridge the gap between both seen and unseen classes. Since its introduction, many GZSL models have been formulated. In this review paper, we present a comprehensive review on GZSL. Firstly, we provide an overview of GZSL including the problems and challenges. Then, we introduce a hierarchical categorization for the GZSL methods and discuss the representative methods in each category. In addition, we discuss the available benchmark data sets and applications of GZSL, along with a discussion on the research gaps and directions for future investigations. Copyright © 2020, The Authors. All rights reserved.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Evaluating one-shot tournament predictions

arXiv

引用

arXiv 2019年

作者： Ekstrøm, Claus Thorn Ley, Christophe Van Eetvelde, Hans Brefeld, Ulf Section of Biostatistics Department of Public Health University of Copenhagen Denmark Department of Applied Mathematics Computer Science and Statistics Universiteit Gent Belgium Machine Learning Group Leuphana University of Lüneburg Germany

We introduce the Tournament Rank Probability Score (TRPS) as a measure to evaluate and compare pre-tournament predictions, where predictions of the full tournament results are required to be available before the tournament begins. The TRPS handles partial ranking of teams, gives credit to predictions that are only slightly wrong, and can be modified with weights to stress the importance of particular features of the tournament prediction. Thus, the Tournament Rank Prediction Score is more flexible than the commonly preferred log loss score for such tasks. In addition, we show how predictions from historic tournaments can be optimally combined into ensemble predictions in order to maximize the TRPS for a new tournament. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：