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

arXiv 2022年

作者： Dong, Yuxin Gong, Tieliang Yu, Shujian Chen, Hong Li, Chen School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Ministry of Education Xi’an710049 China Machine Learning Group UiT - The Arctic University of Norway Norway College of Science Huazhong Agriculture University Wuhan430070 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China

The matrix-based Rényi’s entropy allows us to directly quantify information measures from given data, without explicit estimation of the underlying probability distribution. This intriguing property makes it widely applied in statistical inference and machine learning tasks. However, this information theoretical quantity is not robust against noise in the data, and is computationally prohibitive in large-scale applications. To address these issues, we propose a novel measure of information, termed low-rank matrix-based Rényi’s entropy, based on low-rank representations of infinitely divisible kernel matrices. The proposed entropy functional inherits the specialty of of the original definition to directly quantify information from data, but enjoys additional advantages including robustness and effective calculation. Specifically, our low-rank variant is more sensitive to informative perturbations induced by changes in underlying distributions, while being insensitive to uninformative ones caused by noises. Moreover, low-rank Rényi’s entropy can be efficiently approximated by random projection and Lanczos iteration techniques, reducing the overall complexity from O(n3) to O(n2s) or even O(ns2), where n is the number of data samples and s n. We conduct large-scale experiments to evaluate the effectiveness of this new information measure, demonstrating superior results compared to matrix-based Rényi’s entropy in terms of both performance and computational efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Recording provenance of workflow runs with RO-Crate

arXiv

引用

arXiv 2023年

作者： Leo, Simone Crusoe, Michael R. Rodríguez-Navas, Laura Sirvent, Raül Kanitz, Alexander De Geest, Paul Wittner, Rudolf Pireddu, Luca Garijo, Daniel Fernández, José M. Colonnelli, Iacopo Gallo, Matej Ohta, Tazro Suetake, Hirotaka Capella-Gutierrez, Salvador de Wit, Renske Kinoshita, Bruno P. Soiland-Reyes, Stian CA Pula Italy Vrije Universiteit Amsterdam Amsterdam Netherlands DTL Projects Netherlands Forschungszentrum Jülich Germany Barcelona Supercomputing Center Barcelona Spain Biozentrum University of Basel Basel Switzerland Swiss Institute of Bioinformatics Lausanne Switzerland VIB Data Core Gent Belgium Faculty of Informatics Masaryk University Brno Czech Republic Institute of Computer Science Masaryk University Brno Czech Republic BBMRI-ERIC Graz Austria Ontology Engineering Group Universidad Politécnica de Madrid Madrid Spain Computer Science Department Università degli Studi di Torino Torino Italy Database Center for Life Science Joint Support-Center for Data Science Research Research Organization of Information and Systems Shizuoka Japan Institute for Advanced Academic Research Chiba University Chiba Japan Sator Incorporated Tokyo Japan Department of Computer Science The University of Manchester Manchester United Kingdom Informatics Institute University of Amsterdam Amsterdam Netherlands

Recording the provenance of scientific computation results is key to the support of traceability, reproducibility and quality assessment of data products. Several data models have been explored to address this need, providing representations of workflow plans and their executions as well as means of packaging the resulting information for archiving and sharing. However, existing approaches tend to lack interoperable adoption across workflow management systems. In this work we present Workflow Run RO-Crate, an extension of RO-Crate (research Object Crate) and *** to capture the provenance of the execution of computational workflows at different levels of granularity and bundle together all their associated objects (inputs, outputs, code, etc.). The model is supported by a diverse, open community that runs regular meetings, discussing development, maintenance and adoption aspects. Workflow Run RO-Crate is already implemented by several workflow management systems, allowing interoperable comparisons between workflow runs from heterogeneous systems. We describe the model, its alignment to standards such as W3C PROV, and its implementation in six workflow systems. Finally, we illustrate the application of Workflow Run RO-Crate in two use cases of machine learning in the digital image analysis domain. © 2023, CC BY.

关键词： Workflow management

来源：评论

学校读者我要写书评

暂无评论

Weakly-supervised segmentation using inherently-explainable classification models and their application to brain tumour classification

arXiv

引用

arXiv 2022年

