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

A review of uncertainty estimation and its application in medical imaging

学校读者我要写书评

暂无评论

Meta-Radiology

Meta-Radiology 2023年第1期1卷

作者： Zou, Ke Chen, Zhihao Yuan, Xuedong Shen, Xiaojing Wang, Meng Fu, Huazhu National Key Laboratory of Fundamental Science on Synthetic Vision Sichuan University Chengdu 610065 China College of Intelligence and Computing Tianjin University Tianjin 300350 China Department of Mathematics Sichuan University Chengdu 610065 China Institute of High Performance Computing (IHPC) Agency for Science Technology and Research (A∗STAR) Singapore 138632 Singapore The College of Computer Science Sichuan University Chengdu 610065 China

The use of AI systems in healthcare for the early screening of diseases is of great clinical importance. Deep learning has shown great promise in medical imaging, but the reliability and trustworthiness of AI systems limit their deployment in real clinical scenes, where patient safety is at stake. Uncertainty estimation plays a pivotal role in producing a confidence evaluation along with the prediction of the deep model. This is particularly important in medical imaging, where the uncertainty in the model's predictions can be used to identify areas of concern or to provide additional information to the clinician. In this paper, we review the various types of uncertainty in deep learning, including aleatoric uncertainty and epistemic uncertainty. We further discuss how they can be estimated in medical imaging. More importantly, we review recent advances in deep learning models that incorporate uncertainty estimation in medical imaging. Finally, we discuss the challenges and future directions in uncertainty estimation in deep learning for medical imaging. We hope this review will ignite further interest in the community and provide researchers with an up-to-date reference regarding applications of uncertainty estimation models in medical imaging. © 2023 The Authors

关键词： Deep learning Medical image analysis Uncertainty estimation

BrainIB: Interpretable Brain Network-based Psychiatric Diagnosis with Graph Information Bottleneck

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zheng, Kaizhong Yu, Shujian Li, Baojuan Jenssen, Robert Chen, Badong National Key Laboratory of Human-Machine Hybrid Augmented Intelligence National Engineering Research Center for Visual Information and Applications Institute of Artificial Intelligence and Robotics Xi’an Jiaotong University Xi’an China The Department of Computer Science Vrije Universiteit Amsterdam Amsterdam and the Machine Learning Group UiT - Arctic University of Norway Tromsø Norway The Machine Learning Group UiT - Arctic University of Norway Tromsø Norway The School of Biomedical Engineering Fourth Military Medical University Xi’an China

