scholarly journals A Lightweight Deep Learning Model for Fast Electrocardiographic Beats Classification With a Wearable Cardiac Monitor: Development and Validation Study

10.2196/17037 ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. e17037 ◽  
Author(s):  
Eunjoo Jeon ◽  
Kyusam Oh ◽  
Soonhwan Kwon ◽  
HyeongGwan Son ◽  
Yongkeun Yun ◽  
...  
Keyword(s):  
Deep Learning ◽  
Graphics Processing Units ◽  
Model Complexity ◽  
Massachusetts Institute Of Technology ◽  
Baseline Model ◽  
Accurate Analysis ◽  
Central Processing ◽  
Beat Classification ◽  
Institute Of Technology ◽  
Graphics Processing

Background Electrocardiographic (ECG) monitors have been widely used for diagnosing cardiac arrhythmias for decades. However, accurate analysis of ECG signals is difficult and time-consuming work because large amounts of beats need to be inspected. In order to enhance ECG beat classification, machine learning and deep learning methods have been studied. However, existing studies have limitations in model rigidity, model complexity, and inference speed. Objective To classify ECG beats effectively and efficiently, we propose a baseline model with recurrent neural networks (RNNs). Furthermore, we also propose a lightweight model with fused RNN for speeding up the prediction time on central processing units (CPUs). Methods We used 48 ECGs from the MIT-BIH (Massachusetts Institute of Technology-Beth Israel Hospital) Arrhythmia Database, and 76 ECGs were collected with S-Patch devices developed by Samsung SDS. We developed both baseline and lightweight models on the MXNet framework. We trained both models on graphics processing units and measured both models’ inference times on CPUs. Results Our models achieved overall beat classification accuracies of 99.72% for the baseline model with RNN and 99.80% for the lightweight model with fused RNN. Moreover, our lightweight model reduced the inference time on CPUs without any loss of accuracy. The inference time for the lightweight model for 24-hour ECGs was 3 minutes, which is 5 times faster than the baseline model. Conclusions Both our baseline and lightweight models achieved cardiologist-level accuracies. Furthermore, our lightweight model is competitive on CPU-based wearable hardware.

scholarly journals Real-Time Speech-To-Text / Text-To-Speech Converter With Automatic Text Summarizer using Natural Language Generation And Abstract Meaning Representation

2020 ◽  
Vol 9 (4) ◽  
pp. 2361-2365
Keyword(s):  
Natural Language ◽  
Real Time ◽  
Graphics Processing Units ◽  
Processing Unit ◽  
Conference Calls ◽  
Baseline Model ◽  
Central Processing ◽  
Proposed Model ◽  
Graphics Processing ◽  
Meaning Representation

Due to extensive needs for growth in various sectors, which include software, telecom, healthcare, defence, etc., there is a necessary increase in the number as well as the duration of meetings, conference calls, reconnaissance stakeouts, financial reviews. The obtained reports of these play a significant role in defining the plan of actions. The proposed model is to convert real-time speech to corresponding text and then to its respective summary using Natural Language Grammar (NLG) and Abstract Meaning Representation (AMR) graphs and then again turned back the obtained summary to speech. The proposed model intends to achieve the task using two major algorithms, 1) Deep Speech 2, 2) AMR graphs. The speech-recognition model recommended has a speedup of 4x if the algorithm runs on a Central Processing Unit (CPU), and the use of particular Graphics Processing Units (GPUs) for running deep learning algorithms can give a speedup of 21x. The performance of the summarizer used is close to the Lead-3-AMR-Baseline model, which is a solid baseline for the CNN/Dailymail dataset. The summarizer we use scores ROGUE score close to the Lead-3- AMR-Baseline model with an accuracy of 99.37%.

Heterogenous Computing on Iris Matching with OpenCL

2016 ◽  
Vol 850 ◽  
pp. 129-135
Author(s):  
Buğra Şimşek ◽  
Nursel Akçam
Keyword(s):  
Graphics Processing Units ◽  
Iris Recognition ◽  
Heterogeneous Computing ◽  
Hamming Distance ◽  
Heterogeneous Systems ◽  
Digital Signal ◽  
Mobile Platforms ◽  
Central Processing ◽  
Field Programmable ◽  
Graphics Processing

