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

The effect of data augmentation on classification of atrial fibrillation in short single-lead ecg signals using deep neural networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Hatamian, Faezeh Nejati Ravikumar, Nishant Vesal, Sulaiman Kemeth, Felix P. Struck, Matthias Maier, Andreas Department of Image Processing and Medical Technology Fraunhofer Institute for Integrated Circuits IIS Erlangen Germany Pattern Recognition Lab Department of Computer Science Friedrich-Alexander University Erlangen-Nrnberg Erlangen Germany School of Computing LICAMM Leeds Institute of Cardiovascular and Metabolic Medicine School of Medicine University of Leeds United Kingdom

Cardiovascular diseases are the most common cause of mortality worldwide. Detection of atrial fibrillation (AF) in the asymptomatic stage can help prevent strokes. It also improves clinical decision making through the delivery of suitable treatment such as, anticoagulant therapy, in a timely manner. The clinical significance of such early detection of AF in electrocardiogram (ECG) signals has inspired numerous studies in recent years, of which many aim to solve this task by leveraging machine learning algorithms. ECG datasets containing AF samples, however, usually suffer from severe class imbalance, which if unaccounted for, affects the performance of classification algorithms. Data augmentation is a popular solution to tackle this problem. In this study, we investigate the impact of various data augmentation algorithms, e.g., oversampling, Gaussian Mixture Models (GMMs) and Generative Adversarial Networks (GANs), on solving the class imbalance problem. These algorithms are quantitatively and qualitatively evaluated, compared and discussed in detail. The results show that deep learning-based AF signal classification methods benefit more from data augmentation using GANs and GMMs, than oversampling. Furthermore, the GAN results in circa 3% better AF classification accuracy in average while performing comparably to the GMM in terms of f1-score. Copyright © 2020, The Authors. All rights reserved.

关键词： Diseases

Towards a unified quadrature framework for large-scale kernel machines

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Liu, Fanghui Huang, Xiaolin Chen, Yudong Suykens, Johan A.K. KU Leuven LeuvenB-3001 Belgium Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Institute of Medical Robotics Shanghai Jiao Tong University Shanghai200240 China School of Operations Research and Information Engineering Cornell University IthacaNY14850 United States

In this paper, we develop a quadrature framework for large-scale kernel machines via a numerical integration representation. Considering that the integration domain and measure of typical kernels, e.g., Gaussian kernels, arc-cosine kernels, are fully symmetric, we leverage deterministic fully symmetric interpolatory rules to efficiently compute quadrature nodes and associated weights for kernel approximation. The developed interpolatory rules are able to reduce the number of needed nodes while retaining a high approximation accuracy. Further, we randomize the above deterministic rules by the classical Monte-Carlo sampling and control variates techniques with two merits: 1) The proposed stochastic rules make the dimension of the feature mapping flexibly varying, such that we can control the discrepancy between the original and approximate kernels by tuning the dimnension. 2) Our stochastic rules have nice statistical properties of unbiasedness and variance reduction with fast convergence rate. In addition, we elucidate the relationship between our deterministic/stochastic interpolatory rules and current quadrature rules for kernel approximation, including the sparse grids quadrature and stochastic spherical-radial rules, thereby unifying these methods under our framework. Experimental results on several benchmark datasets show that our methods compare favorably with other representative kernel approximation based methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Stochastic systems

DAmageNet: A universal adversarial dataset

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Chen, Sizhe Huang, Xiaolin He, Zhengbao Sun, Chengjin Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing 800 Dongchuan Road Shanghai200240 China

It is now well known that deep neural networks (DNNs) are vulnerable to adversarial attack. Adversarial samples are similar to the clean ones, but are able to cheat the attacked DNN to produce incorrect predictions in high confidence. But most of the existing adversarial attacks have high success rate only when the information of the attacked DNN is well-known or could be estimated by massive queries. A promising way is to generate adversarial samples with high transferability. By this way, we generate 96020 transferable adversarial samples from original ones in imageNet. The average difference, measured by root means squared deviation, is only around 3.8 on average. However, the adversarial samples are misclassified by various models with an error rate up to 90%. Since the images are generated independently with the attacked DNNs, this is essentially zero-query adversarial attack. We call the dataset DAmageNet, which is the first universal adversarial dataset that beats many models trained in imageNet. By finding the drawbacks, DAmageNet could serve as a benchmark to study and improve robustness of DNNs. DAmageNet could be downloaded in http://***/Show/56/122 Copyright © 2019, The Authors. All rights reserved.

关键词： Deep neural networks

