Posts
Jul, 2
Compressed Facade Displacement Maps
We describe an approach to render massive urban models. To prevent a memory transfer bottleneck we propose to render the models from a compressed representation directly. Our solution is based on rendering crude building outlines as polygons and generating details by ray-tracing displacement maps in the fragment shader. We demonstrate how to compress a displacement […]
Jul, 2
Real-Time Reconstruction of Sensitivity Encoded Radial Magnetic Resonance Imaging Using a Graphics Processing Unit
A barrier to the adoption of non-Cartesian parallel magnetic resonance imaging for real-time applications has been the times required for the image reconstructions. These times have exceeded the underlying acquisition time thus preventing real-time display of the acquired images. We present a reconstruction algorithm for commodity graphics hardware (GPUs) to enable real time reconstruction of […]
Jul, 2
Parallelization of RSA Algorithm Based on Compute Unified Device Architecture
In the domain of computer security, how to enhance the speed of RSA algorithm has been the research hot spot. With the recent tremendous increase in Graphics Processing Unit’s computing capability as a co-processor of the CPU, Nvidia’s Compute Unified Device Architecture (CUDA) can greatly benefit single instruction multiple thread styled, computationally expensive programs. This […]
Jul, 2
Visualizing and Analyzing the Mona Lisa
As technologies for acquiring 3D data and algorithms for constructing integrated models evolve, very large data sets representing objects or environments are emerging in various application areas. As a result, significant research in computer graphics has aimed to interactively render such models on affordable commodity computers. Interest is growing in the possibility of integrating real-time […]
Jul, 1
Size-based Transfer Functions: A New Volume Exploration Technique
The visualization of complex 3D images remains a challenge, a fact that is magnified by the difficulty to classify or segment volume data. In this paper, we introduce size-based transfer functions, which map the local scale of features to color and opacity. Features in a data set with similar or identical scalar values can be […]
Jul, 1
Adaptive proxy geometry for direct volume manipulation
This paper introduces a new design to allow interactive, direct manipulation of volume data on volumetrically rendered images. We present an adaptive volume proxy mesh which serves not to define surfaces, but to encode the geometry and physical state of the volume. This system performs a modeling-free form of direct volume deformation by adaptively constructing […]
Jul, 1
Graphics processing unit accelerated non-uniform fast Fourier transform for ultrahigh-speed, real-time Fourier-domain OCT
We implemented fast Gaussian gridding (FGG)-based non-uniform fast Fourier transform (NUFFT) on the graphics processing unit (GPU) architecture for ultrahigh-speed, real-time Fourier-domain optical coherence tomography (FD-OCT). The Vandermonde matrix-based non-uniform discrete Fourier transform (NUDFT) as well as the linear/cubic interpolation with fast Fourier transform (InFFT) methods are also implemented on GPU to compare their performance […]
Jul, 1
Increasing Realism and Supporting Content Planning for Dynamic Scenes in a Mixed Reality System incorporating a Time-of-Flight Camera
Mixed reality is the combination of real and virtual scene content. Besides correct alignment of the two modalities and correct occlusion handling the core issues to be tackled are the degree of realism and the ease of use. For a convincing perception correct occlusion handling and shadowing is mandatory. We present a system for mixed […]
Jul, 1
GPU-assisted positive mean value coordinates for mesh deformations
In this paper we introduce positive mean value coordinates (PMVC) for mesh deformation. Following the observations of Joshi et al. [JMD*07] we show the advantage of having positive coordinates. The control points of the deformation are the vertices of a "cage" enclosing the deformed mesh. To define positive mean value coordinates for a given vertex, […]
Jul, 1
Graphics processing unit implementations of relative expression analysis algorithms enable dramatic computational speedup
SUMMARY: The top-scoring pair (TSP) and top-scoring triplet (TST) algorithms are powerful methods for classification from expression data, but analysis of all combinations across thousands of human transcriptome samples is computationally intensive, and has not yet been achieved for TST. Implementation of these algorithms for the graphics processing unit results in dramatic speedup of two […]
Jul, 1
CAMPAIGN: An open-source Library of GPU-accelerated Data Clustering Algorithms
MOTIVATION: Data clustering techniques are an essential component of a good data analysis toolbox. Many current bioinformatics applications are inherently compute-intense and work with very large data sets. Sequential algorithms are inadequate for providing the necessary performance. For this reason, we have created CAMPAIGN, a central resource for data clustering algorithms and tools that are […]
Jul, 1
Unified Parallel C for GPU Clusters: Language Extensions and Compiler Implementation
Unified Parallel C (UPC), a parallel extension to ANSI C, is designed for high performance computing on large-scale parallel machines. With General-purpose graphics processing units (GPUs) becoming an increasingly important high performance computing platform, we propose new language extensions to UPC to take advantage of GPU clusters. We extend UPC with hierarchical data distribution, revise […]