This study presents parallelization of Hamming Distance algorithm, which is used for iris comparison on iris recognition systems, for heterogeneous systems that can be included Central Processing Units (CPUs), Graphics Processing Units (GPUs), Digital Signal Processing (DSP) boards, Field Programmable Gate Array (FPGA) and some other mobile platforms with OpenCL. OpenCL allows to run same code on CPUs, GPUs, FPGAs and DSP boards. Heterogeneous computing refers to systems include different kind of devices (CPUs, GPUs, FPGAs and other accelerators). Heterogeneous computing gains performance or reduces power for suitable algorithms on these OpenCL supported devices. In this study, Hamming Distance algorithm has been coded with C++ as a sequential code and has been parallelized a designated method by us with OpenCL. Our OpenCL code has been executed on Nvidia GT430 GPU and Intel Xeon 5650 processor. The OpenCL code implementation demonstrates that speed up to 87 times with parallelization. Also our study differs from other studies, which accelerate iris matching, with regard to ensure heterogeneous computing by using OpenCL.

scholarly journals The Effectiveness of Using a Pretrained Deep Learning Neural Networks for Object Classification in Underwater Video

2020 ◽  
Vol 12 (18) ◽  
pp. 3020
Author(s):  
Piotr Szymak ◽  
Paweł Piskur ◽  
Krzysztof Naus
Keyword(s):  
Deep Learning ◽  
World War Ii ◽  
Graphics Processing Units ◽  
Object Classification ◽  
Underwater Vehicles ◽  
Training Methods ◽  
Underwater Video ◽  
Deep Learning Neural Network ◽  
Graphics Processing

Video image processing and object classification using a Deep Learning Neural Network (DLNN) can significantly increase the autonomy of underwater vehicles. This paper describes the results of a project focused on using DLNN for Object Classification in Underwater Video (OCUV) implemented in a Biomimetic Underwater Vehicle (BUV). The BUV is intended to be used to detect underwater mines, explore shipwrecks or observe the process of corrosion of munitions abandoned on the seabed after World War II. Here, the pretrained DLNNs were used for classification of the following type of objects: fishes, underwater vehicles, divers and obstacles. The results of our research enabled us to estimate the effectiveness of using pretrained DLNNs for classification of different objects under the complex Baltic Sea environment. The Genetic Algorithm (GA) was used to establish tuning parameters of the DLNNs. Three different training methods were compared for AlexNet, then one training method was chosen for fifteen networks and the tests were provided with the description of the final results. The DLNNs were trained on servers with six medium class Graphics Processing Units (GPUs). Finally, the trained DLNN was implemented in the Nvidia JetsonTX2 platform installed on board of the BUV, and one of the network was verified in a real environment.

scholarly journals The VOLNA-OP2 tsunami code (version 1.5)

2018 ◽  
Vol 11 (11) ◽  
pp. 4621-4635 ◽  
Author(s):  
Istvan Z. Reguly ◽  
Daniel Giles ◽  
Devaraj Gopinathan ◽  
Laure Quivy ◽  
Joakim H. Beck ◽  
...  
Keyword(s):  
Graphics Processing Units ◽  
High Performance ◽  
Shallow Water Equation ◽  
Xeon Phi ◽  
Intel Xeon Phi ◽  
Central Processing ◽  
Domain Specific ◽  
Computing Platforms ◽  
Graphics Processing ◽  
Intel Xeon

Abstract. In this paper, we present the VOLNA-OP2 tsunami model and implementation; a finite-volume non-linear shallow-water equation (NSWE) solver built on the OP2 domain-specific language (DSL) for unstructured mesh computations. VOLNA-OP2 is unique among tsunami solvers in its support for several high-performance computing platforms: central processing units (CPUs), the Intel Xeon Phi, and graphics processing units (GPUs). This is achieved in a way that the scientific code is kept separate from various parallel implementations, enabling easy maintainability. It has already been used in production for several years; here we discuss how it can be integrated into various workflows, such as a statistical emulator. The scalability of the code is demonstrated on three supercomputers, built with classical Xeon CPUs, the Intel Xeon Phi, and NVIDIA P100 GPUs. VOLNA-OP2 shows an ability to deliver productivity as well as performance and portability to its users across a number of platforms.

ELECTROCARDIOGRAM BEAT CLASSIFICATION USING S-TRANSFORM BASED FEATURE SET

