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

arXiv 2023年

作者： Waldmannstetter, Diana Ezhov, Ivan Wiestler, Benedikt Campi, Francesco Kukuljan, Ivan Ehrlich, Stefan Vinayahalingam, Shankeeth Baheti, Bhakti Chakrabarty, Satrajit Baid, Ujjwal Bakas, Spyridon Schwarting, Julian Metz, Marie Kirschke, Jan S. Rueckert, Daniel Heckemann, Rolf A. Piraud, Marie Menze, Bjoern H. Kofler, Florian Department of Computer Science TUM School of Computation Information and Technology Technical University of Munich Munich Germany Department of Quantitative Biomedicine University of Zurich Zurich Switzerland Department of Diagnostic and Interventional Neuroradiology School of Medicine Klinikum rechts der Isar Technical University of Munich Germany Helmholtz AI Helmholtz Munich Neuherberg Germany TranslaTUM - Central Institute for Translational Cancer Research Technical University of Munich Germany Healthcare Technologies SETLabs Research Munich Germany Department of Oral and Maxillofacial Surgery Radboud University Nijmegen Medical Centre Nijmegen Netherlands Division of Computational Pathology Department of Pathology and Laboratory Medicine School of Medicine Indiana University IndianapolisIN United States Department of Electrical and Systems Engineering Washington University in St.Louis St. LouisMO United States Artificial Intelligence in Healthcare and Medicine Technical University of Munich Munich Germany Department of Computing Imperial College London London United Kingdom Department of Medical Radiation Sciences University of Gothenburg Gothenburg Sweden

Accurate image registration is pivotal in bio-medical image analysis, where selecting suitable registration algorithms demands careful consideration. While numerous algorithms are available, the evaluation metrics to assess their performance have remained relatively static. This study addresses this challenge by introducing a novel evaluation metric termed Landmark Hit Rate (HitR), which focuses on the clinical relevance of image registration accuracy. Unlike traditional metrics such as Target Registration Error, which emphasize sub-resolution differences, HitR considers whether registration algorithms successfully position landmarks within defined confidence zones. This paradigm shift acknowledges the inherent annotation noise in medical images, allowing for more meaningful assessments. To equip HitR with label-noise-awareness, we propose defining these confidence zones based on an Inter-rater Variance analysis. Consequently, hit rate curves are computed for varying landmark zone sizes, enabling performance measurement for a task-specific level of accuracy. Our approach offers a more realistic and meaningful assessment of image registration algorithms, reflecting their suitability for clinical and biomedical applications. Copyright © 2023, The Authors. All rights reserved.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Systematic Improvements in Transmon Qubit Coherence Enabled by Niobium Surface Encapsulation

arXiv

引用

arXiv 2023年

作者： Bal, Mustafa Murthy, Akshay A. Zhu, Shaojiang Crisa, Francesco You, Xinyuan Huang, Ziwen Roy, Tanay Lee, Jaeyel van Zanten, David Pilipenko, Roman Nekrashevich, Ivan Lunin, Andrei Bafia, Daniel Krasnikova, Yulia Kopas, Cameron J. Lachman, Ella O. Miller, Duncan Mutus, Josh Y. Reagor, Matthew J. Cansizoglu, Hilal Marshall, Jayss Pappas, David P. Vu, Kim Yadavalli, Kameshwar Oh, Jin-Su Zhou, Lin Kramer, Matthew J. Lecocq, Florent Q. Goronzy, Dominic P. Torres-Castanedo, Carlos G. Pritchard, Graham Dravid, Vinayak P. Rondinelli, James M. Bedzyk, Michael J. Hersam, Mark C. Zasadzinski, John Koch, Jens Sauls, James A. Romanenko, Alexander Grassellino, Anna BataviaIL60510 United States Rigetti Computing BerkeleyCA94710 United States Ames Laboratory U.S. Department of Energy AmesIA50011 United States National Institute of Standards and Technology BoulderCO United States Department of Materials Science and Engineering Northwestern University EvanstonIL60208 United States The NUANCE Center Northwestern University EvanstonIL60208 United States International Institute of Nanotechnology Northwestern University EvanstonIL60208 United States Department of Chemistry Northwestern University EvanstonIL60208 United States Department of Electrical and Computer Engineering Northwestern University EvanstonIL60208 United States Department of Physics Illinois Institute of Technology ChicagoIL60616 United States Department of Physics and Astronomy Northwestern University EvanstonIL60208 United States Center for Applied Physics and Superconducting Technologies Northwestern University EvanstonIL60208 United States Hearne Institute of Theoretical Physics Department of Physics and Astronomy Louisiana State University Baton RougeLA70803 United States

