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

arXiv 2024年

作者： Christodoulou, Evangelia Reinke, Annika Houhou, Rola Kalinowski, Piotr Erkan, Selen Sudre, Carole H. Burgos, Ninon Boutaj, Sofiène Loizillon, Sophie Solal, Maëlys Rieke, Nicola Cheplygina, Veronika Antonelli, Michela Mayer, Leon D. Tizabi, Minu D. Jorge Cardoso, M. Simpson, Amber Jäger, Paul F. Kopp-Schneider, Annette Varoquaux, Gaël Colliot, Olivier Maier-Hein, Lena Heidelberg Div. Intelligent Medical Systems Germany AI Health Innovation Cluster Germany NCT Heidelberg a partnership between DKFZ Heidelberg University Hospital Germany DKFZ Heidelberg Helmholtz Imaging Germany HIDSS4Health - Helmholtz Information and Data Science School for Health Germany DKFZ Heidelberg Interactive Machine Learning Group Germany MRC Unit for Lifelong Health and Ageing UCL Centre for Medical Image Computing Department of Computer Science University College London United Kingdom School of Biomedical Engineering and Imaging Science King’s College London United Kingdom Sorbonne Université Institut du Cerveau - Paris Brain Institute - ICM CNRS Inria Inserm AP-HP Hôpital de la Pitié-Salpêtrière France NVIDIA Germany Department of Computer Science IT University of Copenhagen Denmark Centre for Medical Image Computing University College London United Kingdom School of Computing Queen’s University Canada Department of Biomedical and Molecular Sciences Queen’s University Canada Division of Biostatistics DKFZ Germany Parietal project team INRIA Saclay-Île de France France Faculty of Mathematics and Computer Science Heidelberg University Germany Medical Faculty Heidelberg University Germany

Medical imaging is spearheading the AI transformation of healthcare. Performance reporting is key to determine which methods should be translated into clinical practice. Frequently, broad conclusions are simply derived from mean performance values. In this paper, we argue that this common practice is often a misleading simplification as it ignores performance variability. Our contribution is threefold. (1) Analyzing all MICCAI segmentation papers (n = 221) published in 2023, we first observe that more than 50% of papers do not assess performance variability at all. Moreover, only one (0.5%) paper reported confidence intervals (CIs) for model performance. (2) To address the reporting bottleneck, we show that the unreported standard deviation (SD) in segmentation papers can be approximated by a second-order polynomial function of the mean Dice similarity coefficient (DSC). Based on external validation data from 56 previous MICCAI challenges, we demonstrate that this approximation can accurately reconstruct the CI of a method using information provided in publications. (3) Finally, we reconstructed 95% CIs around the mean DSC of MICCAI 2023 segmentation papers. The median CI width was 0.03 which is three times larger than the median performance gap between the first and second ranked method. For more than 60% of papers, the mean performance of the second-ranked method was within the CI of the first-ranked method. We conclude that current publications typically do not provide sufficient evidence to support which models could potentially be translated into clinical practice. © 2024, CC BY.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Clarifying Assumptions about Artificial Intelligence before Revolutionising Patent Law

引用

GRUR International 2022年第4期71卷 295-321页

作者： Kim, Daria Alber, Maximilian Kwok, Man Wai Mitrovic, Jelena Ramirez-Atencia, Cristian Perez, Jesus Alberto Rodriguez Zille, Heiner Max Planck Institute for Innovation and Competition Munich Germany Charite Institute of Pathology Berlin Germany Chinese University of Hong Kong Department of Physics (Formerly) Hong Kong BMBF Program for Women in AI Faculty of Computer Science and Mathematics Chair of Data Science University of Passau Germany Department of Computer Systems Universidad Politecnica de Madrid Spain School of Computing Science College of Science and Engineering University of Glasgow United Kingdom Faculty of Computer Science Otto von Guericke University Magdeburg Germany

This paper examines several widespread assumptions about artificial intelligence, particularly machine learning, that are often taken as factual premises in discussions on the future of patent law in the wake of 'artificial ingenuity'. The objective is to draw a more realistic and nuanced picture of the human-computer interaction in solving technical problems than where 'intelligent' systems autonomously yield inventions. A detailed technical perspective is presented for each assumption, followed by a discussion of pertinent uncertainties for patent law. Overall, it is argued that implications of machine learning for the patent system in its core tenets appear far less revolutionary than is often posited. © 2022 Published by OUP and CH Beck on behalf of GRUR e.V.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Social-enhanced recommendation using graph-based contrastive learning