2014 ◽  
Vol 14 (05) ◽  
pp. 1450066 ◽  
Author(s):  
MANAB KUMAR DAS ◽  
SAMIT ARI
Keyword(s):  
Feature Extraction ◽  
Support Vector ◽  
Svm Classifier ◽  
Massachusetts Institute Of Technology ◽  
Ecg Signals ◽  
Beat Classification ◽  
Temporal Features ◽  
S Transform ◽  
Institute Of Technology ◽  
Stockwell Transform

In this paper, the conventional Stockwell transform is effectively used to classify the ECG arrhythmias. The performance of ECG classification mainly depends on feature extraction based on an efficient formation of morphological and temporal features and the design of the classifier. Feature extraction is the important component of designing the system based on pattern recognition since even the best classifier will not perform better if the good features are not selected properly. Here, the S-transform (ST) is used to extract the morphological features which is appended with temporal features. This feature set is independently classified using artificial neural network (NN) and support vector machine (SVM). In this work, five classes of ECG beats (normal, ventricular, supra ventricular, fusion and unknown beats) from Massachusetts Institute of Technology-Beth Israel Hospital (MIT-BIH) arrhythmia database are classified according to AAMI EC57 1998 standard (Association for the Advancement of Medical Instrumentation). Performance is evaluated on several normal and abnormal ECG signals of MIT-BIH arrhythmias database using two classifier techniques: ST with NN classifier (ST-NN) and other proposed ST with SVM classifier (ST-SVM). The proposed method achieves accuracy of 98.47%. The performance of the proposed technique is compared with ST-NN and earlier reported technique.

TOWARDS FFT-BASED DIRECT NUMERICAL SIMULATIONS OF TURBULENT FLOWS ON A GPU

2013 ◽  
Vol 05 (01) ◽  
pp. 1350014 ◽  
Author(s):  
CATHERINE RUCKI ◽  
ABHILASH J. CHANDY
Keyword(s):  
Turbulent Flows ◽  
Graphics Processing Units ◽  
Turbulence Models ◽  
Science And Engineering ◽  
Computing Power ◽  
Central Processing ◽  
General Improvement ◽  
Highly Turbulent Flows ◽  
Graphics Processing ◽  
Pseudo Spectral

The accurate simulation of turbulence and the implementation of corresponding turbulence models are both critical to the understanding of the complex physics behind turbulent flows in a variety of science and engineering applications. Despite the tremendous increase in the computing power of central processing units (CPUs), direct numerical simulation of highly turbulent flows is still not feasible due to the need for resolving the smallest length scale, and today's CPUs cannot keep pace with demand. The recent development of graphics processing units (GPU) has led to the general improvement in the performance of various algorithms. This study investigates the applicability of GPU technology in the context of fast-Fourier transform (FFT)-based pseudo-spectral methods for DNS of turbulent flows for the Taylor–Green vortex problem. They are implemented on a single GPU and a speedup of unto 31x is obtained in comparison to a single CPU.

scholarly journals PI-FLAME: A parallel immune system simulator using the FLAME graphic processing unit environment

SIMULATION ◽  
2016 ◽  
Vol 93 (1) ◽  
pp. 69-84 ◽  
Author(s):  
Shailesh Tamrakar ◽  
Paul Richmond ◽  
Roshan M D’Souza
Keyword(s):  
Immune System ◽  
Graphics Processing Units ◽  
Processing Unit ◽  
Human Immune System ◽  
Innate And Adaptive Immunity ◽  
Agent Based ◽  
Central Processing ◽  
Agent Simulation ◽  
Study Population ◽  
Graphics Processing

Agent-based models (ABMs) are increasingly being used to study population dynamics in complex systems, such as the human immune system. Previously, Folcik et al. (The basic immune simulator: an agent-based model to study the interactions between innate and adaptive immunity. Theor Biol Med Model 2007; 4: 39) developed a Basic Immune Simulator (BIS) and implemented it using the Recursive Porous Agent Simulation Toolkit (RePast) ABM simulation framework. However, frameworks such as RePast are designed to execute serially on central processing units and therefore cannot efficiently handle large model sizes. In this paper, we report on our implementation of the BIS using FLAME GPU, a parallel computing ABM simulator designed to execute on graphics processing units. To benchmark our implementation, we simulate the response of the immune system to a viral infection of generic tissue cells. We compared our results with those obtained from the original RePast implementation for statistical accuracy. We observe that our implementation has a 13× performance advantage over the original RePast implementation.

