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

Accurately Identifying Coronary Atherosclerotic Heart Disease through Merged Beats of Electrocardiogram

学校读者我要写书评

暂无评论

Accurately Identifying Coronary Atherosclerotic Heart Diseas...

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Wang, Xinfeng Qi, Mengling Dong, Chengzhi Zhang, Haoyang Yang, Yuedong Zhao, Huiying Sun Yat-sen University Key Laboratory of Machine Intelligence and Advanced Computing of Moe School of Computer Science and Engineering Guangzhou China Sun Yat-sen Memorial Hospital Guangdong Provincial Key Laboratory of Malignant Tumor Epigenetics and Gene Regulation Department of Medical Research Center Guangzhou China Sun Yat-sen University School of Life Sciences Guangzhou China

ISBN: (纸本)9781665468190

Coronary Atherosclerotic Heart Disease (CAHD) is one kind of severe heart disease that is the dominating cause of death from non-communicable diseases worldwide. CAHD can be early detected through pre-symptomatic health check-ups, and the electrocardiogram (ECG) is common for non-invasive health check diagnoses. Traditionally, ECG signals are utilized to extract clinical features that are then input into machine learning methods for training and prediction. While these extracted features are interpretable, they are difficult to break through known features. On the other hand, ECG can be directly input to deep learning techniques, but such methods are usually limited by small sample sizes. Here, we propose to merge multiple beats of raw signal into one beat, which greatly reduces the complexity while maintaining the raw information. Moreover, we have constructed the largest benchmark dataset for 1113 CAHD patients of 12-lead ECG signals from the UK Biobank database and used the data to train a deep learning model. The results indicated that merged beat signals could achieve the best performance corresponding to an AUC of 0.71 and accuracy of 0.7, which is 4% higher than models using the raw signals and 6% higher than those using the clinical features. Further intuitive interpretation revealed that ST waves in lead II and V3 are the most closely associated with CAHD, consistent with clinical observations. © 2022 IEEE.

关键词： Electrocardiograms

A Review of Uncertainty Estimation and its Application in Medical Imaging

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zou, Ke Chen, Zhihao Yuan, Xuedong Shen, Xiaojing Wang, Meng Fu, Huazhu The National Key Laboratory of Fundamental Science on Synthetic Vision The College of Computer Science Sichuan University Chengdu610065 China The College of Intelligence and Computing Tianjin University Tianjin300350 China The Department of Mathematics Sichuan University Chengdu610065 China Singapore138632 Singapore

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, CC BY.

关键词： Medical imaging

Learning Multi-dimensional Edge Feature-based AU Relation Graph for Facial Action Unit Recognition

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Luo, Cheng Song, Siyang Xie, Weicheng Shen, Linlin Gunes, Hatice Computer Vision Institute Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China Guangdong Key Laboratory of Intelligent Information Processing China Department of Computer Science and Technology University of Cambridge United Kingdom

The activations of Facial Action Units (AUs) mutually influence one another. While the relationship between a pair of AUs can be complex and unique, existing approaches fail to specifically and explicitly represent such cues for each pair of AUs in each facial display. This paper proposes an AU relationship modelling approach that deep learns a unique graph to explicitly describe the relationship between each pair of AUs of the target facial display. Our approach first encodes each AU’s activation status and its association with other AUs into a node feature. Then, it learns a pair of multi-dimensional edge features to describe multiple task-specific relationship cues between each pair of AUs. During both node and edge feature learning, our approach also considers the influence of the unique facial display on AUs’ relationship by taking the full face representation as an input. Experimental results on BP4D and DISFA datasets show that both node and edge feature learning modules provide large performance improvements for CNN and transformer-based backbones, with our best systems achieving the state-of-the-art AU recognition results. Our approach not only has a strong capability in modelling relationship cues for AU recognition but also can be easily incorporated into various backbones. Our PyTorch code is made available at https://***/CVI-SZU/ME-GraphAU. Copyright © 2022, The Authors. All rights reserved.

关键词： Chemical activation

A Dual-Level Cancelable Framework for Palmprint Verification and Hack-Proof Data Storage

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Ziyuan Kang, Ming Teoh, Andrew Beng Jin Gao, Chengrui Chen, Wen Zhang, Bob Zhang, Yi The College of Computer Science Key Laboratory of Data Protection and Intelligent Management Ministry of Education Sichuan University Chengdu610065 China The School of Cyber Science and Engineering Sichuan University Chengdu610065 China The School of Electrical and Electronic Engineering College of Engineering Yonsei University Seoul Korea Republic of The College of Computer Science Sichuan University Chengdu610065 China The Pattern Analysis and Machine Intelligence Group Department of Computer and Information Science University of Macau Taipa China The School of Cyber Science and Engineering Key Laboratory of Data Protection and Intelligent Management Ministry of Education Sichuan University Chengdu610065 China