Developing a new diagnostic models based on the underlying biological mechanisms rather than subjective symptoms for psychiatric disorders is an emerging consensus. Recently, machine learning-based classifiers using functional connectivity (FC) for psychiatric disorders and healthy controls are developed to identify brain markers. However, existing machine learning-based diagnostic models are prone to over-fitting (due to insufficient training samples) and perform poorly in new test environment. Furthermore, it is difficult to obtain explainable and reliable brain biomarkers elucidating the underlying diagnostic decisions. These issues hinder their possible clinical applications. In this work, we propose BrainIB, a new graph neural network (GNN) framework to analyze functional magnetic resonance images (fMRI), by leveraging the famed Information Bottleneck (IB) principle. BrainIB is able to identify the most informative edges in the brain (i.e., subgraph) and generalizes well to unseen data. We evaluate the performance of BrainIB against 3 baselines and 7 state-of-the-art brain network classification methods on three psychiatric datasets and observe that our BrainIB always achieves the highest diagnosis accuracy. It also discovers the subgraph biomarkers which are consistent to clinical and neuroimaging findings. The source code and implementation details of BrainIB are freely available at GitHub repository (https://***/SJYuCNEL/brain-and-Information-Bottleneck/). Copyright © 2022, The Authors. All rights reserved.

关键词： Graph neural networks

Edge Learning for Large-Scale Internet of Things With Task-Oriented Efficient Communication

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Xie, Haihui Xia, Minghua Wu, Peiran Wang, Shuai Poor, H. Vincent The School of Electronics and Information Technology Sun Yat-Sen University Guangzhou510006 China The Southern Marine Science and Engineering Guangdong Laboratory Zhuhai519082 China The Guangdong-Hong Kong-Macao Joint Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China The Department of Electrical and Computer Engineering Princeton University PrincetonNJ08544 United States

In the Internet of Things (IoT) networks, edge learning for data-driven tasks provides intelligent applications and services. As the network size becomes large, different users may generate distinct datasets. Thus, to suit multiple edge learning tasks for large-scale IoT networks, this paper performs efficient communication under the task-oriented principle by using the collaborative design of wireless resource allocation and edge learning error prediction. In particular, we start with multi-user scheduling to alleviate co-channel interference in dense networks. Then, we perform optimal power allocation in parallel for different learning tasks. Thanks to the high parallelization of the designed algorithm, extensive experimental results corroborate that the multi-user scheduling and task-oriented power allocation improve the performance of distinct edge learning tasks efficiently compared with the state-of-the-art benchmark algorithms. © 2023, CC BY-NC-SA.

关键词： Internet of things

Learning Graph Representation of Person-specific Cognitive Processes from Audio-visual Behaviours for Automatic Personality Recognition

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Song, Siyang Shao, Zilong Jaiswal, Shashank Shen, Linlin Valstar, Michel Gunes, Hatice Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom Computer Vision Institute Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence of Robotics of Society Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Computer Vision Lab University of Nottingham Nottingham United Kingdom

This paper proposes to recognise the true (self-reported) personality from the learned simulation of the target subject’s cognition. This approach builds on two following findings in cognitive science: (i) human cognition partially determines expressed behaviour and is directly linked to true personality traits;and (ii) in dyadic interactions individuals’ nonverbal behaviours are influenced by their conversational partner’s behaviours. In this context, we hypothesise that during a dyadic interaction, a target subject’s facial reactions are driven by two main factors, i.e. their internal (person-specific) cognitive process, and the externalised nonverbal behaviours of their conversational partner. Consequently, we propose to represent the target subject’s (defined as the listener) person-specific cognition in the form of a person-specific CNN architecture that has unique architectural parameters and depth, which takes audio-visual non-verbal cues displayed by the conversational partner (defined as the speaker) as input, and is able to reproduce the target subject’s facial reactions. Each person-specific CNN is explored by the Neural Architecture Search (NAS) and a novel adaptive loss function, which is then represented as a graph representation for recognising the target subject’s true personality. Experimental results not only show that the produced graph representations are well associated with target subjects’ personality traits in both human-human and human-machine interaction scenarios, and outperform the existing approaches with significant advantages, but also demonstrate that the proposed novel strategies such as adaptive loss, and the end-to-end vertices/edges feature learning, help the proposed approach in learning more reliable personality representations. Building on our earlier version of this work, this paper further proposes: (i) assigning a unique depth for each CNN;(ii) a novel end-to-end graph vertex feature learning strategy;(iii) a transformer-bas

关键词： Cognitive systems

Continual Learning in the Presence of Repetition

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hemati, Hamed Pellegrini, Lorenzo Duan, Xiaotian Zhao, Zixuan Xia, Fangfang Masana, Marc Tscheschner, Benedikt Veas, Eduardo Zheng, Yuxiang Zhao, Shiji Li, Shao-Yuan Huang, Sheng-Jun Lomonaco, Vincenzo van de Ven, Gido M. Institute for Computer Science University of St. Gallen Rosenbergstrasse 30 St. Gallen9000 Switzerland Department of Computer Science University of Bologna Via dell’Università 50 Cesena47521 Italy The University of Chicago 5801 S Ellis Ave Chicago60637 United States Argonne National Laboratory 9700 S Cass Ave Lemont60439 United States Graz University of Technology Rechbauerstraße 12 Graz8010 Austria TU Graz - SAL Dependable Embedded Systems Lab Silicon Austria Labs Graz8010 Austria Know-Center GmbH Sandgasse 36/4 Graz8010 Austria MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing University of Aeronautics and Astronautics Nanjing211106 China Department of Computer Science University of Pisa Piano Secondo Largo Bruno Pontecorvo 3 Pisa56127 Italy Department of Electrical Engineering KU Leuven Kasteelpark Arenberg 10 Leuven3001 Belgium

Continual learning (CL) provides a framework for training models in ever-evolving environments. Although re-occurrence of previously seen objects or tasks is common in real-world problems, the concept of repetition in the data stream is not often considered in standard benchmarks for CL. Unlike with the rehearsal mechanism in buffer-based strategies, where sample repetition is controlled by the strategy, repetition in the data stream naturally stems from the environment. This report provides a summary of the CLvision challenge at CVPR 2023, which focused on the topic of repetition in class-incremental learning. The report initially outlines the challenge objective and then describes three solutions proposed by finalist teams that aim to effectively exploit the repetition in the stream to learn continually. The experimental results from the challenge highlight the effectiveness of ensemble-based solutions that employ multiple versions of similar modules, each trained on different but overlapping subsets of classes. This report underscores the transformative potential of taking a different perspective in CL by employing repetition in the data stream to foster innovative strategy design. © 2024, CC BY.

关键词： Contrastive Learning

Neural Multi-Objective Combinatorial Optimization with Diversity Enhancement

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chen, Jinbiao Zhang, Zizhen Cao, Zhiguang Wu, Yaoxin Ma, Yining Ye, Te Wang, Jiahai School of Computer Science and Engineering Sun Yat-sen University China School of Computing and Information Systems Singapore Management University Singapore Department of Industrial Engineering & Innovation Sciences Eindhoven University of Technology Netherlands Department of Industrial Systems Engineering & Management National University of Singapore Singapore Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Sun Yat-sen University China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China

Most of existing neural methods for multi-objective combinatorial optimization (MOCO) problems solely rely on decomposition, which often leads to repetitive solutions for the respective subproblems, thus a limited Pareto set. Beyond decomposition, we propose a novel neural heuristic with diversity enhancement (NHDE) to produce more Pareto solutions from two perspectives. On the one hand, to hinder duplicated solutions for different subproblems, we propose an indicator-enhanced deep reinforcement learning method to guide the model, and design a heterogeneous graph attention mechanism to capture the relations between the instance graph and the Pareto front graph. On the other hand, to excavate more solutions in the neighborhood of each subproblem, we present a multiple Pareto optima strategy to sample and preserve desirable solutions. Experimental results on classic MOCO problems show that our NHDE is able to generate a Pareto front with higher diversity, thereby achieving superior overall performance. Moreover, our NHDE is generic and can be applied to different neural methods for MOCO. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep learning

LocalViT: Analyzing Locality in vision Transformers

学校读者我要写书评

暂无评论

LocalViT: Analyzing Locality in Vision Transformers

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Yawei Li Kai Zhang Jiezhang Cao Radu Timofte Michele Magno Luca Benini Luc Van Goo Computer Vision Lab D-ITET ETH Zurich Switzerland Center for Artificial Intelligence and Data Science (CAIDAS) University of Wurzburg Germany Center for Project-Based Learning D-ITET ETH Zurich Switzerland Integrated Systems Laboratory D-ITET ETH Zurich Switzerland Department of Electrical Electronic and Information Engineering University of Bologna Italy Processing Speech and Images (PSI) KU Leuven Belgium

The aim of this paper is to study the influence of locality mechanisms in vision transformers. Transformers originated from machine translation and are particularly good at modelling long-range dependencies within a long sequence. Although the global interaction between the token embeddings could be well modelled by the self-attention mechanism of transformers, what is lacking is a locality mechanism for infor-mation exchange within a local region. In this paper, locality mechanism is systematically investigated by carefully designed controlled experiments. We add locality to vision transformers into the feed-forward network. This seemingly simple solution is inspired by the comparison between feed-forward networks and inverted residual blocks. The importance of locality mechanisms is validated in two ways: 1) A wide range of design choices (activation function, layer placement, expansion ratio) are available for incorporating locality mechanisms and proper choices can lead to a performance gain over the baseline, and 2) The same locality mechanism is successfully applied to vision transformers with different architecture designs, which shows the generalization of the locality concept. For ImageNet2012 classification, the locality-enhanced transformers outperform the baselines Swin-T [1], DeiT-T [2] and PVT-T [3] by 1.0%, 2.6 % and 3.1 % with a negligible increase in the number of parameters and computational effort. Code is available at https://***/ofsoundof/LocalViT.