作者： Chatterjee, Soumick Yassin, Hadya Dubost, Florian Nürnberger, Andreas Speck, Oliver Data and Knowledge Engineering Group Faculty of Computer Science Otto von Guericke University Magdeburg Germany Biomedical Magnetic Resonance Faculty of Nature Sciences Otto von Guericke University Magdeburg Germany Genomics Research Centre Human Technopole Milan Italy Institute for Medical Engineering Faculty of Electrical Engineering and Information Technology Otto von Guericke University Magdeburg Germany Department of Biomedical Data Science Stanford University StanfordCA United States Centre for Behavioural Brain Sciences Magdeburg Germany German Centre for Neurodegenerative Disease Magdeburg Germany

Deep learning models have shown their potential in recent years for several applications. However, most of the models are opaque in nature and difficult to trust due to their complex reasoning - commonly known as the black-box problem. Some fields, such as medicine, require a high degree of transparency to accept and adopt such technologies. Consequently, there is a movement towards creating explainable/interpretable models or applying post-hoc explainability/interpretability methods on classifiers to build trust in deep learning models. Moreover, deep learning methods can be used for segmentation tasks, which typically require hard-to-obtain, time-consuming manually-annotated segmentation labels for training. This paper introduces three inherently-explainable classifiers to tackle both of these problems as one. The localisation heatmaps provided by the networks - representing the models' focus areas and being used in classification decision-making - can be directly interpreted, without requiring any post-hoc methods to derive information for model explanation. The models are trained by using the input image and only the classification labels as groundtruth in a supervised fashion - without using any information about the location of the region of interest (i.e. the segmentation labels), making the segmentation training of the models weakly-supervised through classification labels. The final segmentation of the regions of interest is obtained by thresholding these heatmaps. The models were employed for the task of multi-class brain tumour classification using two different datasets, resulting in the best F1-score of 0.93 for the supervised classification task while securing a median Dice score of 0.67 ± 0.08 for the weakly-supervised segmentation task. Furthermore, the obtained accuracy on a subset of tumour-only images outperformed the state-of-the-art glioma tumour grading binary classifiers with the best model achieving 98.7% accuracy. Copyright © 2022, The Autho

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

PULASki: Learning inter-rater variability using statistical distances to improve probabilistic segmentation

arXiv

引用

arXiv 2023年

作者： Chatterjee, Soumick Gaidzik, Franziska Sciarra, Alessandro Mattern, Hendrik Janiga, Gábor Speck, Oliver Nürnberger, Andreas Pathiraja, Sahani Data and Knowledge Engineering Group Faculty of Computer Science Otto von Guericke University Magdeburg Germany Genomics Research Centre Human Technopole Milan Italy Laboratory of Fluid Dynamics and Technical Flows Otto von Guericke University Magdeburg Germany Department of Biomedical Magnetic Resonance Faculty of Natural Sciences Otto von Guericke University Magdeburg Germany Department of Neurology Medical Faculty University Hospital Magdeburg Germany German Centre for Neurodegenerative Disease Magdeburg Germany Centre for Behavioural Brain Sciences Magdeburg Germany School of Mathematics & Statistics UNSW Sydney UNSW Data Science Hub Australia

In the domain of medical imaging, many supervised learning based methods for segmentation face several challenges such as high variability in annotations from multiple experts, paucity of labelled data and class imbalanced datasets. These issues may result in segmentations that lack the requisite precision for clinical analysis and can be misleadingly overconfident without associated uncertainty quantification. We propose the PULASki as a computationally efficient generative tool for biomedical image segmentation that accurately captures variability in expert annotations, even in small datasets. Our approach makes use of an improved loss function based on statistical distances in a conditional variational autoencoder structure (Probabilistic UNet), which improves learning of the conditional decoder compared to the standard cross-entropy particularly in class imbalanced problems. We analyse our method for two structurally different segmentation tasks (intracranial vessel and multiple sclerosis (MS) lesion) and compare our results to four well-established baselines in terms of quantitative metrics and qualitative output. These experiments are characterised by class-imbalanced, low signal to noise ratio data sets with highly ambiguous features. Empirical results demonstrate the PULASKi method outperforms all baselines at the 5% significance level. Our experiments are also of the first to present a comparative study of the computationally feasible segmentation of complex geometries using 3D patches and the traditional use of 2D slices. The generated segmentations are shown to be much more anatomically plausible than in the 2D case, particularly for the vessel task. Our method can also be applied to a wide range of multi-label segmentation tasks and and is useful for downstream tasks such as hemodynamic modelling (computational fluid dynamics and data assimilation), clinical decision making, and treatment planning. Copyright © 2023, The Authors. All rights reserved.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

