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

arXiv 2022年

作者： Aehle, Max Alme, Johan Barnaföldi, Gergely Gábor Blühdorn, Johannes Bodova, Tea Borshchov, Vyacheslav van den Brink, Anthony Eikeland, Viljar Feofilov, Gregory Garth, Christoph Gauger, Nicolas R. Grøttvik, Ola Helstrup, Håvard Igolkin, Sergey Keidel, Ralf Kobdaj, Chinorat Kortus, Tobias Kusch, Lisa Leonhardt, Viktor Mehendale, Shruti Mulawade, Raju Ningappa Odland, Odd Harald O’Neill, George Papp, Gábor Peitzmann, Thomas Pettersen, Helge Egil Seime Piersimoni, Pierluigi Pochampalli, Rohit Protsenko, Maksym Rauch, Max Rehman, Attiq Ur Richter, Matthias Röhrich, Dieter Sagebaum, Max Santana, Joshua Schilling, Alexander Seco, Joao Songmoolnak, Arnon Sudár, Ákos Tambave, Ganesh Tymchuk, Ihor Ullaland, Kjetil Varga-Kofarago, Monika Volz, Lennart Wagner, Boris Wendzel, Steffen Wiebel, Alexander Xiao, RenZheng Yang, Shiming Zillien, Sebastian Chair for Scientific Computing University of Kaiserslautern-Landau Kaiserslautern67663 Germany Department of Physics and Technology University of Bergen Bergen5007 Norway Wigner Research Centre for Physics Budapest Hungary Kharkiv Ukraine Institute for Subatomic Physics Utrecht University/Nikhef Utrecht Netherlands St. Petersburg University St. Petersburg Russia Scientific Visualization Lab University of Kaiserslautern-Landau Kaiserslautern67663 Germany Department of Computer Science Electrical Engineering and Mathematical Sciences Western Norway University of Applied Sciences Bergen5020 Norway University of Applied Sciences Worms Worms Germany Institute of Science Suranaree University of Technology Nakhon Ratchasima Thailand Department of Oncology and Medical Physics Haukeland University Hospital Bergen5021 Norway Institute for Physics Eötvös Loránd University 1/A Pázmány P. Sétány BudapestH-1117 Hungary FSN Department ENEA Frascati Research Center Frascati00044 Italy Department of Physics University of Oslo Oslo0371 Norway Department of Biomedical Physics in Radiation Oncology DKFZ—German Cancer Research Center Heidelberg Germany Department of Physics and Astronomy Heidelberg University Heidelberg Germany Bhubaneswar India Biophysics GSI Helmholtz Center for Heavy Ion Research GmbH Darmstadt Germany Department of Medical Physics and Biomedical Engineering University College London London United Kingdom College of Mechanical & Power Engineering China Three Gorges University Yichang China

Objective. Algorithmic differentiation (AD) can be a useful technique to numerically optimize design and algorithmic parameters by, and quantify uncertainties in, computer simulations. However, the effectiveness of AD depends on how "well-linearizable" the software is. In this study, we assess how promising derivative information of a typical proton computed tomography (pCT) scan computer simulation is for the aforementioned applications. Approach. This study is mainly based on numerical experiments, in which we repeatedly evaluate three representative computational steps with perturbed input values. We support our observations with a review of the algorithmic steps and arithmetic operations performed by the software, using debugging techniques. Main results. The model-based iterative reconstruction (MBIR) subprocedure (at the end of the software pipeline) and the Monte Carlo (MC) simulation (at the beginning) were piecewise differentiable. Jumps in the MBIR function arose from the discrete computation of the set of voxels intersected by a proton path. Jumps in the MC function likely arose from changes in the control flow that affect the amount of consumed random numbers. The tracking algorithm solves an inherently non-differentiable problem. Significance. The MC and MBIR codes are ready for the integration of AD, and further research on surrogate models for the tracking subprocedure is necessary. Copyright © 2022, The Authors. All rights reserved.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Emulate Processing of Assorted Database Server Applications on Flash-Based Storage in Datacenter Infrastructures