We present a novel transmon qubit fabrication technique that yields systematic improvements in T1 relaxation times. We fabricate devices using an encapsulation strategy that involves passivating the surface of niobium and thereby preventing the formation of its lossy surface oxide. By maintaining the same superconducting metal and only varying the surface structure, this comparative investigation examining different capping materials, such as tantalum, aluminum, titanium nitride, and gold, and film substrates across different qubit foundries definitively demonstrates the detrimental impact that niobium oxides have on the coherence times of superconducting qubits, compared to native oxides of tantalum, aluminum or titanium nitride. Our surface-encapsulated niobium qubit devices exhibit T1 relaxation times 2 to 5 times longer than baseline niobium qubit devices with native niobium oxides. When capping niobium with tantalum, we obtain median qubit lifetimes above 300 microseconds, with maximum values up to 600 microseconds, that represent the highest lifetimes to date for superconducting qubits prepared on both sapphire and silicon. Our comparative structural and chemical analysis suggests why amorphous niobium oxides may induce higher losses compared to other amorphous oxides. These results are in line with high-accuracy measurements of the niobium oxide loss tangent obtained with ultra-high Q superconducting radiofrequency (SRF) cavities. This new surface encapsulation strategy enables even further reduction of dielectric losses via passivation with ambient-stable materials, while preserving fabrication and scalable manufacturability thanks to the compatibility with silicon processes. © 2023, CC BY.

关键词： Fabrication

来源：评论

学校读者我要写书评

暂无评论

Ultrathin active polarization-selective metasurface at X-band frequencies

引用

Physical Review B 2019年第7期100卷 075131-075131页

作者： Josip Lončar Anthony Grbic Silvio Hrabar Faculty of Electrical Engineering and Computing University of Zagreb Unska 3 10000 Zagreb Croatia Radiation Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor Michigan 48109-2122 USA

An ultrathin active polarization-selective metasurface is designed and optimized for operation in the X band. The metasurface leverages the design of a previously reported passive polarization converting metasurface. Similar to the passive polarization converter, the proposed active metasurface consists of three patterned metallic sheets. Its bottom sheet is modified and populated with ultrawideband, unconditionally stable amplifiers and corresponding biasing networks. The metasurface provides over 35 dB of input-output isolation achieved through orthogonal polarizations, which ensures stable operation. It was fabricated with a low-cost, printed-circuit-board and pick-and-place process. The performance of the metasurface was measured and its stability confirmed. The desired effects of amplification, polarization conversion, polarization selectivity, and nonreciprocal behavior were successfully demonstrated in both full-wave simulations and measurements. Due to its extremely small thickness (0.66 mm or 0.02λ at 10 GHz), the metasurface shows excellent performance for a wide range of incident angles, which exceeds ±30∘. It achieves a perfect (100%) polarization conversion ratio in simulation, and 98.4% in measurement.

关键词： Metamaterials Polarization

来源：评论

学校读者我要写书评

暂无评论

Measuring success for a future vision: Defining impact in science gateways/virtual research environments

Measuring success for a future vision: Defining impact in sc...

引用