Social-enhanced recommendation using graph-based contrastive...

引用

IEEE International Conference on High Performance computing and Communications (HPCC)

作者： Peng Xue Qian Gao Jun Fan Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan Shandong China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan Shandong China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Shandong China China Telecom Digital Intelligence Techonology Co Ltd Jinan Shandong China

The social network-based recommendation model use social network information to mitigate data sparsity issues and improve the accuracy of recommendation models. However, In most social network-based recommendation algorithms, the social neighbors' contributions are difficult to distinguish from the central user's, neglecting hidden correlations in social infor-mation. In order to solve this problem, this paper presents a graph-based contrastive learning framework for social-enhanced recommendation (SoGCLR) that utilizes implicit social information captured by a new social relation attention mechanism, en-rich user representations, and improve model robustness through graph-based contrastive learning. Specifically, the paper captures the degree of contribution of each neighbor in the social graph to the central user through a social relation attention layer, thus obtaining hidden correlations in social information, and further integrates this with user information in the user-item interaction graph to enrich user representations. In addition, the paper incorporates graph-based contrastive learning into the recommendation task using cross-layer contrastive learning, calculating contrastive loss and mapping nodes with similar but different exposure rates to nearby regions to mitigate exposure bias issues. Results from Ciao and Epinions demonstrate that SoGCLR reduces RMSE and MAE by 1.33% to 1.84% compared with baseline models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Longitudinal Segmentation of MS Lesions via Temporal Difference Weighting

arXiv

引用

arXiv 2024年

作者： Rokuss, Maximilian R. Kirchhoff, Yannick Roy, Saikat Kovacs, Balint Ulrich, Constantin Wald, Tassilo Zenk, Maximilian Denner, Stefan Isensee, Fabian Vollmuth, Philipp Kleesiek, Jens Maier-Hein, Klaus Heidelberg Division of Medical Image Computing Germany Faculty of Mathematics and Computer Science Heidelberg University Germany HIDSS4Health - Helmholtz Information and Data Science School for Health Karlsruhe Heidelberg Germany Medical Faculty Heidelberg Heidelberg University Heidelberg Germany Helmholtz Imaging German Cancer Research Center Heidelberg Germany Department of Neuroradiology Heidelberg University Hospital Heidelberg Germany Division for Computational Neuroimaging Department of Neuroradiology Heidelberg University Hospital Heidelberg Germany University Hospital Essen Essen Germany West German Cancer Center Essen University Hospital Essen Essen Germany Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Germany

Accurate segmentation of Multiple Sclerosis (MS) lesions in longitudinal MRI scans is crucial for monitoring disease progression and treatment efficacy. Although changes across time are taken into account when assessing images in clinical practice, most existing deep learning methods treat scans from different timepoints separately. Among studies utilizing longitudinal images, a simple channel-wise concatenation is the primary albeit suboptimal method employed to integrate timepoints. We introduce a novel approach that explicitly incorporates temporal differences between baseline and follow-up scans through a unique architectural inductive bias called Difference Weighting Block. It merges features from two timepoints, emphasizing changes between scans. We achieve superior scores in lesion segmentation (Dice Score, Hausdorff distance) as well as lesion detection (lesion-level F1 score) as compared to state-of-the-art longitudinal and single timepoint models across two datasets. Our code is made publicly available at: ***/MIC-DKFZ/ Longitudinal-Difference-Weighting. © 2024, CC BY.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

LI-FPN: Depression and Anxiety Detection from Learning and Imitation

LI-FPN: Depression and Anxiety Detection from Learning and I...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xingyun Li Lin Lu Xinyu Yi Hao Wang Yunshao Zheng Yanhong Yu Qingxiang Wang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Shandong Mental Health Center Jinan China Shandong University of Traditional Chinese Medicine Jinan China