Emulate Processing of Assorted Database Server Applications ...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： Janki Bhimani Rajinikanth Pandurangan Ningfang Mi Vijay Balakrishnan School of Computing and Information Sciences Florida International University Memory Solutions Lab Samsung Semiconductor Inc. R&D Department of Electrical and Computer Engineering Northeastern University

In the era of big data processing, more and more datacenters in cloud storages are now replacing traditional HDDs with enterprise SSDs. Both developers and users of these SSDs require thorough benchmarking to evaluate their performance impacts. I/O performance with synthetic workload or classic benchmark varies drastically from real I/O activities in the datacenter. Thus, we propose a new framework, called Pattern I/O generator (PatIO), to collectively capture the enterprise storage behavior that is prevailing across assorted user workloads and system configurations for different database server applications on flash-based storage. PatIO is designed to emulate the processing of real-world I/O activities easily with less time and resource requirements. Our methodology comprises three main steps: (1) dissect the overall I/O activities of various real workloads and identify the prevailing attributes in distinct visual I/O patterns; (2) construct a pattern warehouse as the collection of unique I/O patterns that are generated through various combinations of multiple I/O jobs; and (3) finally integrate different combinations of these synthetically generated I/O patterns to reproduce the comprehensive characteristics of various real workloads and system setup for the database server applications. To provide an easy-to-use experience, we develop a graphical user interface (GUI). We evaluate our framework by comparing I/O characteristics and I/O performance of generated workloads with those of real-world workloads for multiple database applications such as MySQL, Cassandra, and ForestDB.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantum Simulation for High-Energy Physics

引用

PRX Quantum 2023年第2期4卷 027001-027001页

作者： Christian W. Bauer Zohreh Davoudi A. Baha Balantekin Tanmoy Bhattacharya Marcela Carena Wibe A. de Jong Patrick Draper Aida El-Khadra Nate Gemelke Masanori Hanada Dmitri Kharzeev Henry Lamm Ying-Ying Li Junyu Liu Mikhail Lukin Yannick Meurice Christopher Monroe Benjamin Nachman Guido Pagano John Preskill Enrico Rinaldi Alessandro Roggero David I. Santiago Martin J. Savage Irfan Siddiqi George Siopsis David Van Zanten Nathan Wiebe Yukari Yamauchi Kübra Yeter-Aydeniz Silvia Zorzetti Physics Division Lawrence Berkeley National Laboratory Berkeley California 94720 USA Department of Physics Maryland Center for Fundamental Physics and the NSF Institute for Robust Quantum Simulation University of Maryland College Park Maryland 20742 USA Department of Physics University of Wisconsin Madison Wisconsin 53706 USA T-2 Los Alamos National Laboratory Los Alamos New Mexico 87545 USA Fermi National Accelerator Laboratory Batavia Illinois 60510 USA Enrico Fermi Institute University of Chicago Chicago Illinois 60637 USA Kavli Institute for Cosmological Physics University of Chicago Chicago Illinois 60637 USA Department of Physics University of Chicago Chicago Illinois 60637 USA Department of Physics and Illinois Center for the Advanced Study of the Universe and Illinois Quantum Information Science and Technology Center University of Illinois Urbana Illinois 61801 USA QuEra Computing Inc Boston Massachusetts 02135 USA Department of Mathematics University of Surrey Guildford Surrey GU2 7XH United Kingdom Center for Nuclear Theory Department of Physics and Astronomy Stony Brook University New York 11794-3800 USA Department of Physics Brookhaven National Laboratory Upton New York 11973 USA Peng Huanwu Center for Fundamental Theory Hefei Anhui 230026 China Interdisciplinary Center for Theoretical Study University of Science and Technology of China Hefei Anhui 230026 China Pritzker School of Molecular Engineering Chicago Quantum Exchange and Kadanoff Center for Theoretical Physics University of Chicago Illinois 60637 USA qBraid Co. Harper Court 5235 Chicago Illinois 60615 USA Department of Physics Harvard University Cambridge Massachusetts 02138 USA Department of Physics and Astronomy University of Iowa Iowa City Iowa 52242 USA Duke Quantum Center Duke University Durham North Carolina 27701 USA Department of Electrical and Computer Engineering Duke University Durham North Carolina 27708 USA Department of Physics Duke University