作者： Calyam, Prasad Wilkins-Diehr, Nancy Miller, Mark Brookes, Emre H. Arora, Ritu Chourasia, Amit Jennewein, Douglas M. Nandigam, Viswanath Drew LaMar, M. Cleveland, Sean B. Newman, Greg Wang, Shaowen Zaslavsky, Ilya Cianfrocco, Michael A. Ellett, Kevin Tarboton, David Jeffery, Keith G. Zhao, Zhiming González-Aranda, Juan Perri, Mark J. Tucker, Greg Candela, Leonardo Kiss, Tamas Gesing, Sandra Department of Electrical Engineering and Computer Science University of Missouri ColumbiaMO United States San Diego Supercomputer Center University of California San DiegoCA United States Department of Biochemistry University of Texas Health Science Center HoustonTX United States Texas Advanced Computing Center University of Texas at Austin AustinTX United States Information Technology Services University of South Dakota VermillionSD United States Biology Department College of William and Mary WilliamsburgVA United States Information Technology Services–Cyberinfrastructure University of Hawaii HonoluluHI United States Natural Resource Ecology Laboratory Colorado State University Fort CollinsCO United States Department of Geography and Geographic Information Science University of Illinois UrbanaIL United States Department of Biological Chemistry and Life Sciences Institute University of Michigan Ann ArborMI United States Pervasive Technology Institute Indiana University BloomingtonIN United States Civil and Environmental Engineering Utah State University LoganUT United States Keith G. Jeffery Consultants Faringdon United Kingdom Multiscale Networked Systems Group University of Amsterdam Amsterdam Netherlands Chief Technology Office LifeWatch ERIC Seville Spain Chemistry Department Sonoma State University Rohnert ParkCA United States Department of Geological Sciences CIRES University of Colorado Boulder BoulderCO United States National Research Council of Italy Pisa Italy Research Center for Parallel Computing University of Westminster London United Kingdom Center for Research Computing University of Notre Dame Notre DameIN United States

Scholars worldwide leverage science gateways/virtual research environments (VREs) for a wide variety of research and education endeavors spanning diverse scientific fields. Evaluating the value of a given science gateway/VRE to its constituent community is critical in obtaining the financial and human resources necessary to sustain operations and increase adoption in the user community. In this article, we feature a variety of exemplar science gateways/VREs and detail how they define impact in terms of, for example, their purpose, operation principles, and size of user base. Further, the exemplars recognize that their science gateways/VREs will continuously evolve with technological advancements and standards in cloud computing platforms, web service architectures, data management tools and cybersecurity. Correspondingly, we present a number of technology advances that could be incorporated in next-generation science gateways/VREs to enhance their scope and scale of their operations for greater success/impact. The exemplars are selected from owners of science gateways in the science Gateways Community Institute (SGCI) clientele in the United States, and from the owners of VREs in the International Virtual Research Environment Interest Group (VRE-IG) of the Research Data Alliance. Thus, community-driven best practices and technology advances are compiled from diverse expert groups with an international perspective to envisage futuristic science gateway/VRE innovations. © 2020 John Wiley & Sons, Ltd.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Leveraging randomized compiling for the quantum imaginary-time-evolution algorithm

引用

Physical Review Research 2022年第3期4卷 033140-033140页

作者： Jean-Loup Ville Alexis Morvan Akel Hashim Ravi K. Naik Marie Lu Bradley Mitchell John-Mark Kreikebaum Kevin P. O'Brien Joel J. Wallman Ian Hincks Joseph Emerson Ethan Smith Ed Younis Costin Iancu David I. Santiago Irfan Siddiqi Quantum Nanoelectronics Laboratory Dept. of Physics University of California at Berkeley Berkeley California 94720 USA Computational Research Division Lawrence Berkeley National Lab Berkeley California 94720 USA Materials Sciences Division Lawrence Berkeley National Lab Berkeley California 94720 USA Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Inst. for Quantum Computing and Dept. of Applied Mathematics University of Waterloo Waterloo Ontario Canada N2L 3G1 Quantum Benchmark Inc. Kitchener Ontario Canada N2H 5G5