With the rise in societal pressures, depression and anxiety have increasingly become prominent mental health conditions impacting people’s lives. To enhance the efficacy of automatic detection for these disorders, we have developed an experimental framework called the Voluntary Facial Expression Mimicry(VFEM). This framework led to the creation of the VFEM dataset, which supports related research endeavors. Subsequently, we introduce the LI-FPN designed specifically for the automatic identification of depression and anxiety disorders. The LI-FPN comprises two core components: the Learning and Imitation Module(LIM) and the Spatio-temporal Feature Pyramid Network(STFPN). Within the LIM, we leverage sequence features to facilitate comprehensive feature extraction through learning and imitation steps. The STFPN is designed to focus on outliers in multi-scale features for further screening. Compared with traditional attention methods, LI-FPN is more suitable for processing sequence data features and small sample datasets. Upon training using the VFEM dataset, the LI-FPN achieves impressive accuracies: 0.850 for depression detection, 0.835 for anxiety detection, and 0.786 for co-occurrence detection of depression and anxiety. Meanwhile, LI-FPN also achieves SOAT results on AVEC2014 dataset. The source code for LI-FPN is accessible at https://***/muzixingyun/LI-FPN

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Parallelizable Counterfactual Generation Method Based on Gradient Optimization

A Parallelizable Counterfactual Generation Method Based on G...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Haorun Ding Xuesong Jiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Quan Cheng Laboratory Jinan China State Key Laboratory of High-end Server & Storage Technology Jinan China

Post-hoc explanations are important for people to understand the predictions of explanation models. One class of methods in post-hoc explanation is the generation of counterfactuals, where a hypothetical example is obtained by perturbing the inputs to show how one could obtain a different prediction from the decision model. Counter-factual explanations should satisfy several properties: One is that counterfactuals generated under specific scenarios and constraints should be feasible for users, i.e., they should accommodate different causal constraints. The other is that it is more desirable for users to have a wider variety of viable examples, i.e., counterfactual diversity. To this end, we propose a parallelizable method based on gradient optimization. We partition the input feasible domains, perform counterfactual generation independently for each feasible domain, and then parallelize the counterfactual generation process for each feasible domain. Experimental results show that our approach effectively improves the diversity, sparsity, and proximity of the generated counterfactual instances on the public datasets Adult-Income, Lending-Club, German-Credit, and COMPAS compared to other models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cancelable finger vein authentication using multidimensional scaling based on deep learning

引用

Egyptian Informatics Journal 2025年 30卷

作者： Mohamed Hammad Mohammed ElAffendi Ahmed A. Abd El-Latif EIAS Data Science Lab College of Computer and Information Sciences and Center of Excellence in Quantum and Intelligent Computing Prince Sultan University Riyadh 11586 Saudi Arabia Department of Information Technology Faculty of Computers and Information Menoufia University Shibin El Kom 32511 Egypt Department of Mathematics and Computer Science Faculty of Science Menoufia University 32511 Egypt

In the field of identity verification and identification, biometrics has evolved as a reliable approach for identifying individuals based on their unique physical or behavioral characteristics. The utilization of finger vein authentication has generated significant attention as a biometric modality owing to its strong resilience, resistance against spoofing attacks, and consistent patterns. In this work, we proposed a novel cancelable finger vein authentication system using multidimensional scaling (MDS) based on deep learning. Our method addressed the limitations of previous biometric authentication systems by integrating MDS with a lightweight convolutional neural network (CNN) model for feature extraction. The cancelable approach ensured privacy and security by generating distinct templates for each user. We evaluated our system on three publicly available datasets for finger veins using various performance metrics, including accuracy, precision, recall, and equal error rate (EER). The results demonstrated the effectiveness of our method, which achieved high accuracy, low error rates, and strong performance in diversity and irreversibility tests. Additionally, our system maintained high authentication accuracy while preserving user privacy, making it suitable for practical applications in biometric authentication.

关键词： Authentication Cancelable Deep Learning Finger Vein Multidimensional Scaling

来源：评论

学校读者我要写书评

暂无评论

PANDA: Prompt Transfer Meets Knowledge Distillation for Efficient Model Adaptation

arXiv

引用

arXiv 2022年

作者： Zhong, Qihuang Ding, Liang Liu, Juhua Du, Bo Tao, Dacheng The School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China The School of Computer Science Faculty of Engineering The University of Sydney Sydney Australia The College of Computing & Data Science Nanyang Technological University #32 Block N4 #02a-014 50 Nanyang Avenue Singapore639798 Singapore

