scholarly journals Multi-Atlas-based Segmentation with Hierarchical Max-Flow

2013 ◽  
Author(s):  
Martin Rajchl ◽  
John S. H. Baxter ◽  
Jing Yuan ◽  
Terry M. Peters ◽  
Ali Khan
Keyword(s):  
Graphics Processing Units ◽  
Convex Relaxation ◽  
Brain Structures ◽  
General Purpose ◽  
Mr Images ◽  
Tissue Segmentation ◽  
Training Images ◽  
Graphics Processing ◽  
Computation Speed ◽  
Ordering Constraint

This study investigates a method for brain tissue segmentation from 3D T1 weighted (T1w) MR images via convex relaxation with a hierarchical ordering constraint. It employs a multi-atlas-based initialization from 5 training images and is tested on 12 T1w MR images provided by the MICCAI 2013 MRBrainS segmentation challenge. The registered atlas images, fully segmented into eight different brain structures, are used to formulate shape and intensity priors for a Maximum A-Posteriori (MAP) energy that is subsequently minimized with a dual hierarchical max-flow computation. The algorithm makes use of a hierarchical label ordering constraint to regularize label families individually and its inherently globally optimal results guarantee robust segmentations. Major parts of the image processing pipeline are implemented using General-Purpose Programming on Graphics Processing Units (GPGPU) for a substantial increase in computation speed.

scholarly journals DSPSR: Digital Signal Processing Software for Pulsar Astronomy

2011 ◽  
Vol 28 (1) ◽  
pp. 1-14 ◽  
Author(s):  
W. van Straten ◽  
M. Bailes
Keyword(s):  
Signal Processing ◽  
Digital Signal Processing ◽  
Graphics Processing Units ◽  
High Performance ◽  
Digital Signal ◽  
General Purpose ◽  
Design Decisions ◽  
Extensive Range ◽  
Processing Software ◽  
Graphics Processing

Abstractdspsr is a high-performance, open-source, object-oriented, digital signal processing software library and application suite for use in radio pulsar astronomy. Written primarily in C++, the library implements an extensive range of modular algorithms that can optionally exploit both multiple-core processors and general-purpose graphics processing units. After over a decade of research and development, dspsr is now stable and in widespread use in the community. This paper presents a detailed description of its functionality, justification of major design decisions, analysis of phase-coherent dispersion removal algorithms, and demonstration of performance on some contemporary microprocessor architectures.

scholarly journals Automated Head Tissue Modelling Based on Structural Magnetic Resonance Images for Electroencephalographic Source Reconstruction

2021 ◽  
Author(s):  
Gaia Amaranta Taberna ◽  
Jessica Samogin ◽  
Dante Mantini
Keyword(s):  
Magnetic Resonance ◽  
Brain Structures ◽  
Magnetic Resonance Images ◽  
Head Model ◽  
Source Reconstruction ◽  
Mr Images ◽  
Tissue Segmentation ◽  
Mr Image ◽  
Eeg Recordings ◽  
Tissue Modelling

AbstractIn the last years, technological advancements for the analysis of electroencephalography (EEG) recordings have permitted to investigate neural activity and connectivity in the human brain with unprecedented precision and reliability. A crucial element for accurate EEG source reconstruction is the construction of a realistic head model, incorporating information on electrode positions and head tissue distribution. In this paper, we introduce MR-TIM, a toolbox for head tissue modelling from structural magnetic resonance (MR) images. The toolbox consists of three modules: 1) image pre-processing – the raw MR image is denoised and prepared for further analyses; 2) tissue probability mapping – template tissue probability maps (TPMs) in individual space are generated from the MR image; 3) tissue segmentation – information from all the TPMs is integrated such that each voxel in the MR image is assigned to a specific tissue. MR-TIM generates highly realistic 3D masks, five of which are associated with brain structures (brain and cerebellar grey matter, brain and cerebellar white matter, and brainstem) and the remaining seven with other head tissues (cerebrospinal fluid, spongy and compact bones, eyes, muscle, fat and skin). Our validation, conducted on MR images collected in healthy volunteers and patients as well as an MR template image from an open-source repository, demonstrates that MR-TIM is more accurate than alternative approaches for whole-head tissue segmentation. We hope that MR-TIM, by yielding an increased precision in head modelling, will contribute to a more widespread use of EEG as a brain imaging technique.

scholarly journals A Representation of Membrane Computing with a Clustering Algorithm on the Graphical Processing Unit