Recent progress in noisy intermediate-scale quantum (NISQ) hardware shows that quantum devices may be able to tackle complex problems even without error correction. However, coherent errors due to the increased complexity of these devices is an outstanding issue. They can accumulate through a circuit, making their impact on algorithms hard to predict and mitigate. Iterative algorithms like quantum imaginary time evolution are susceptible to these errors. This article presents the combination of both noise tailoring using randomized compiling and error mitigation with purification. We also show that cycle benchmarking gives an estimate of the reliability of the purification. We apply this method to the quantum imaginary time evolution of a transverse field Ising model and report an energy estimation error and a ground-state infidelity both below 1%. Our methodology is general and can be used for other algorithms and platforms. We show how combining noise tailoring and error mitigation will push forward the performance of NISQ devices.

关键词： Measurement-based quantum computing Quantum algorithms Quantum benchmarking Quantum computation Quantum control Quantum information processing Quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Phase transition analysis for covariance based massive random access with massive MIMO

arXiv

引用

arXiv 2020年

作者： Chen, Zhilin Sohrabi, Foad Liu, Ya-Feng Yu, Wei The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto TorontoONM5S 3G4 Canada The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

This paper considers a massive random access problem in which a large number of sporadically active devices wish to communicate with a base station (BS) equipped with massive multiple-input multiple-output (MIMO) antennas. Each device is preassigned a unique signature sequence, and the BS identifies the active devices by detecting which sequences are transmitted. This device activity detection problem can be formulated as a maximum likelihood estimation (MLE) problem for which the sample covariance matrix of the received signal is a sufficient statistic. The goal of this paper is to characterize the feasible set of problem parameters under which this covariance based approach is able to successfully recover the device activities in the massive MIMO regime. Through an analysis of the asymptotic behaviors of MLE via its associated Fisher information matrix, this paper derives a necessary and sufficient condition on the Fisher information matrix to ensure a vanishing probability of detection error as the number of antennas goes to infinity, based on which a numerical phase transition analysis is obtained. This condition is also examined from a perspective of covariance matching, which relates the phase transition analysis to a recently derived scaling law. Further, we provide a characterization of the distribution of the estimation error in MLE, based on which the error probabilities in device activity detection can be accurately predicted. Finally, this paper studies a random access scheme with joint device activity and data detection and analyzes its performance in a similar way. Copyright © 2020, The Authors. All rights reserved.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Explainable AI: Definition and attributes of a good explanation for health AI

arXiv

引用

arXiv 2024年