It is for the first time that quantum simulation for high-energy physics (HEP) is studied in the U.S. decadal particle-physics community planning, and in fact until recently, this was not considered a mainstream topic in the community. This fact speaks of a remarkable rate of growth of this subfield over the past few years, stimulated by the impressive advancements in quantum information sciences (QIS) and associated technologies over the past decade, and the significant investment in this area by the government and private sectors in the U.S. and other countries. High-energy physicists have quickly identified problems of importance to our understanding of nature at the most fundamental level, from tiniest distances to cosmological extents, that are intractable with classical computers but may benefit from quantum advantage. They have initiated, and continue to carry out, a vigorous program in theory, algorithm, and hardware co-design for simulations of relevance to the HEP mission. This Roadmap is an attempt to bring this exciting and yet challenging area of research to the spotlight, and to elaborate on what the promises, requirements, challenges, and potential solutions are over the next decade and beyond.

关键词： Quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Leveraging randomized compiling for the QITE algorithm

arXiv

引用

arXiv 2021年

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

The success of the current generation of Noisy Intermediate-Scale Quantum (NISQ) hardware shows that quantum hardware may be able to tackle complex problems even without error correction. One outstanding issue is that of coherent errors arising from the increased complexity of these devices. These errors 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 a 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 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. © 2021, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Towards Neural Charged Particle Tracking in Digital Tracking Calorimeters with Reinforcement Learning

TechRxiv

引用

TechRxiv 2022年

作者： Kortus, Tobias Keidel, Ralf Gauger, Nicolas R. Aehle, Max Alme, Johan Barnaföldi, Gergely Gábor Bodova, Tea Borshchov, Vyacheslav van den Brink, Anthony Chaar, Mamdouh Eikeland, Viljar Feofilov, Gregory Garth, Christoph Genov, Georgi Grøttvik, Ola Helstrup, Håvard Igolkin, Sergey Keidel, Ralf Kobdaj, Chinorat Leonhardt, Viktor Mehendale, Shruti Mulawade, Raju Ningappa Odland, Odd Harald O’Neill, George Papp, Gábor Peitzmann, Thomas Pettersen, Helge Egil Seime Piersimoni, Pierluigi Protsenko, Maksym Rauch, Max Rehman, Attiq Ur Richter, Matthias Röhrich, Dieter Santana, Joshua Schilling, Alexander Seco, Joao Songmoolnak, Arnon Sudár, Ákos Sølie, Jarle Rambo Tambave, Ganesh Tymchuk, Ihor Ullaland, Kjetil Varga-Kofarago, Monika Volz, Lennart Wagner, Boris Wendzel, Steffen Wiebel, Alexander Xiao, RenZheng Yang, Shiming Yokoyama, Hiroki Zillien, Sebastian University of Applied Sciences Worms Worms67549 Germany Chair for Scientific Computing TU Kaiserslautern Kaiserslautern67663 Germany Department of Physics and Technology University of Bergen Bergen5007 Norway Wigner Research Centre for Physics Budapest Hungary Kharkiv Ukraine Institute for Subatomic Physics Utrecht University/Nikhef Utrecht Netherlands St. Petersburg University St. Petersburg Russia Scientific Visualization Lab TU Kaiserslautern Kaiserslautern67663 Germany Department of Computer Science Electrical Engineering and Mathematical Sciences Western Norway University of Applied Sciences Bergen5020 Norway Institute of Science Suranaree University of Technology Nakhon Ratchasima Thailand Department of Oncology and Medical Physics Haukeland University Hospital Bergen5021 Norway Institute for Physics Eötvös Loránd University 1/A Pázmány P. Sétány BudapestH-1117 Hungary UniCamillus Saint Camillus International University of Health Sciences Rome Italy Department of Physics University of Oslo Oslo0371 Norway Department of Biomedical Physics in Radiation Oncology DKFZ—German Cancer Research Center Heidelberg Germany Department of Physics and Astronomy Heidelberg University Heidelberg Germany Budapest University of Technology and Economics Budapest Hungary Department of Diagnostic Physics Division of Radiology and Nuclear Medicine Oslo University Hospital Oslo Norway Bhubaneswar India Biophysics GSI Helmholtz Center for Heavy Ion Research GmbH Darmstadt Germany Department of Medical Physics and Biomedical Engineering University College London London United Kingdom College of Mechanical & Power Engineering China Three Gorges University Yichang China