10 GHz Robust polarization modulation towards high-speed satellite-based quantum communication

arXiv

引用

arXiv 2024年

作者： Wang, Zexu Xu, Huaxing Li, Ju Huang, Jinquan Han, Hui Wang, Changlei Zhang, Ping Yin, Feifei Xu, Kun Liu, Bo Dai, Yitang State Key Laboratory of Information Photonics and Optical Communications Beijing University of Posts and Telecommunications Beijing100876 China National Engineering Research Center for Public Safety Risk Perception and Control by Big Data China Academy of Electronics and Information Technology Beijing100041 China CETC Academy of Electronics and Information Technology Group Co. Ltd. Beijing100041 China College of Advanced Interdisciplinary Studies National University of Defense Technology Changsha410073 China School of Electronics and Communication Engineering Sun Yat-sen University Guangdong Shenzhen518107 China College of Computer National University of Defense Technology Changsha4100730 China

In practical satellite-based quantum key distribution (QKD) systems, the preparation and transmission of polarization-encoding photons suffer from complex environmental effects and high channel-loss. Consequently, the hinge to enhancing the secure key rate (SKR) lies in achieving robust, low-error and high-speed polarization modulation. Although the schemes that realize self-compensation exhibit remarkable robustness. Their modulation speed is constrained to approximately 2 GHz to avoid the interaction between the electrical signal and the reverse optical pulses. Here we utilize the non-reciprocity of the lithium niobate modulators and eliminate the modulation on the reverse optical pulses. As this characteristic is widely available in the radio-frequency band, the modulation speed is no longer limited by the self-compensating optics and can be further increased. The measured average intrinsic QBER of the different polarization states at 10 GHz system repetition frequency is as low as 0.53% over 10 min without any compensation. And the experiment simulation shows that the proposed scheme extends the transmission distance to more than 350 km. Our work can be be efficient performed to the high-speed and high-loss satellite-based quantum communication scenario. © 2024, CC BY.

关键词： Quantum communication

来源：评论

学校读者我要写书评

暂无评论

MICDIR: Multi-scale Inverse-consistent Deformable Image Registration using UNetMSS with Self-Constructing Graph Latent

arXiv

引用

arXiv 2022年

作者： Chatterjee, Soumick Bajaj, Himanshi Siddiquee, Istiyak H. Subbarayappa, Nandish Bandi Simon, Steve Shashidhar, Suraj Bangalore Speck, Oliver Nürnberger, Andreas Faculty of Computer Science Otto von Guericke University Magdeburg Germany Data and Knowledge Engineering Group Otto von Guericke University Magdeburg Germany Biomedical Magnetic Resonance Otto von Guericke University Magdeburg Germany Genomics Research Centre Human Technopole Milan Italy German Centre for Neurodegenerative Disease Magdeburg Germany Centre for Behavioural Brain Sciences Magdeburg Germany

Image registration is the process of bringing different images into a common coordinate system - a technique widely used in various applications of computer vision, such as remote sensing, image retrieval, and, most commonly, medical imaging. Deep learning based techniques have been applied successfully to tackle various complex medical image processing problems, including medical image registration. Over the years, several image registration techniques have been proposed using deep learning. Deformable image registration techniques such as Voxelmorph have been successful in capturing finer changes and providing smoother deformations. However, Voxelmorph, as well as ICNet and FIRE, do not explicitly encode global dependencies (i.e. the overall anatomical view of the supplied image) and, therefore, can not track large deformations. In order to tackle the aforementioned problems, this paper extends the Voxelmorph approach in three different ways. To improve the performance in case of small as well as large deformations, supervision of the model at different resolutions has been integrated using a multi-scale UNet. To support the network to learn and encode the minute structural co-relations of the given image-pairs, a self-constructing graph network (SCGNet) has been used as the latent of the multi-scale UNet - which can improve the learning process of the model and help the model to generalise better. And finally, to make the deformations inverse-consistent, cycle consistency loss has been employed. On the task of registration of brain MRIs, the proposed method achieved significant improvements over ANTs and VoxelMorph, obtaining a Dice score of 0.8013±0.0243 for intramodal and 0.6211±0.0309 for intermodal, while VoxelMorph achieved 0.7747±0.0260 and 0.6071±0.0510, respectively. Copyright © 2022, The Authors. All rights reserved.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Day-Ahead Forecasting of Solar Irradiance & PV Power Output Through Statistical Machine Learning Methods