In recent years, palmprints have been widely used for individual verification. The rich privacy information in palmprint data necessitates its protection to ensure security and privacy without sacrificing system performance. Existing systems often use cancelable technologies to protect templates, but these technologies ignore the potential risk of data leakage. Upon breaching the system and gaining access to the stored database, a hacker could easily manipulate the stored templates, compromising the security of the verification system. To address this issue, we propose a dual-level cancelable palmprint verification framework in this paper. Specifically, the raw template is initially encrypted using a competition hashing network with a first-level token, facilitating the end-to-end generation of cancelable templates. Different from previous works, the protected template undergoes further encryption to differentiate the second-level protected template from the first-level one. The system specifically creates a negative database (NDB) with the second-level token for dual-level protection during the enrollment stage. Reversing the NDB is NP-hard and a fine-grained algorithm for NDB generation is introduced to manage the noise and specified bits. During the verification stage, we propose an NDB matching algorithm based on matrix operation to accelerate the matching process of previous NDB methods caused by dictionary-based matching rules. This approach circumvents the need to store templates identical to those utilized for verification, reducing the risk of potential data leakage. Extensive experiments conducted on public palmprint datasets have confirmed the effectiveness and generality of the proposed framework. Upon acceptance of the paper, the code will be accessible at https://***/Deep-Imaging-Group/NPR. Copyright © 2024, The Authors. All rights reserved.

关键词： Digital storage

Efficient Multi-Query Oriented Continuous Subgraph Matching

学校读者我要写书评

暂无评论

Efficient Multi-Query Oriented Continuous Subgraph Matching

International Conference on Data Engineering

作者： Ziyi Ma Jianye Yang Xu Zhou Guoqing Xiao Jianhua Wang Liang Yang Kenli Li Xuemin Lin School of Artificial Intelligence Hebei University of Technology China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University China Cyberspace Institute of Advanced Technology Guangzhou University China Department of New Networks PengCheng Laboratory China College of Computer Science and Electronic Engineering Hunan University China Shenzhen Research Institute Hunan University China Antai College of Economics and Management Shanghai Jiao Tong University China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Continuous subgraph matching (CSM) is a critical task for analyzing dynamic graphs and has a wide range of applications, such as merchant fraud detection, cyber-attack hunting, and rumor detection. Although many efficient CSM algorithms have been recently proposed, they are mainly designed to process a single query. However, in some application scenarios, multi-query oriented continuous subgraph matching (MQCSM) may be of more interest. To our knowledge, the two existing solutions to MQCSM are outdated due to unsatisfactory performance. In this paper, we propose MQ-Match, an efficient approach to MQCSM. First, we design a compact yet effective index structure CCG, which maintains the local matching result of vertices in the data graph using a directed graph. The directed edges in CCG can be utilized as an effective pruning rule for the subsequent incremental matching algorithm when expanding a partial match. Then, we develop a computation sharing incremental matching algorithm. In specific, a set of matching trees is constructed based on the depth-first search trees of the query graphs. By utilizing CCG, we conduct subgraph matching for the matching tree to collect the incremental matches for the query graphs, where the common structures of query graphs are matched only once. Extensive experiments show that MQ-Match can achieve 3.1x-7071.4x speedup over the competitors, and consumes much less memory under the majority of the experiment settings.

关键词： Heuristic algorithms Memory management Directed graphs Data engineering Fraud Computational efficiency Indexes

BGTplanner: Maximizing Training Accuracy for Differentially Private Federated Recommenders via Strategic Privacy Budget Allocation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Xianzhi Zhou, Yipeng Hu, Miao Wu, Di Liao, Pengshan Guizani, Mohsen Sheng, Michael The School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China The Department of Computing Faculty of Science and Engineering Macquarie University Sydney Australia The Machine Learning Department Mohamed Bin Zayed University of Artificial Intelligence Abu Dhabi United Arab Emirates

To mitigate the rising concern about privacy leakage, the federated recommender (FR) paradigm emerges, in which decentralized clients co-train the recommendation model without exposing their raw user-item rating data. The differentially private federated recommender (DPFR) further enhances FR by injecting differentially private (DP) noises into clients. Yet, current DPFRs, suffering from noise distortion, cannot achieve satisfactory accuracy. Various efforts have been dedicated to improving DPFRs by adaptively allocating the privacy budget over the learning process. However, due to the intricate relation between privacy budget allocation and model accuracy, existing works are still far from maximizing DPFR accuracy. To address this challenge, we develop BGTplanner (Budget Planner) to strategically allocate the privacy budget for each round of DPFR training, improving overall training performance. Specifically, we leverage the Gaussian process regression and historical information to predict the change in recommendation accuracy with a certain allocated privacy budget. Additionally, Contextual Multi-Armed Bandit (CMAB) is harnessed to make privacy budget allocation decisions by reconciling the current improvement and long-term privacy constraints. Our extensive experimental results on real datasets demonstrate that BGTplanner achieves an average improvement of 6.76% in training performance compared to state-of-the-art baselines. Copyright © 2024, The Authors. All rights reserved.