An Accelerated 3D Navier–Stokes Solver for Flows in Turbomachines

2010 ◽  
Vol 133 (2) ◽  
Author(s):  
Tobias Brandvik ◽  
Graham Pullan
Keyword(s):  
Graphics Processing Units ◽  
Three Dimensional ◽  
Navier Stokes ◽  
Linear Scaling ◽  
Test Case ◽  
Processing Unit ◽  
Central Processing ◽  
Order Of Magnitude ◽  
Graphics Processing ◽  
Good Agreement

A new three-dimensional Navier–Stokes solver for flows in turbomachines has been developed. The new solver is based on the latest version of the Denton codes but has been implemented to run on graphics processing units (GPUs) instead of the traditional central processing unit. The change in processor enables an order-of-magnitude reduction in run-time due to the higher performance of the GPU. The scaling results for a 16 node GPU cluster are also presented, showing almost linear scaling for typical turbomachinery cases. For validation purposes, a test case consisting of a three-stage turbine with complete hub and casing leakage paths is described. Good agreement is obtained with previously published experimental results. The simulation runs in less than 10 min on a cluster with four GPUs.

scholarly journals Controllers: An abstraction to ease the use of hardware accelerators

2017 ◽  
Vol 32 (6) ◽  
pp. 838-853 ◽  
Author(s):  
Ana Moreton–Fernandez ◽  
Hector Ortega–Arranz ◽  
Arturo Gonzalez–Escribano
Keyword(s):  
Graphics Processing Units ◽  
High Performance ◽  
Abstract Entity ◽  
Hardware Accelerators ◽  
Processing Unit ◽  
Central Processing ◽  
Computing Platforms ◽  
Graphics Processing ◽  
Performance Computing ◽  
Selection Of

Nowadays the use of hardware accelerators, such as the graphics processing units or XeonPhi coprocessors, is key in solving computationally costly problems that require high performance computing. However, programming solutions for an efficient deployment for these kind of devices is a very complex task that relies on the manual management of memory transfers and configuration parameters. The programmer has to carry out a deep study of the particular data that needs to be computed at each moment, across different computing platforms, also considering architectural details. We introduce the controller concept as an abstract entity that allows the programmer to easily manage the communications and kernel launching details on hardware accelerators in a transparent way. This model also provides the possibility of defining and launching central processing unit kernels in multi-core processors with the same abstraction and methodology used for the accelerators. It internally combines different native programming models and technologies to exploit the potential of each kind of device. Additionally, the model also allows the programmer to simplify the proper selection of values for several configuration parameters that can be selected when a kernel is launched. This is done through a qualitative characterization process of the kernel code to be executed. Finally, we present the implementation of the controller model in a prototype library, together with its application in several case studies. Its use has led to reductions in the development and porting costs, with significantly low overheads in the execution times when compared to manually programmed and optimized solutions which directly use CUDA and OpenMP.

scholarly journals Graphics processing unit implementation of the F-statistic for continuous gravitational wave searches

2021 ◽  
Author(s):  
Liam Dunn ◽  
Patrick Clearwater ◽  
Andrew Melatos ◽  
Karl Wette
Keyword(s):  
Gravitational Wave ◽  
Graphics Processing Units ◽  
Graphics Processing Unit ◽  
Computational Cost ◽  
Processing Unit ◽  
Central Processing ◽  
Long Baseline ◽  
Using Data ◽  
Graphics Processing ◽  
Gpu Implementation

Abstract The F-statistic is a detection statistic used widely in searches for continuous gravitational waves with terrestrial, long-baseline interferometers. A new implementation of the F-statistic is presented which accelerates the existing "resampling" algorithm using graphics processing units (GPUs). The new implementation runs between 10 and 100 times faster than the existing implementation on central processing units without sacrificing numerical accuracy. The utility of the GPU implementation is demonstrated on a pilot narrowband search for four newly discovered millisecond pulsars in the globular cluster Omega Centauri using data from the second Laser Interferometer Gravitational-Wave Observatory observing run. The computational cost is 17:2 GPU-hours using the new implementation, compared to 1092 core-hours with the existing implementation.

Sign in / Sign up

Export Citation Format

Share Document