作者： Kyrimi, Evangelia McLachlan, Scott Wohlgemut, Jared M. Perkins, Zane B. Lagnado, David A. Marsh, William Gimson, Alexander Shafti, Ali Ercole, Ari Banerjee, Amitava Glocker, Ben Schafer, Burkhard Gatsonis, Constantine Grosan, Crina Sent, Danielle Berman, David S. Glass, David O'Regan, Declan P. Letsios, Dimitrios Morrissey, Dylan Pisirir, Erhan Leofante, Francesco Soyel, Hamit Williamson, Jon Grieman, Keri Dube, Kudakwashe Mardsen, Max Nagendran, Myura Tai, Nigel Kostopoulou, Olga Jones, Owain Curzon, Paul Stoner, Rebecca S. Tandle, Sankalp Joshi, Shalmali Mossadegh, Somayyeh Buijsman, Stefan Miller, Tim Madai, Vince Istvan School of Electronic Engineering and Computer Science Queen Mary University of London London United Kingdom School of Nursing Midwifery and Palliative Care King's College London London United Kingdom Centre for Trauma Sciences Blizard Institute Queen Mary University of London London United Kingdom Royal London Hospital Barts Health NHS Trust London United Kingdom Department of Experiment Psychology University College London London United Kingdom Cambridge Liver Unit Addenbrooke's Hospital Cambridge University Hospitals Hills Road Box 210 Cambridge United Kingdom University of Cambridge United Kingdom Cambridge Consultants Ltd. United Kingdom Division of Anaesthesia Cambridge Centre for AI in Medicine University of Cambridge Cambridge United Kingdom Magdelene College University of Cambridge United Kingdom Institute of Health Informatics University College London London United Kingdom Department of Computing Imperial College London London United Kingdom SCRIPT Centre for IT and IP Law School of Law University of Edinburgh United Kingdom Center for Statistical Sciences School of Public Health Brown University Providence United States Research Group Artificial Intelligence HU University of Applied Sciences Utrecht Netherlands Jheronimus Academy of Data Science Tilburg University Eindhoven University of Technology s-Hertogenbosch Netherlands Centre for Theoretical Physics Queen Mary University of London London United Kingdom School of Computing Ulster University Belfast United Kingdom MRC Laboratory of Medical Sciences Imperial College London London United Kingdom Department of Informatics King's College London United Kingdom Physiotherapy Department Barts Health NHS Trust London United Kingdom Sport and Exercise Medicine Queen Mary University of London London United Kingdom School of Electronic Engineering and Computer Science Queen Mary University of London United Kingdom Department of Computing Imperial College London United Kingdom Departmen

Proposals of artificial intelligence (AI) solutions based on increasingly complex and accurate predictive models are becoming ubiquitous across many disciplines. As the complexity of these models grows, transparency and users' understanding often diminish. This suggests that accurate prediction alone is insufficient for making an AI-based solution truly useful. In the development of healthcare systems, this introduces new issues related to accountability and safety. Understanding how and why an AI system makes a recommendation may require complex explanations of its inner workings and reasoning processes. Although research on explainable AI (XAI) has significantly increased in recent years and there is high demand for XAI in medicine, defining what constitutes a good explanation remains ad hoc, and providing adequate explanations continues to be challenging. To fully realize the potential of AI, it is critical to address two fundamental questions about explanations for safety-critical AI applications, such as health-AI: (1) What is an explanation in health-AI? and (2) What are the attributes of a good explanation in health-AI? In this study, we examined published literature and gathered expert opinions through a two-round Delphi study. The research outputs include (1) a definition of what constitutes an explanation in health-AI and (2) a comprehensive list of attributes that characterize a good explanation in health-AI. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Understanding metric-related pitfalls in image analysis validation

arXiv

引用

arXiv 2023年