We propose a novel technique for reconstructing charged particles in digital tracking calorimeters using reinforcement learning aiming to benefit from the rapid progress and success of neural network architectures without the dependency on simulated or manually-labeled data. Here we optimize by trial-and-error a behavior policy acting as an approximation to the full combinatorial optimization problem, maximizing the physical plausibility of sampled trajectories. In modern processing pipelines used in high energy physics and related applications, tracking plays an essential role allowing to identify and follow charged particle trajectories traversing particle detectors. Due to the high multiplicity of charged particles and their physical interactions, randomly deflecting the particles, the reconstruction is a challenging undertaking, requiring fast, accurate and robust algorithms. Our approach works on graph-structured data, capturing track hypotheses through edge connections between particles in the detector layers. We demonstrate in a comprehensive study on simulated data for a particle detector used for proton computed tomography, the high potential as well as the competitiveness of our approach compared to a heuristic search algorithm and a model trained on ground truth. Finally, we point out limitations of our approach, guiding towards a robust foundation for further development of reinforcement learning based tracking. © 2022, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Filter sketch for network pruning

arXiv

引用

arXiv 2020年

作者： Lin, Mingbao Cao, Liujuan Li, Shaojie Ye, Qixiang Tian, Yonghong Liu, Jianzhuang Tian, Qi Ji, Rongrong The Media Analytics and Computing Laboratory Department of Artificial Intelligence School of Informatics Xiamen University Xiamen361005 China The Fujian Key Laboratory of Sensing and Computing for Smart City Computer Science Department School of Informatics Xiamen University Xiamen361005 China Institute of Artificial Intelligence Xiamen University Xiamen361005 China School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing101408 China The School of Electronics Engineering and Computer Science Peking University Beijing100871 China The Noah's Ark Lab Huawei Technologies Co. Ltd. Shenzhen518129 China Cloud BU Huawei Technologies Co. Ltd. Shenzhen518129 China

We propose a novel network pruning approach by information preserving of pre-trained network weights (filters). Network pruning with the information preserving is formulated as a matrix sketch problem, which is efficiently solved by the off-the-shelf Frequent Direction method. Our approach, referred to as FilterSketch, encodes the second-order information of pre-trained weights, which enables the representation capacity of pruned networks to be recovered with a simple fine-tuning procedure. FilterSketch requires neither training from scratch nor data-driven iterative optimization, leading to a several-orders-of-magnitude reduction of time cost in the optimization of pruning. Experiments on CIFAR-10 show that FilterSketch reduces 63.3% of FLOPs and prunes 59.9% of network parameters with negligible accuracy cost for ResNet-110. On ILSVRC-2012, it reduces 45.5% of FLOPs and removes 43.0% of parameters with only 0.69% accuracy drop for ResNet-50. Our code and pruned models can be found at https://***/lmbxmu/FilterSketch. Copyright © 2020, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Codebook-Based Beam Tracking for Conformal Array-Enabled UAV MmWave Networks