Day-Ahead Forecasting of Solar Irradiance & PV Power Output ...

引用

Saudi Arabia Smart Grid Conference (SASG)

作者： Yiannis Kamarianakis Yannis Pantazis Evangelia Kalligiannaki Theodoros D. Katsaounis Konstantinos Kotsovos Issam Gereige Marwan Abdullah Aqil Jamal Athanasios Tzavaras Data Science Group Institute of Applied and Computational Mathematics Foundation for Research and Technology-Hellas Greece Dept. of Mathematics and Applied Mathematics University of Crete Greece Carbon Management Division Saudi Aramco R&D Center Dhahran Saudi Arabia Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology (KAUST) Thuwal Saudi Arabia

Energy production from solar photovoltaic (PV) plants is unpredictable, mainly due to the stochastic formation and movement of clouds or aerosol - dust particles which scatter or disperse solar radiation. Accurate forecasts of PV output are essential to Distribution and Transportation System Operators as they assist efficient solar energy trading and management of electricity grids. This work evaluates an autoregressive, computationally-light KNN-regression scheme (TSFKNN) for hourly, day-ahead forecasts of solar irradiance and energy yield of various PV technologies. The model is being tested and validated using data measured in Thuwal, Saudi Arabia. The available measured records span a 60-month period. The developed forecasting models are designed for online systems and provide increased levels of accuracy and low computational cost. Several parametric and nonparametric specifications, coupled with conventional versus outlier-robust estimation procedures are tested, in order to derive an optimal month-specific daily profile (MDP). Current results demonstrate that including intraday variability to the monthly-based irradiance models achieve improved predictive accuracy between 10% and 25% on average.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Survey on Self-supervised Learning: Algorithms, Applications, and Future Trends

arXiv

引用

arXiv 2023年

作者： Gui, Jie Chen, Tuo Zhang, Jing Cao, Qiong Sun, Zhenan Luo, Hao Tao, Dacheng School of Cyber Science and Engineering Southeast University with Purple Mountain Laboratories Nanjing210000 China School of Cyber Science and Engineering Southeast University China School of Computer Science The University of Sydney CamperdownNSW2050 Australia College of Computing & Data Science Nanyang Technological University #32 Block N4 #02a-014 50 Nanyang Avenue Singapore639798 Singapore JD Explore Academy Center for Research on Intelligent Perception and Computing Chinese Academy of Sciences Beijing100190 China Alibaba Group Hangzhou310052 China

Deep supervised learning algorithms typically require a large volume of labeled data to achieve satisfactory performance. However, the process of collecting and labeling such data can be expensive and time-consuming. Self-supervised learning (SSL), a subset of unsupervised learning, aims to learn discriminative features from unlabeled data without relying on human-annotated labels. SSL has garnered significant attention recently, leading to the development of numerous related algorithms. However, there is a dearth of comprehensive studies that elucidate the connections and evolution of different SSL variants. This paper presents a review of diverse SSL methods, encompassing algorithmic aspects, application domains, three key trends, and open research questions. Firstly, we provide a detailed introduction to the motivations behind most SSL algorithms and compare their commonalities and differences. Secondly, we explore representative applications of SSL in domains such as image processing, computer vision, and natural language processing. Lastly, we discuss the three primary trends observed in SSL research and highlight the open questions that remain. A curated collection of valuable resources can be accessed at https://***/guijiejie/SSL. Copyright © 2023, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Complex-valued neural networks to speed-up MR Thermometry during Hyperthermia using Fourier PD and PDUNet

arXiv

引用

arXiv 2023年