关键词：

Toward Efficient Automated Feature Engineering

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Kafeng Wang, Pengyang Xu, Chengzhong Shenzhen Institute of Advanced Technology Chinese Academy of Sciences University of Chinese Academy of Sciences University of Macau China Guangdong-Hong Kong-Macao Joint Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen China State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China

utomated Feature Engineering (AFE) refers to automatically generate and select optimal feature sets for downstream tasks, which has achieved great success in real-world applications. Current AFE methods mainly focus on improving the effectiveness of the produced features, but ignoring the low-efficiency issue for large-scale deployment. Therefore, in this work, we propose a generic framework to improve the efficiency of AFE. Specifically, we construct the AFE pipeline based on reinforcement learning setting, where each feature is assigned an agent to perform feature transformation and selection, and the evaluation score of the produced features in downstream tasks serve as the reward to update the policy. We improve the efficiency of AFE in two perspectives. On the one hand, we develop a Feature Pre-Evaluation (FPE) Model to reduce the sample size and feature size that are two main factors on undermining the efficiency of feature evaluation. On the other hand, we devise a two-stage policy training strategy by running FPE on the pre-evaluation task as the initialization of the policy to avoid training policy from scratch. We conduct comprehensive experiments on 36 datasets in terms of both classification and regression tasks. The results show 2.9% higher performance in average and 2x higher computational efficiency comparing to state-of-the-art AFE methods. © 2022, CC BY.

关键词： Reinforcement learning

Neural multi-objective combinatorial optimization with diversity enhancement 23

学校读者我要写书评

暂无评论

Neural multi-objective combinatorial optimization with diver...

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Jinbiao Chen Zizhen Zhang Zhiguang Cao Yaoxin Wu Yining Ma Te Ye Jiahai Wang School of Computer Science and Engineering Sun Yat-sen University P.R. China School of Computing and Information Systems Singapore Management University Singapore Department of Industrial Engineering & Innovation Sciences Eindhoven University of Technology Netherlands Department of Industrial Systems Engineering & Management National University of Singapore Singapore School of Computer Science and Engineering Sun Yat-sen University P.R. China and Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Sun Yat-sen University P.R. China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou P.R. China

关键词：