arXiv

引用

arXiv 2020年

作者： Zhang, Jinglin Xu, Wenjun Gao, Hui Pan, Miao Han, Zhu Zhang, Ping Key Lab of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing100876 China Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing University of Posts and Telecommunications Beijing100876 China Department of Electrical and Computer Engineering University of Houston HoustonTX77204 United States University of Houston HoustonTX77004 United States Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China

Millimeter wave (mmWave) communications can potentially meet the high data-rate requirements of unmanned aerial vehicle (UAV) networks. However, as the prerequisite of mmWave communications, the narrow directional beam tracking is very challenging because of the three-dimensional (3D) mobility and attitude variation of UAVs. Aiming to address the beam tracking difficulties, we propose to integrate the conformal array (CA) with the surface of each UAV, which enables the full spatial coverage and the agile beam tracking in highly dynamic UAV mmWave networks. More specifically, the key contributions of our work are three-fold. 1) A new mmWave beam tracking framework is established for the CA-enabled UAV mmWave network. 2) A specialized hierarchical codebook is constructed to drive the directional radiating element (DRE)-covered cylindrical conformal array (CCA), which contains both the angular beam pattern and the subarray pattern to fully utilize the potential of the CA. 3) A codebook-based multiuser beam tracking scheme is proposed, where the Gaussian process machine learning enabled UAV position/attitude predication is developed to improve the beam tracking efficiency in conjunction with the tracking-error aware adaptive beamwidth control. Simulation results validate the effectiveness of the proposed codebook-based beam tracking scheme in the CA-enabled UAV mmWave network, and demonstrate the advantages of CA over the conventional planner array in terms of spectrum efficiency and outage probability in the highly dynamic scenarios. Copyright © 2020, The Authors. All rights reserved.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

Anonymization of labeled TOF-MRA images for brain vessel segmentation using generative adversarial networks

arXiv

引用

arXiv 2020年

作者： Kossen, Tabea Subramaniam, Pooja Madai, Vince I. Hennemuth, Anja Hildebrand, Kristian Hilbert, Adam Sobesky, Jan Livne, Michelle Galinovic, Ivana Khalil, Ahmed A. Fiebach, Jochen B. Frey, Dietmar CLAIM - Charité Lab for AI in Medicine Charité Universitätsmedizin Berlin Germany Department of Computer Engineering and Microelectronics Computer Vision & Remote Sensing Technical University Berlin Berlin Germany Department of Electrical Engineering and Computer Science Technical University of Berlin Berlin Germany School of Computing and Digital Technology Faculty of Computing Engineering and the Built Environment Birmingham City University Birmingham United Kingdom Institute for Imaging Science and Computational Modelling in Cardiovascular Medicine Charité Universitätsmedizin Berlin Berlin Germany Fraunhofer MEVIS Bremen Germany Department VI Computer Science and Media Beuth University of Applied Sciences Berlin Germany Johanna-Etienne-Hospital Neuss Germany Centre for Stroke Research Berlin Charité Universitätsmedizin Berlin Berlin Germany Department of Neurology Max Planck Institute for Human Cognitive and Brain Sciences Leipzig Germany Mind Brain Body Institute Berlin School of Mind and Brain Humboldt University Berlin Berlin Germany Berlin Institute of Health Berlin Germany

