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

E-Health and Bioengineering Conference (EHB)

作者： Shahin Amiriparian Maurice Gerczuk Justina Lutz Wolfgang Strube Irina Papazova Alkomiet Hasan Alexander Kathan Björn W. Schuller Chair of Health Informatics TUM University Hospital Munich Germany Munich Center for Machine Learning (MCML) Germany Department of Psychiatry Psychotherapy and Psychosomatics Faculty of Medicine University of Augsburg Germany German Center for Mental Health Munich Germany Munich Data Science Institute (MDSI) Germany

ISBN: (数字)9798331532147

ISBN: (纸本)9798331532154

The delayed access to specialized psychiatric assessments and care for patients at risk of suicidal tendencies in emergency departments creates a notable gap in timely intervention, hindering the provision of adequate mental health support during critical situations. To address this, we present a non-invasive, speech-based approach for automatic suicide risk assessment. For our study, we collected a novel speech recording dataset from 20 patients. We extract three sets of features, including wav2vec, interpretable speech and acoustic features, and deep learning-based spectral representations. We proceed by conducting a binary classification to assess suicide risk in a leave-one-subject-out fashion. Our most effective speech model achieves a balanced accuracy of 66.2%. Moreover, we show that integrating our speech model with a series of patients' metadata, such as the history of suicide attempts or access to firearms, improves the overall result. The metadata integration yields a balanced accuracy of 94.4%, marking an absolute improvement of 28.2 %, demonstrating the efficacy of our proposed approaches for automatic suicide risk assessment in emergency medicine.

关键词： Accuracy Speech analysis Emergency medicine Mental health Metadata Predictive models Feature extraction Recording Risk management History

来源：评论

学校读者我要写书评

暂无评论

RecycleNet: Latent Feature Recycling Leads to Iterative Decision Refinement

RecycleNet: Latent Feature Recycling Leads to Iterative Deci...

引用

IEEE Workshop on Applications of Computer Vision (WACV)

作者： Gregor Koehler Tassilo Wald Constantin Ulrich David Zimmerer Paul F. Jaeger Jörg K. H. Franke Simon Kohl Fabian Isensee Klaus H. Maier-Hein Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg Germany Helmholtz Information and Data Science School for Health Karlsruhe/Heidelberg Germany Helmholtz Imaging DKFZ National Center for Tumor Diseases (NCT) NCT Heidelberg a Partnership Between DKFZ University Medical Center Heidelberg Interactive Machine Learning Group DKFZ Machine Learning Lab University of Freiburg Freiburg Germany Latent Labs (***) London UK Applied Computer Vision Lab DKFZ Pattern Analysis and Learning Group Heidelberg University Hospital Heidelberg Germany

Despite the remarkable success of deep learning systems over the last decade, a key difference still remains between neural network and human decision-making: As humans, we can not only form a decision on the spot, but also ponder, revisiting an initial guess from different angles, distilling relevant information, arriving at a better decision. Here, we propose RecycleNet, a latent feature recycling method, instilling the pondering capability for neural networks to refine initial decisions over a number of recycling steps, where outputs are fed back into earlier network layers in an iterative fashion. This approach makes minimal assumptions about the neural network architecture and thus can be implemented in a wide variety of contexts. Using medical image segmentation as the evaluation environment, we show that latent feature recycling enables the network to iteratively refine initial predictions even beyond the iterations seen during training, converging towards an improved decision. We evaluate this across a variety of segmentation benchmarks and show consistent improvements even compared with top-performing segmentation methods. This allows trading increased computation time for improved performance, which can be beneficial, especially for safety-critical applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-consensus decentralized accelerated gradient descent

The Journal of Machine Learning Research

引用

The Journal of machine learning Research 2023年第1期24卷 14474-14523页

作者： Haishan Ye Luo Luo Ziang Zhou Tong Zhang Center for Intelligent Decision-Making and Machine Learning School of Management Xi'an Jiaotong University Xi'an China School of Data Science Fudan University Shanghai China Department of Computing The Hong Kong Polytechnic University Hong Kong China Computer Science & Mathematics The Hong Kong University of Science and Technology Hong Kong China