关键词： Differential privacy

Automatic Polyp Segmentation with Multiple Kernel Dilated Convolution Network

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Tomar, Nikhil Kumar Srivastava, Abhishek Bagci, Ulas Jha, Debesh School of Informatics and Computer Science Indira Gandhi National Open University India Computer Vision and Pattern Recognition Unit Indian Statistical Institute India Machine and Hybrid Intelligence Lab Department of Radiology Feinberg School of Medicine Northwestern University United States

The detection and removal of precancerous polyps through colonoscopy is the primary technique for the prevention of colorectal cancer worldwide. However, the miss rate of colorectal polyp varies significantly among the endoscopists. It is well known that a computer-aided diagnosis (CAD) system can assist endoscopists in detecting colon polyps and minimize the variation among endoscopists. In this study, we introduce a novel deep learning architecture, named MKDCNet, for automatic polyp segmentation robust to significant changes in polyp data distribution. MKDCNet is simply an encoder-decoder neural network that uses the pre-trained ResNet50 as the encoder and novel multiple kernel dilated convolution (MKDC) block that expands the field of view to learn more robust and heterogeneous representation. Extensive experiments on four publicly available polyp datasets and cell nuclei dataset show that the proposed MKDCNet outperforms the state-of-the-art methods when trained and tested on the same dataset as well when tested on unseen polyp datasets from different distributions. With rich results, we demonstrated the robustness of the proposed architecture. From an efficiency perspective, our algorithm can process at (≈ 45) frames per second on RTX 3090 GPU. MKDCNet can be a strong benchmark for building real-time systems for clinical colonoscopies. The code of the proposed MKDCNet is available at https://***/nikhilroxtomar/MKDCNet. © 2022, CC BY.

关键词： Convolution

Emergence and reconfiguration of modular structure for synaptic neural networks during continual familiarity detection

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Gu, Shi Mattar, Marcelo G. Tang, Huajin Pan, Gang School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China Shenzhen China Psychology Department New York University United States College of Computer Science and Technology Zhejiang University Hangzhou China State Key Laboratory of Brain Machine Intelligence Zhejiang University Hangzhou China

While advances in artificial intelligence and neuroscience have enabled the emergence of neural networks capable of learning a wide variety of tasks, our understanding of the temporal dynamics of these networks remains limited. Here, we study the temporal dynamics during learning of Hebbian Feedforward (HebbFF) neural networks in tasks of continual familiarity detection. Drawing inspiration from the field of network neuroscience, we examine the network's dynamic reconfiguration, focusing on how network modules evolve throughout learning. Through a comprehensive assessment involving metrics like network accuracy, modular flexibility, and distribution entropy across diverse learning modes, our approach reveals various previously unknown patterns of network reconfiguration. In particular, we find that the emergence of network modularity is a salient predictor of performance, and that modularization strengthens with increasing flexibility throughout learning. These insights not only elucidate the nuanced interplay of network modularity, accuracy, and learning dynamics but also bridge our understanding of learning in artificial and biological realms. © 2023, CC BY.

关键词： Feedforward neural networks

State Derivative Normalization for Continuous-Time Deep Neural Networks

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Weigand, Jonas Beintema, Gerben I. Ulmen, Jonas Görges, Daniel Tóth, Roland Schoukens, Maarten Ruskowski, Martin Chair of Machine Tools and Control Systems RPTU Kaiserslautern The German Research Center for Artificial Intelligence Kaiserslautern Germany Group The Department of Electrical Engineering Eindhoven University of Technology Netherlands The Systems and Control Laboratory The Institute for Computer Science and Control Budapest Hungary Institute for Electromobility RPTU Kaiserslautern Germany

The importance of proper data normalization for deep neural networks is well known. However, in continuous-time state-space model estimation, it has been observed that improper normalization of either the hidden state or hidden state derivative of the model estimate, or even of the time interval can lead to numerical and optimization challenges with deep learning based methods. This results in a reduced model quality. In this contribution, we show that these three normalization tasks are inherently coupled. Due to the existence of this coupling, we propose a solution to all three normalization challenges by introducing a normalization constant at the state derivative level. We show that the appropriate choice of the normalization constant is related to the dynamics of the to-be-identified system and we derive multiple methods of obtaining an effective normalization constant. We compare and discuss all the normalization strategies on a benchmark problem based on experimental data from a cascaded tanks system and compare our results with other methods of the identification literature. © 2024, CC BY-SA.

关键词： Ordinary differential equations