Processes ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1199
Author(s):  
Ravie Chandren Muniyandi ◽  
Ali Maroosi
Keyword(s):  
Graphics Processing Units ◽  
Clustering Algorithm ◽  
Hamiltonian Path ◽  
Fold Increase ◽  
General Purpose ◽  
Processing Unit ◽  
Thread Block ◽  
Hard Problems ◽  
Graphical Processing ◽  
Graphics Processing

Long-timescale simulations of biological processes such as photosynthesis or attempts to solve NP-hard problems such as traveling salesman, knapsack, Hamiltonian path, and satisfiability using membrane systems without appropriate parallelization can take hours or days. Graphics processing units (GPU) deliver an immensely parallel mechanism to compute general-purpose computations. Previous studies mapped one membrane to one thread block on GPU. This is disadvantageous given that when the quantity of objects for each membrane is small, the quantity of active thread will also be small, thereby decreasing performance. While each membrane is designated to one thread block, the communication between thread blocks is needed for executing the communication between membranes. Communication between thread blocks is a time-consuming process. Previous approaches have also not addressed the issue of GPU occupancy. This study presents a classification algorithm to manage dependent objects and membranes based on the communication rate associated with the defined weighted network and assign them to sub-matrices. Thus, dependent objects and membranes are allocated to the same threads and thread blocks, thereby decreasing communication between threads and thread blocks and allowing GPUs to maintain the highest occupancy possible. The experimental results indicate that for 48 objects per membrane, the algorithm facilitates a 93-fold increase in processing speed compared to a 1.6-fold increase with previous algorithms.

Accelerating in-memory transaction processing using general purpose graphics processing units

2019 ◽  
Vol 97 ◽  
pp. 836-848
Author(s):  
Lan Gao ◽  
Yunlong Xu ◽  
Rui Wang ◽  
Hailong Yang ◽  
Zhongzhi Luan ◽  
...  
Keyword(s):  
Graphics Processing Units ◽  
Transaction Processing ◽  
General Purpose ◽  
Graphics Processing

scholarly journals Accelerated FDPS: Algorithms to use accelerators with FDPS

2020 ◽  
Vol 72 (1) ◽  
Author(s):  
Masaki Iwasawa ◽  
Daisuke Namekata ◽  
Keigo Nitadori ◽  
Kentaro Nomura ◽  
Long Wang ◽  
...  
Keyword(s):  
Graphics Processing Units ◽  
High Performance ◽  
General Purpose ◽  
Performance Model ◽  
Performance Tuning ◽  
Data Types ◽  
Interaction Function ◽  
Current Implementation ◽  
And Performance ◽  
Graphics Processing

Abstract We describe algorithms implemented in FDPS (Framework for Developing Particle Simulators) to make efficient use of accelerator hardware such as GPGPUs (general-purpose computing on graphics processing units). We have developed FDPS to make it possible for researchers to develop their own high-performance parallel particle-based simulation programs without spending large amounts of time on parallelization and performance tuning. FDPS provides a high-performance implementation of parallel algorithms for particle-based simulations in a “generic” form, so that researchers can define their own particle data structure and interparticle interaction functions. FDPS compiled with user-supplied data types and interaction functions provides all the necessary functions for parallelization, and researchers can thus write their programs as though they are writing simple non-parallel code. It has previously been possible to use accelerators with FDPS by writing an interaction function that uses the accelerator. However, the efficiency was limited by the latency and bandwidth of communication between the CPU and the accelerator, and also by the mismatch between the available degree of parallelism of the interaction function and that of the hardware parallelism. We have modified the interface of the user-provided interaction functions so that accelerators are more efficiently used. We also implemented new techniques which reduce the amount of work on the CPU side and the amount of communication between CPU and accelerators. We have measured the performance of N-body simulations on a system with an NVIDIA Volta GPGPU using FDPS and the achieved performance is around 27% of the theoretical peak limit. We have constructed a detailed performance model, and found that the current implementation can achieve good performance on systems with much smaller memory and communication bandwidth. Thus, our implementation will be applicable to future generations of accelerator system.

scholarly journals Special issue on evolutionary computation on general purpose graphics processing units

2011 ◽  
Vol 16 (2) ◽  
pp. 185-186 ◽  
Author(s):  
José L. Risco-Martín ◽  
Juan Lanchares ◽  
Carlos A. Coello-Coello
Keyword(s):  
Evolutionary Computation ◽  
Graphics Processing Units ◽  
General Purpose ◽  
Special Issue ◽  
Graphics Processing
Sign in / Sign up

Export Citation Format

Share Document