This paper considers the decentralized convex optimization problem, which has a wide range of applications in large-scale machine learning, sensor networks, and control theory. We propose novel algorithms that achieve optimal computation complexity and near optimal communication complexity. Our theoretical results give affirmative answers to the open problem on whether there exists an algorithm that can achieve a communication complexity (nearly) matching the lower bound depending on the global condition number instead of the local one. Furthermore, the linear convergence of our algorithms only depends on the strong convexity of global objective and it does not require the local functions to be convex. The design of our methods relies on a novel integration of well-known techniques including Nesterov's acceleration, multi-consensus and gradient-tracking. Empirical studies show the outperformance of our methods for machine learning applications.

关键词： consensus optimization decentralized algorithm accelerated gradient descent gradient tracking composite optimization

来源：评论

学校读者我要写书评

暂无评论

MSI-UNet: A Flexible UNet-Based Multi-Scale Interactive Framework for 3D Gastric Tumor Segmentation on CT Scans

MSI-UNet: A Flexible UNet-Based Multi-Scale Interactive Fram...

引用

IEEE International Symposium on Biomedical Imaging

作者： Heyun Chen Zifan Chen Jie Zhao Haoshen Li Jiazheng Li Yiting Liu Mingze Yuan Peng Bao Xinyu Nan Bin Dong Lei Tang Li Zhang Center for Data Science Peking University China National Engineering Laboratory for Big Data Analysis and Applications Peking University China Peking University Changsha Institute for Computing and Digital Economy China Peking University Cancer Hospital&Institute China Beijing International Center for Mathematical Research Peking University China Center for Machine Learning Research Peking University China

ISBN: (数字)9798350313338

ISBN: (纸本)9798350313345

Accurate segmentation of gastric tumors is critical yet presents a formidable challenge in medical imaging, where conventional UNet-based frameworks, despite their prevalence, falter on intricate tumor samples due to their limited interactive capacities. The SAM-based segmentation methods address this shortcoming yet with insufficient accuracy. By ingeniously blending images with mask inputs, our MSI-UNet leverages a U-shaped design to deliver pixel-perfect segmentation accuracy, while a novel multi-scale attention module adeptly harnesses interaction points for refined information extraction. When benchmarked on gastric tumor segmentation tasks, MSI-UNet surpasses existing state-of-the-art methods, elevating the Dice Similarity Coefficient (DSC) from 74.82% to 79.3% and minimizing Average Surface Distance (ASD) from 6.46 to 1.98, achieving a comparable accuracy with inter-radiologist consistency of 79.7% DSC. Furthermore, our framework demonstrates superior predictive prowess in survival analysis, enhancing the C-index from 61.7% to 68.68%. Ample experimental comparisons have substantiated that MSI-UNet holds the potential to offer considerable assistance to healthcare professionals in managing and decoding subsequent medical procedures.

关键词： Image segmentation Accuracy Three-dimensional displays Medical services Predictive models Information retrieval Decoding

来源：评论

学校读者我要写书评

暂无评论

PolyGNN: Polyhedron-based Graph Neural Network for 3D Building Reconstruction from Point Clouds

arXiv

引用

arXiv 2023年

作者： Chen, Zhaiyu Shi, Yilei Nan, Liangliang Xiong, Zhitong Zhu, Xiao Xiang Data Science in Earth Observation Technical University of Munich Munich80333 Germany School of Engineering and Design Technical University of Munich Munich80333 Germany Urban Data Science Delft University of Technology Delft2628 BL Netherlands Munich Center for Machine Learning Munich80333 Germany

We present PolyGNN, a polyhedron-based graph neural network for 3D building reconstruction from point clouds. PolyGNN learns to assemble primitives obtained by polyhedral decomposition via graph node classification, achieving a watertight and compact reconstruction. To effectively represent arbitrary-shaped polyhedra in the neural network, we propose a skeleton-based sampling strategy to generate polyhedron-wise queries. These queries are then incorporated with inter-polyhedron adjacency to enhance the classification. PolyGNN is end-to-end optimizable and is designed to accommodate variable-size input points, polyhedra, and queries with an index-driven batching technique. To address the abstraction gap between existing city-building models and the underlying instances, and provide a fair evaluation of the proposed method, we develop our method on a large-scale synthetic dataset with well-defined ground truths of polyhedral labels. We further conduct a transferability analysis across cities and on real-world point clouds. Both qualitative and quantitative results demonstrate the effectiveness of our method, particularly its efficiency for large-scale reconstructions. The source code and data are available at https://***/chenzhaiyu/polygnn. © 2023, CC BY-NC-ND.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