Anonymization and data sharing are crucial for privacy protection and acquisition of large datasets for robust medical image analysis. This represents a major challenge, especially for brain imaging research. Here, the unique structure of brain images allows for potential re-identification and thus requires anonymization beyond conventional methods. Generative adversarial networks (GANs) have the potential to provide anonymous images while maintaining their predictive properties. Analyzing brain vessel segmentation as a use case, we trained 3 GAN architectures on time-of-flight (TOF) magnetic resonance angiography (MRA) patches of patients with cerebrovascular disease for image-label pair generation: 1) Deep convolutional GAN, 2) Wasserstein-GAN with gradient penalty (WGAN-GP) and 3) WGAN-GP with spectral normalization (WGAN-GP-SN). First, the synthesized image-labels from each GAN architecture were used to train a U-net for vessel segmentation. The U-nets were then tested on real patient data. In total, 66 patients were used for this analysis. In a second step, we simulated the application of our synthetic patches in a transfer learning approach using a second, independent dataset. Here, for an increasing number of up to 15 patients we evaluated vessel segmentation model performance on real data with and without pre-training on generated patches. Finally, performance for all models was assessed by the Dice Similarity Coefficient (DSC) and the 95th percentile of the Hausdorff Distance (95HD). Comparing the 3 GAN architectures, the U-net model trained on synthetic data generated by the WGAN-GP-SN showed the highest performance to predict brain vessels (DSC/95HD 0.82/28.97) benchmarked by the U-net trained on real data (0.89/26.61). The transfer learning approach showed superior performance for the same GAN architecture compared to no pre-training, especially for one labeled patient only (DSC/95HD 0.91/25.68 compared to DSC/95HD 0.85/27.36). In a brain imaging segment

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

The state-of-the-art in Cardiac MRI Reconstruction: Results of the CMRxRecon Challenge in MICCAI 2023

arXiv

引用

arXiv 2024年

作者： Lyu, Jun Qin, Chen Wang, Shuo Wang, Fanwen Li, Yan Wang, Zi Guo, Kunyuan Ouyang, Cheng Tänzer, Michael Liu, Meng Sun, Longyu Sun, Mengting Li, Qin Shi, Zhang Hua, Sha Li, Hao Chen, Zhensen Zhang, Zhenlin Xin, Bingyu Metaxas, Dimitris N. Yiasemis, George Teuwen, Jonas Zhang, Liping Chen, Weitian Pang, Yanwei Liu, Xiaohan Razumov, Artem Dylov, Dmitry V. Dou, Quan Yan, Kang Xue, Yuyang Du, Yuning Dietlmeier, Julia Garcia-Cabrera, Carles Hemidi, Ziad Al-Haj Vogt, Nora Xu, Ziqiang Zhang, Yajing Chu, Ying-Hua Chen, Weibo Bai, Wenjia Zhuang, Xiahai Qin, Jing Wu, Lianmin Yang, Guang Qu, Xiaobo Wang, He Wang, Chengyan Psychiatry Neuroimaging Laboratory Brigham and Women’s Hospital Harvard Medical School 399 Revolution Drive BostonMA02215 United States Department of Electrical and Electronic Engineering & I-X Imperial College London United Kingdom Digital Medical Research Center School of Basic Medical Sciences Fudan University Shanghai China Department of Bioengineering & I-X Imperial College London LondonW12 7SL United Kingdom Cardiovascular Magnetic Resonance Unit Royal Brompton Hospital Guy’s and St Thomas’ NHS Foundation Trust LondonSW3 6NP United Kingdom Department of Radiology Ruijin Hospital Shanghai Jiao Tong University School of Medicine Shanghai China Department of Electronic Science Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance National Institute for Data Science in Health and Medicine Institute of Artificial Intelligence Xiamen University Xiamen361102 China Department of Computing Department of Brain Sciences Imperial College London LondonSW7 2AZ United Kingdom Human Phenome Institute Fudan University 825 Zhangheng Road Pudong New District Shanghai201203 China Department of Radiology Zhongshan Hospital Fudan University Shanghai China Department of Cardiovascular Medicine Ruijin Hospital Lu Wan Branch Shanghai Jiao Tong University School of Medicine Shanghai China Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai200433 China Department of Computer Science Rutgers University PiscatawayNJ08854 United States AI for Oncology Netherlands Cancer Institute Plesmanlaan 121 Amsterdam1066 CX Netherlands Department of Imaging and Interventional Radiology The Chinese University of Hong Kong Hong Kong TJK-BIIT Lab School of Electrical and Information Engineering Tianjin University Tianjin300072 China Skolkovo Institute Of Science And Technology Center for Artificial Intelligence Technology 30/1 Bolshoy blvd. Moscow121205 Russia Department of Biomedical Engineering University of Virginia

