20,494 research outputs found
DPP-PMRF: Rethinking Optimization for a Probabilistic Graphical Model Using Data-Parallel Primitives
We present a new parallel algorithm for probabilistic graphical model
optimization. The algorithm relies on data-parallel primitives (DPPs), which
provide portable performance over hardware architecture. We evaluate results on
CPUs and GPUs for an image segmentation problem. Compared to a serial baseline,
we observe runtime speedups of up to 13X (CPU) and 44X (GPU). We also compare
our performance to a reference, OpenMP-based algorithm, and find speedups of up
to 7X (CPU).Comment: LDAV 2018, October 201
Performance Analysis of a Novel GPU Computation-to-core Mapping Scheme for Robust Facet Image Modeling
Though the GPGPU concept is well-known
in image processing, much more work remains to be done
to fully exploit GPUs as an alternative computation
engine. This paper investigates the computation-to-core
mapping strategies to probe the efficiency and scalability
of the robust facet image modeling algorithm on GPUs.
Our fine-grained computation-to-core mapping scheme
shows a significant performance gain over the standard
pixel-wise mapping scheme. With in-depth performance
comparisons across the two different mapping schemes,
we analyze the impact of the level of parallelism on
the GPU computation and suggest two principles for
optimizing future image processing applications on the
GPU platform
GPU-based ultra-fast direct aperture optimization for online adaptive radiation therapy
Online adaptive radiation therapy (ART) has great promise to significantly
reduce normal tissue toxicity and/or improve tumor control through real-time
treatment adaptations based on the current patient anatomy. However, the major
technical obstacle for clinical realization of online ART, namely the inability
to achieve real-time efficiency in treatment re-planning, has yet to be solved.
To overcome this challenge, this paper presents our work on the implementation
of an intensity modulated radiation therapy (IMRT) direct aperture optimization
(DAO) algorithm on graphics processing unit (GPU) based on our previous work on
CPU. We formulate the DAO problem as a large-scale convex programming problem,
and use an exact method called column generation approach to deal with its
extremely large dimensionality on GPU. Five 9-field prostate and five 5-field
head-and-neck IMRT clinical cases with 5\times5 mm2 beamlet size and
2.5\times2.5\times2.5 mm3 voxel size were used to evaluate our algorithm on
GPU. It takes only 0.7~2.5 seconds for our implementation to generate optimal
treatment plans using 50 MLC apertures on an NVIDIA Tesla C1060 GPU card. Our
work has therefore solved a major problem in developing ultra-fast
(re-)planning technologies for online ART
Steklov Spectral Geometry for Extrinsic Shape Analysis
We propose using the Dirichlet-to-Neumann operator as an extrinsic
alternative to the Laplacian for spectral geometry processing and shape
analysis. Intrinsic approaches, usually based on the Laplace-Beltrami operator,
cannot capture the spatial embedding of a shape up to rigid motion, and many
previous extrinsic methods lack theoretical justification. Instead, we consider
the Steklov eigenvalue problem, computing the spectrum of the
Dirichlet-to-Neumann operator of a surface bounding a volume. A remarkable
property of this operator is that it completely encodes volumetric geometry. We
use the boundary element method (BEM) to discretize the operator, accelerated
by hierarchical numerical schemes and preconditioning; this pipeline allows us
to solve eigenvalue and linear problems on large-scale meshes despite the
density of the Dirichlet-to-Neumann discretization. We further demonstrate that
our operators naturally fit into existing frameworks for geometry processing,
making a shift from intrinsic to extrinsic geometry as simple as substituting
the Laplace-Beltrami operator with the Dirichlet-to-Neumann operator.Comment: Additional experiments adde
- …