RVPD: An Automated System for Calculating the Tortuosity and Bifurcation Angles of Retinal Vessels to Predict Diseases

RVPD: An Automated System for Calculating the Tortuosity and...

引用

IEEE International Symposium on Biomedical Imaging

作者： Guangzhengao Yang Xingyu Luo Jie Zhao Fangfang Fan Haoshen Li Bin Dong Li Zhang Yan Zhang Center for Data Science Peking University China Department of Cardiology Peking University First Hospital China National Engineering Laboratory for Big Data Analysis and Applications Peking University China Peking University Changsha Institute for Computing and Digital Economy China Beijing International Center for Mathematical Research Peking University China Center for Machine Learning Research Peking University China National Biomedical Imaging Center Peking University China

ISBN: (数字)9798331520526

ISBN: (纸本)9798331520533

Hypertension and diabetes are known to potentially cause morphological changes in the retinal capillary system, yet quantifying these changes presents significant challenges. This research addresses this issue by designing and developing an automated system capable of analyzing retinal images to detect and measure these changes. Our system automatically segments vessels and the optic disc, calculates tortuosity and bifurcation angles, and performs disease prediction based on these measurements along with clinical features. For tortuosity calculation, we adopted a novel curve fitting method, which provides more stable convergence compared to traditional discrete numerical methods. The system integrates clinical data and conducts prediction experiments on hypertensive and diabetic patients with varying sample sizes. Our results demonstrate the system's strong performance and scalability: in the hypertension group, the AUC reached a maximum of 0.814 ± 0.023, with an ACC of 0.735 ± 0.033, while in the diabetes group, the AUC reached a maximum of 0.710 ± 0.043, with an ACC of 0.641 ± 0.052. These findings suggest that our automated system could serve as a valuable tool for early detection and risk assessment of hypertension and diabetes, potentially improving patient outcomes through timely intervention.

关键词： Hypertension Image segmentation Scalability Bifurcation Optical variables measurement Optical imaging Retinal vessels Diabetes Risk management Diseases

来源：评论

学校读者我要写书评

暂无评论

S$^\text{3}$Attention: Improving Long Sequence Attention With Smoothed Skeleton Sketching

引用

IEEE Journal of Selected Topics in Signal Processing 2024年第6期18卷 985-996页

作者： Xue Wang Tian Zhou Jianqing Zhu Jialin Liu Kun Yuan Tao Yao Wotao Yin Rong Jin HanQin Cai Alibaba Group Bellevue WA USA Computer Electrical and Mathematical Science and Engineering Division King Abdullah University of Science and Technology Thuwal Saudi Arabia Department of Statistics and Data Science University of Central Florida Orlando FL USA Center for Machine Learning Research Peking University Beijing China Antai College of Economics and Management Shanghai Jiao Tong University Shanghai China Meta Menlo Park CA USA Department of Statistics and Data Science and the Department of Computer Science University of Central Florida Orlando FL USA

Attention based models have achieved many remarkable breakthroughs in numerous applications. However, the quadratic complexity of Attention makes the vanilla Attention based models hard to apply to long sequence tasks. Various improved Attention structures are proposed to reduce the computation cost by inducing low rankness and approximating the whole sequence by sub-sequences. The most challenging part of those approaches is maintaining the proper balance between information preservation and computation reduction: the longer sub-sequences used, the better information is preserved, but at the price of introducing more noise and computational costs. In this paper, we propose a smoothed skeleton sketching based Attention structure, coined S $^{3}$ Attention, which significantly improves upon the previous attempts to negotiate this trade-off. S $^{3}$ Attention has two mechanisms to effectively minimize the impact of noise while keeping the linear complexity to the sequence length: a smoothing block to mix information over long sequences and a matrix sketching method that simultaneously selects columns and rows from the input matrix. We verify the effectiveness of S $^{3}$ Attention both theoretically and empirically. Extensive studies over Long Range Arena (LRA) datasets and six time-series forecasting show that S $^{3}$ Attention significantly outperforms both vanilla Attention and other state-of-the-art variants of Attention structures.