Prompt Transfer (PoT) is a recently-proposed approach to improve prompt-tuning, by initializing the target prompt with the existing prompt trained on similar source tasks. However, such a vanilla PoT approach usually achieves sub-optimal performance, as (i) the PoT is sensitive to the similarity of source-target pair and (ii) directly fine-tuning the prompt initialized with source prompt on target task might lead to forgetting of the useful general knowledge learned from source task. To tackle these issues, we propose a new metric to accurately predict the prompt transferability (regarding (i)), and a novel PoT approach (namely PANDA) that leverages the knowledge distillation technique to alleviate the knowledge forgetting effectively (regarding (ii)). Extensive and systematic experiments on 189 combinations of 21 source and 9 target datasets across 5 scales of PLMs demonstrate that: 1) our proposed metric works well to predict the prompt transferability;2) our PANDA consistently outperforms the vanilla PoT approach by 2.3% average score (up to 24.1%) among all tasks and model sizes;3) with our PANDA approach, prompt-tuning can achieve competitive and even better performance than model-tuning in various PLM scales scenarios. We have publicly released our code in https://***/WHU-ZQH/PANDA. Copyright © 2022, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Multi-Channel Hypergraph Convolution Group Recommendation with Member Information Enhancement

Multi-Channel Hypergraph Convolution Group Recommendation wi...

引用

IEEE International Conference on High Performance computing and Communications (HPCC)

作者： Tianhao Chen Qian Gao Jun Fan Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan Shandong China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan Shandong China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Shandong China China Telecom Digital Intelligence Techonology Co Ltd Jinan Shandong China

Group recommendation involves comprehensively considering various aspects, including members and items, to predict the overall interests of a group and recommend suitable items through a recommendation system. With the rapid evolution of the Internet, online group activities have become increasingly prevalent, making group recommendation a highly discussed topic within the realm of recommendation systems. However, current research in group recommendation still confronts the following challenges. Firstly, a predominant portion of group recommendation research focuses solely on aggregating group-level information, neglecting the valuable contribution of higher-order member-level insights to group recommendation. Moreover, some aggregation strategies overly prioritize fairness, thereby disregarding common real-world patterns. Secondly, previous studies have primarily relied on aggregating individual member interests to establish group preferences, lacking a holistic consideration of group dynamics. To tackle these challenges, this study introduces an innovative approach by implementing multi-channel hypergraph convolution within the member perspective. This approach aims to effectively extract higher-order insights from members by utilizing a member information enhancement module. By establishing group interconnections based on similarity and employing an adaptive fusion network to amalgamate multiple viewpoints, a final representation is derived. Experimental results demonstrate that our proposed model surpasses baseline models by 3% to 4% in terms of hit rate and accuracy, validating the efficacy of our approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Rapid Maize Seedling Detection Based on Receptive-Field and Cross-Dimensional Information Interaction

Rapid Maize Seedling Detection Based on Receptive-Field and ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Fengqi Hao Shulei Zhu Dexin Ma Xiangjun Dong Hoiio Kong Xia Liu Chunhua Mu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Faculty of Data Science City University of Macau Macau China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Communication College Qingdao Agricultural University Qingdao China National Engineering Laboratory of Wheat and Maize/Key Laboratory of Biology and Genetic Improvement of Maize in Northern Yellow-huai River Plain Ministry of Agriculture Maize Research Institute Shandong Academy of Agricultural Sciences Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

The seedling stage is important in the growth and development of maize, and it is also a critical period that affects maize yield and quality. Accurately recognizing this stage of maize is challenging, as current maize seedling detection methods struggle with small sizes and complex environments. This paper proposes a rapid maize seedling detection method that emphasizes spatial feature extraction in the receptive field and cross-dimensional interaction—receptive field triplet attention YOLO (RFT-YOLO). First, we design a convolutional module for cross-dimensional information interaction within the receptive field. Second, we introduce an advanced selective fusion network, which boosts the multi-scale fusion capability of small object features while reducing the GFLOPs of the model. Additionally, we employ Inner-IoU to diminish sensitivity to positional biases of small objects and expedite the convergence of the loss function. Finally, we create a dataset of maize seedlings to conduct our experiments. Experimental results demonstrate that the RFT-YOLO significantly enhances performance, reducing the number of parameters by 35.3% and GFLOPs by 14.24%, compared to the baseline model. Moreover, the mean average precision (mAP) improves from 89.6% to 91.5%. These improvements confirm the model's effectiveness in detecting maize seedlings.

关键词： YOLO Sensitivity Accuracy Semantics Feature extraction Complexity theory data mining Cybernetics Convergence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：