Web Page Classification Algorithm Based on Semi-Supervised Support Vector Machine 2

学校读者我要写书评

暂无评论

Web Page Classification Algorithm Based on Semi-Supervised S...

2nd IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference, IMCEC 2018

作者： Huang, Wenqing You, Hui Zhejiang Sci-Tech University Institute of Computer Vision Image Processing and Pattern Recognition Acceptable School of Information Hangzhou China

ISBN: (纸本)9781538618035

Most web page classification algorithms are learning algorithms under the single-instance single-label framework. Multi-Instance Multi-Label learning is a new machine learning framework. MIMLSVM+ algorithm, using degenerate strategy to transform multiple instances into single instances, and then decomposing multiple labels into a series of two types of classification problems, that is, building an SVM for each label. Because the MIMLSVM+ algorithm degrades the multi-label problem into a series of two types of classification problems, the processing of each label will lose the contact information between the labels independently. Therefore, multi-tasking technology is introduced to make use of the multi-tasking learning framework based on nuclear to validate the MIMLSVM+ expand, get E-MIMLSVM+ algorithm. The paper improves E-MIMLSVM+ algorithm by using the semi-supervised learning method. Experimental results show that the proposed method can achieve higher classification accuracy. © 2018 IEEE.

关键词： Learning algorithms

Mem Brain: An Easy-to-Use Online Webserver for Transmembrane Protein Structure Prediction

学校读者我要写书评

暂无评论

Nano-Micro Letters 2018年第1期10卷 12-19页

作者： Xi Yin Jing Yang Feng Xiao Yang Yang Hong-Bin Shen Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Department of Computer Science Shanghai Jiao Tong University Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering

Membrane proteins are an important kind of proteins embedded in the membranes of cells and play crucial roles in living organisms, such as ion channels,transporters, receptors. Because it is difficult to determinate the membrane protein's structure by wet-lab experiments,accurate and fast amino acid sequence-based computational methods are highly desired. In this paper, we report an online prediction tool called Mem Brain, whose input is the amino acid sequence. Mem Brain consists of specialized modules for predicting transmembrane helices, residue–residue contacts and relative accessible surface area of a-helical membrane proteins. Mem Brain achieves aprediction accuracy of 97.9% of ATMH, 87.1% of AP,3.2 ± 3.0 of N-score, 3.1 ± 2.8 of C-score. Mem BrainContact obtains 62%/64.1% prediction accuracy on training and independent dataset on top L/5 contact prediction,respectively. And Mem Brain-Rasa achieves Pearson correlation coefficient of 0.733 and its mean absolute error of13.593. These prediction results provide valuable hints for revealing the structure and function of membrane *** Brain web server is free for academic use and available at ***/bioinf/Mem Brain/.

关键词： Transmembrane a-helices Structure prediction Machine learning Contact map prediction Relative accessible surface area

EEG-Based Brain-Computer Interfaces Are Vulnerable to Backdoor Attacks

学校读者我要写书评

暂无评论

Research Square

Research Square 2021年

作者： Meng, Lubin Huang, Jian Zeng, Zhigang Jiang, Xue Yu, Shan Jung, Tzyy-Ping Lin, Chin-Teng Chavarriaga, Ricardo Wu, Dongrui Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Brainnetome Center and National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing China La Jolla CA United States Center for Advanced Neurological Engineering Institute of Engineering in Medicine UCSD La Jolla CA United States Centre of Artificial Intelligence Faculty of Engineering and Information Technology University of Technology Sydney Australia ZHAW DataLab Zürich University of Applied Sciences Winterthur8401 Switzerland

Research and development of electroencephalogram (EEG) based brain-computer interfaces (BCIs) have advanced rapidly, partly due to the wide adoption of sophisticated machine learning approaches for decoding the EEG signals. However, recent studies have shown that machine learning algorithms are vulnerable to adversarial attacks, e.g., the attacker can add tiny adversarial perturbations to a test sample to fool the model, or poison the training data to insert a secret backdoor. Previous research has shown that adversarial attacks are also possible for EEG-based BCIs. However, only adversarial perturbations have been considered, and the approaches are theoretically sound but very difficult to implement in practice. This article proposes to use narrow period pulse for poisoning attack of EEG-based BCIs, which is more feasible in practice and has never been considered before. One can create dangerous backdoors in the machine learning model by injecting poisoning samples into the training set. Test samples with the backdoor key will then be classified into the target class specified by the attacker. What most distinguishes our approach from previous ones is that the backdoor key does not need to be synchronized with the EEG trials, making it very easy to implement. The effectiveness and robustness of the backdoor attack approach is demonstrated, highlighting a critical security concern for EEG-based BCIs. © 2021, CC BY.