关键词： Computational modeling Complexity theory Transformers Task analysis Skeleton Kernel Noise

来源：评论

学校读者我要写书评

暂无评论

A PDE Framework of Consensus-Based Optimization for Objectives with Multiple Global Minimizers

arXiv

引用

arXiv 2024年

作者： Fornasier, Massimo Sun, Lukang Technical University of Munich School of Computation Information and Technology Department of Mathematics Munich Germany Munich Center for Machine Learning Munich Germany Munich Data Science Institute Germany King Abdullah University of Science and Technology Thuwal Saudi Arabia KAUST AI Initiative Thuwal Saudi Arabia

Consensus-based optimization (CBO) is an agent-based derivative-free method for non-smooth global optimization that has been introduced in 2017 [40], leveraging a surprising interplay between stochastic exploration and Laplace’s principle. In addition to its versatility and effectiveness in handling high-dimensional, non-convex, and non-smooth optimization problems, this approach lends itself well to theoretical analysis. Indeed, its dynamics is governed by a degenerate nonlinear Fokker–Planck equation, whose large time behavior explains the convergence of the method. Recent results [10, 23] provide guarantees of convergence under the restrictive assumption of unique global minimizer for the objective function. In this work, we propose a novel and simple variation of CBO to tackle non-convex optimization problems with multiple global minimizers. Despite the simplicity of this new model, its analysis is particularly challenging because of its nonlinearity and nonlocal nature. We prove existence of solutions of the corresponding nonlinear Fokker–Planck equation and we show exponential concentration in time to the set of minimizers made of multiple smooth, convex, and compact components. Our proofs require combining several ingredients, such as delicate geometrical arguments, new variants of a quantitative Laplace principle, ad hoc regularizations and approximations, and regularity theory for parabolic equations. Ultimately, this result suggests that the corresponding CBO algorithm, formulated as an Euler–Maruyama discretization of the underlying empirical stochastic process, tends to converge to multiple global minimizers. © 2024, CC BY.

关键词： Fokker Planck equation

来源：评论

学校读者我要写书评

暂无评论

Non-intrusive surrogate modelling using sparse random features with applications in crashworthiness analysis

arXiv

引用

arXiv 2022年

作者： Herold, Maternus Veselovska, Anna Jehle, Jonas Krahmer, Felix Department of Mathematics Technical University of Munich Germany Bmw Group Germany Munich Data Science Institute Germany Munich Center for Machine Learning Germany

Efficient surrogate modelling is a key requirement for uncertainty quantification in data-driven scenarios. In this work, a novel approach of using Sparse Random Features for surrogate modelling in combination with self-supervised dimensionality reduction is described. The method is compared to other methods on synthetic and real data obtained from crashworthiness analyses. The results show a superiority of the here described approach over state of the art surrogate modelling techniques, Polynomial Chaos Expansions and Neural Networks. © 2022, CC BY-NC-ND.

关键词： Crashworthiness

来源：评论

学校读者我要写书评

暂无评论

Urban Land Cover Classification with Efficient Hybrid Quantum machine learning Model

Urban Land Cover Classification with Efficient Hybrid Quantu...

引用

Congress on Evolutionary Computation

作者： Fan Fan Yilei Shi Xiao Xiang Zhu Data Science in Earth Observation Technical University of Munich (TUM) Munich Germany German Aerospace Center (DLR) Remote Sensing Technology Institute (IMF) Wessling Germany School of Engineering and Design Technical University of Munich (TUM) Munich Germany Munich Center for Machine Learning Munich Germany

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Urban land cover classification aims to derive crucial information from earth observation data and categorize it into specific land uses. To achieve accurate classification, sophisticated machine learning models trained with large earth observation data are employed, but the required computation power has become a bottleneck. Quantum computing might tackle this challenge in the future. However, representing images into quantum states for analysis with quantum computing is challenging due to the high demand for quantum resources. To tackle this challenge, we propose a hybrid quantum neural network that can effectively represent and classify remote sensing imagery with reduced quantum resources. Our model was evaluated on the Local Climate Zone (LCZ)-based land cover classification task using the TensorFlow Quantum platform, and the experimental results indicate its validity for accurate urban land cover classification.

关键词： Earth Analytical models Quantum computing Computational modeling Land surface machine learning Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：