作者： Reinke, Annika Tizabi, Minu D. Baumgartner, Michael Eisenmann, Matthias Heckmann-Nötzel, Doreen Kavur, A. Emre Rädsch, Tim Sudre, Carole H. Acion, Laura Antonelli, Michela Arbel, Tal Bakas, Spyridon Benis, Arriel Blaschko, Matthew B. Buettner, Florian Cardoso, M. Jorge Cheplygina, Veronika Chen, Jianxu Christodoulou, Evangelia Cimini, Beth A. Collins, Gary S. Farahani, Keyvan Ferrer, Luciana Galdran, Adrian van Ginneken, Bram Glocker, Ben Godau, Patrick Haase, Robert Hashimoto, Daniel A. Hoffman, Michael M. Huisman, Merel Isensee, Fabian Jannin, Pierre Kahn, Charles E. Kainmueller, Dagmar Kainz, Bernhard Karargyris, Alexandros Karthikesalingam, Alan Kenngott, Hannes Kleesiek, Jens Kofler, Florian Kooi, Thijs Kopp-Schneider, Annette Kozubek, Michal 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 Rafelski, Susanne M. Rajpoot, Nasir Reyes, Mauricio Riegler, Michael A. Rieke, Nicola Saez-Rodriguez, Julio Sánchez, Clara I. Shetty, Shravya Summers, Ronald M. Taha, Abdel A. Tiulpin, Aleksei Tsaftaris, Sotirios A. van Calster, Ben Varoquaux, Gaël Yaniv, Ziv R. Jäger, Paul F. Maier-Hein, Lena Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Heidelberg Division of Intelligent Medical Systems Germany NCT Heidelberg A Partnership Between DKFZ University Medical Center Heidelberg Germany Heidelberg Division of Medical Image Computing Germany Heidelberg Division of Intelligent Medical Systems 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 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 Montreal Canada Division of Computational Pathology Dept of Pathology & Laboratory Medicine Indiana University School of Medicine IU Health Information and Translational Sciences Building Indianapolis United States University of Pennsylvania Richards Medical Research Laboratories FL7 PhiladelphiaPA United States Department of Digital Medical Technologies Holon Institute of Technology Holon Israel European Federation for Medical Informatics Le Mont-sur-Lausanne Switzerland Center for Processing Speech and Images Department of Electrical Engineering KU Leuven Leuven Belgium partner site Frankfurt/Mainz a partnership between DKFZ and UCT Frankfurt Marburg Germany Heidelberg Germany Goethe University Frankfurt Department of Medicine Germany Goethe University Frankfurt Department of Informatics Germany and Frankfurt Cancer Insititute Germany Department of Computer Science IT University of Copenhagen Copenhagen Denmark Leibniz-Institut für Analytische Wissenschaften – ISAS – e.V. Dortmund Germany Imaging Platform Broad Institute of MIT and Harvard CambridgeMA United States Centre for Statistics in Medicine University of Oxford Oxford United Kingdom Center for Biomedical In

Validation metrics are key for tracking scientific progress and bridging the current chasm between artificial intelligence (AI) research and its translation into practice. However, increasing evidence shows that particularly in image analysis, metrics are often chosen inadequately. While taking into account the individual strengths, weaknesses, and limitations of validation metrics is a critical prerequisite to making educated choices, the relevant knowledge is currently scattered and poorly accessible to individual researchers. Based on a multi-stage Delphi process conducted by a multidisciplinary expert consortium as well as extensive community feedback, the present work provides the first reliable and comprehensive common point of access to information on pitfalls related to validation metrics in image analysis. While focused on biomedical image analysis, the addressed pitfalls generalize across application domains and are categorized according to a newly created, domain-agnostic taxonomy. The work serves to enhance global comprehension of a key topic in image analysis validation. © 2023, CC BY.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Learning data-adaptive non-parametric kernels

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2020年第1期21卷 8590-8628页

作者： Fanghui Liu Xiaolin Huang Chen Gong Jie Yang Li Li Department of Electrical Engineering ESAT-STADIUS KU Leuven Belgium Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology China and Department of Computing Hong Kong Polytechnic University Hong Kong SAR China Department of Automation BNRist Tsinghua University China

In this paper, we propose a data-adaptive non-parametric kernel learning framework in margin based kernel methods. In model formulation, given an initial kernel matrix, a data-adaptive matrix with two constraints is imposed in an entry-wise scheme. Learning this data-adaptive matrix in a formulation-free strategy enlarges the margin between classes and thus improves the model flexibility. The introduced two constraints are imposed either exactly (on small data sets) or approximately (on large data sets) in our model, which provides a controllable trade-off between model flexibility and complexity with theoretical demonstration. In algorithm optimization, the objective function of our learning framework is proven to be gradient-Lipschitz continuous. Thereby, kernel and classifier/regressor learning can be efficiently optimized in a unified framework via Nesterov's acceleration. For the scalability issue, we study a decomposition-based approach to our model in the large sample case. The effectiveness of this approximation is illustrated by both empirical studies and theoretical guarantees. Experimental results on various classification and regression benchmark data sets demonstrate that our non-parametric kernel learning framework achieves good performance when compared with other representative kernel learning based algorithms.

关键词： support vector machines non-parametric kernel learning gradient-Lipschitz continuous

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：