关键词： Electroencephalography

The Effect of Data Augmentation on Classification of Atrial Fibrillation in Short Single-Lead ECG Signals Using Deep Neural Networks

学校读者我要写书评

暂无评论

The Effect of Data Augmentation on Classification of Atrial ...

IEEE International Conference on Acoustics, Speech and Signal processing

作者： Faezeh Nejati Hatamian Nishant Ravikumar Sulaiman Vesal Felix P. Kemeth Matthias Struck Andreas Maier Department of Image Processing and Medical Technology Fraunhofer Institute for Integrated Circuits IIS Erlangen Germany Centre for Computational Imaging and Simulation Technologies in Biomedicine (CISTIB) School of Computing LICAMM Leeds Institute of Cardiovascular and Metabolic Medicine School of Medicine University of Leeds United Kingdom Pattern Recognition Lab Friedrich-Alexander University Erlangen-Nürnberg Erlangen Germany

ISBN: (数字)9781509066315

ISBN: (纸本)9781509066322

关键词：

Data consistent artifact reduction for limited angle tomography with deep learning prior

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Huang, Yixing Preuhs, Alexander Lauritsch, Günter Manhart, Michael Huang, Xiaolin Maier, Andreas Pattern Recognition Lab Friedrich-Alexander-Universitt Erlangen-Nrnberg Erlangen91058 Germany Siemens Healthcare GmbH Forchheim91301 Germany Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Erlangen91058 Germany

Robustness of deep learning methods for limited angle tomography is challenged by two major factors: a) due to insufficient training data the network may not generalize well to unseen data;b) deep learning methods are sensitive to noise. Thus, generating reconstructed images directly from a neural network appears inadequate. We propose to constrain the reconstructed images to be consistent with the measured projection data, while the unmeasured information is complemented by learning based methods. For this purpose, a data consistent artifact reduction (DCAR) method is introduced: First, a prior image is generated from an initial limited angle reconstruction via deep learning as a substitute for missing information. Afterwards, a conventional iterative reconstruction algorithm is applied, integrating the data consistency in the measured angular range and the prior information in the missing angular range. This ensures data integrity in the measured area, while inaccuracies incorporated by the deep learning prior lie only in areas where no information is acquired. The proposed DCAR method achieves significant image quality improvement: for 120° cone-beam limited angle tomography more than 10% RMSE reduction in noise-free case and more than 24% RMSE reduction in noisy case compared with a state-of-the-art U-Net based method. Copyright © 2019, The Authors. All rights reserved.

关键词： image enhancement

Road segmentation for remote sensing images using adversarial spatial pyramid networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Shamsolmoali, Pourya Zareapoor, Masoumeh Zhou, Huiyu Wang, Ruili Yang, Jie Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China School of Informatics University of Leicester LeicesterLE1 7RH United Kingdom School of Logistics and Transportation Central South University of Forestry and Technology China School of Natural and Computational Sciences Massey University Auckland New Zealand

To read the paper please go to IEEE Transactions on Geoscience and Remote Sensing on IEEE Xplore. Road extraction in remote sensing images is of great importance for a wide range of applications. Because of the complex background, and high density, most of the existing methods fail to accurately extract a road network that appears correct and complete. Moreover, they suffer from either insufficient training data or high costs of manual annotation. To address these problems, we introduce a new model to apply structured domain adaption for synthetic image generation and road segmentation. We incorporate a feature pyramid network into generative adversarial networks to minimize the difference between the source and target domains. A generator is learned to produce quality synthetic images, and the discriminator attempts to distinguish them. We also propose a feature pyramid network that improves the performance of the proposed model by extracting effective features from all the layers of the network for describing different scales’ objects. Indeed, a novel scale-wise architecture is introduced to learn from the multi-level feature maps and improve the semantics of the features. For optimization, the model is trained by a joint reconstruction loss function, which minimizes the difference between the fake images and the real ones. A wide range of experiments on three datasets prove the superior performance of the proposed approach in terms of accuracy and efficiency. In particular, our model achieves state-of-the-art 78.86 IOU on the Massachusetts dataset with 14.89M parameters and 86.78B FLOPs, with 4× fewer FLOPs but higher accuracy (+3.47% IOU) than the top performer among state-of-the-art approaches used in the evaluation. Copyright © 2020, The Authors. All rights reserved.

关键词： Generative adversarial networks