Cardiac magnetic resonance imaging (MRI) provides detailed and quantitative evaluation of the heart’s structure, function, and tissue characteristics with high-resolution spatial-temporal imaging. However, its slow imaging speed and motion artifacts are notable limitations. Undersampling reconstruction, especially data-driven algorithms, has emerged as a promising solution to accelerate scans and enhance imaging performance using highly under-sampled data. Nevertheless, the scarcity of publicly available cardiac k-space datasets and evaluation platform hinder the development of data-driven reconstruction algorithms. To address this issue, we organized the Cardiac MRI Reconstruction Challenge (CMRxRecon) in 2023, in collaboration with the 26th International Conference on Medical Image computing and computer-Assisted Intervention (MICCAI). CMRxRecon presented an extensive k-space dataset comprising cine and mapping raw data, accompanied by detailed annotations of cardiac anatomical structures. With overwhelming participation, the challenge attracted more than 285 teams and over 600 participants. Among them, 22 teams successfully submitted Docker containers for the testing phase, with 7 teams submitted for both cine and mapping tasks. All teams use deep learning based approaches, indicating that deep learning has predominately become a promising solution for the problem. The first-place winner of both tasks utilizes the E2E-VarNet architecture as backbones. In contrast, U-Net is still the most popular backbone for both multi-coil and single-coil reconstructions. This paper provides a comprehensive overview of the challenge design, presents a summary of the submitted results, reviews the employed methods, and offers an in-depth discussion that aims to inspire future advancements in cardiac MRI reconstruction models. The summary emphasizes the effective strategies observed in Cardiac MRI reconstruction, including backbone architecture, loss function, pre-processing techn

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Graph based Tensor Recovery for Accurate Internet Anomaly Detection

Graph based Tensor Recovery for Accurate Internet Anomaly De...

引用

2018 IEEE Conference on computer Communications, INFOCOM 2018

作者： Xie, Kun Li, Xiaocan Wang, Xin Xie, Gaogang Wen, Jigang Zhang, Dafang College of Computer Science and Electronics Engineering Hunan University China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China Department of Electrical and Computer Engineering State University of New York at Stony Brook United States Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9781538641286

Detecting anomalous traffic is a crucial task of managing networks. Many anomaly detection algorithms have been proposed recently. However, constrained by their matrix-based traffic data model, existing algorithms often suffer from low detection accuracy. To fully utilize the multi-dimensional information hidden in the traffic data, this paper takes an initiative to investigate the potential and methodologies of performing tensor factorization for more accurate Internet anomaly detection. Only considering the low-rank linearity features hidden in the data, current tensor factorization techniques would result in low anomaly detection accuracy. We propose a novel Graph-based Tensor Recovery model (Graph-TR) to well explore both low rank linearity features as well as the non-linear proximity information hidden in the traffic data for better anomaly detection. We encode the non-linear proximity information of the traffic data by constructing nearest neighbor graphs and incorporate this information into the tensor factorization using the graph Laplacian. Moreover, to facilitate the quick building of neighbor graph, we propose a nearest neighbor searching algorithm with the simple locality-sensitive hashing (LSH). We have conducted extensive experiments using Internet traffic trace data Abilene and GEANT. Compared with the state of art algorithms on matrix-based anomaly detection and tensor recovery approach, our Graph-Trcan achieve significantly lower False Positive Rate and higher True Positive Rate. © 2018 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：