作者： Khatun, Rupali Chatterjee, Soumick Bert, Christoph Wadepohl, Martin Ott, Oliver J. Semrau, Sabine Fietkau, Rainer Nürnberger, Andreas Gaipl, Udo S. Frey, Benjamin Department of Radiation Oncology Universitätsklinikum Erlangen Friedrich-Alexnder-Universität Erlangen-Nürnberg Erlangen Germany Department of Radiation Oncology Universitätsklinikum Erlangen Friedrich-Alexnder-Universität Erlangen-Nürnberg Erlangen Germany Comprehensive Cancer Centre Erlangen-EMN Erlangen Germany Data and Knowledge Engineering Group Faculty of Computer Science Otto von Guericke University Magdeburg Germany Genomics Research Centre Human Technopole Milan Italy Dr Sennewald Medizintechnik GmbH Munich Germany

Hyperthermia (HT) in combination with radio- and/or chemotherapy has become an accepted cancer treatment for distinct solid tumour entities. In HT, tumour tissue is exogenously heated to temperatures between 39 and 43 °C for 60 minutes. Temperature monitoring can be performed non-invasively using dynamic magnetic resonance imaging (MRI). However, the slow nature of MRI leads to motion artefacts in the images due to the movements of patients during image acquisition. By discarding parts of the data, the speed of the acquisition can be increased - known as undersampling. However, due to the invalidation of the Nyquist criterion, the acquired images might be blurry and can also produce aliasing artefacts. The aim of this work was, therefore, to reconstruct highly undersampled MR thermometry acquisitions with better resolution and with fewer artefacts compared to conventional methods. The use of deep learning in the medical field has emerged in recent times, and various studies have shown that deep learning has the potential to solve inverse problems such as MR image reconstruction. However, most of the published work only focuses on the magnitude images, while the phase images are ignored, which are fundamental requirements for MR thermometry. This work, for the first time, presents deep learning-based solutions for reconstructing undersampled MR thermometry data. Two different deep learning models have been employed here, the Fourier Primal-Dual network and the Fourier Primal-Dual UNet, to reconstruct highly undersampled complex images of MR thermometry. MR images of 44 patients with different sarcoma types who received HT treatment in combination with radiotherapy and/or chemotherapy were used in this study. The method reduced the temperature difference between the undersampled MRIs and the fully sampled MRIs from 1.3 °C to 0.6 °C in full volume and 0.49 °C to 0.06 °C in the tumour region for an acceleration factor of 10. Copyright © 2023, The Authors. All rights res

关键词： Chemotherapy

来源：评论

学校读者我要写书评

暂无评论

Towards Faster Fully Homomorphic Encryption Implementation with Integer and Floating-point Computing Power of GPUs

Towards Faster Fully Homomorphic Encryption Implementation w...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Guang Fan Fangyu Zheng Lipeng Wan Lili Gao Yuan Zhao Jiankuo Dong Yixuan Song Yuewu Wang Jingqiang Lin State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Data Assurance and Communication Security Research Center Chinese Academy of Sciences Beijing China School of Cryptography University of Chinese Academy of Sciences Beijing China Department of Computer and Software Nanjing University of Information Science and Technology Nanjing China Ant Group Hangzhou China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Cyber Security University of Science and Technology of China Hefei China

Fully Homomorphic Encryption (FHE) allows computations on encrypted data without knowledge of the plaintext message and currently has been the focus of both academia and industry. However, the performance issue hinders its large-scale application, highlighting the urgent requirements of high-performance FHE *** noticing the tremendous potential of GPUs in the field of cryptographic acceleration, this paper comprehensively investigates how to convert the available computing resources residing in GPUs into FHE workhorses, and implement a full set of low-level and middle-level FHE primitives based on two arithmetic units (i.e., INT32 and FP64 units) with three types of data precision (i.e., INT32, INT64 and FP64). This paper gives a comprehensive evaluation and comparison based on each road-map. Our implementations of fundamental functions outperform the implementations on the same platform by 1.7× to 16.7×. Taking CKKS FHE schemes as a case study, our implementation of homomorphic multiplication achieves 3.2× speedup over the state-of-the-art GPU-based implementation, even considering the difference of platforms. The detailed evaluation and comparison of this paper would offer a vital reference for the follow-up work to choose appropriate underlying arithmetic units and important primitive optimizations in GPU-based FHE implementations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：