high performance computing on graphics processing units: hgpu.org

We present an efficient algorithm for building an adaptive bounding volume hierarchy (BVH) in linear time on commodity graphics hardware using CUDA. BVHs are widely used as an acceleration data structure to quickly ray trace animated polygonal scenes. We accelerate the construction process with auxiliary grids that help us build high quality BVHs with SAH […]

The work presents a method for the high speed calculation of crude depth maps. Performance and applicability are illustrated for view interpolation based on two input video streams, but the algorithm is perfectly amenable to multicamera environments. First a fast plane sweep algorithm generates the crude depth map. Speed results from hardware accelerated transformations and […]

Repeat regions in DNA play very important roles in many vital biological functions. Repeats finding is always deemed as one of the most fundamental problems in genome sequencing and analysis, and exact repeats finding is the first step for many other repeats finding problems. This paper depicts the design and implementation issues of a fast […]

Pleasingly parallel algorithms such as filtered back-projection have been documented to enjoy significant speedups when ported to run on a graphics processor instead of a standard CPU. Presented here is a two-dimensional SAR backprojection implementation for a single GPU using the NVIDIA CUDA framework. Given that input range projections may be too large to fit […]

Katsevich reconstruction algorithm represents a breakthrough for helical cone-beam computed tomography (CT) reconstruction, because it is the first exact cone-beam reconstruction algorithm of filtered backprojection (FBP) type with 1-D shift-invariant filtering. Although FBP-type reconstruction algorithm is effective, 3-D CT reconstruction is time-consuming, and the accelerations of Katsevich algorithm on CPU or cluster have been widely […]

The value of Prognostics and Health Management (“PHM”) is best understood by looking at what happens when PHM is not utilized. In the growing field of PHM, the mistakes of others often provide us with valuable real world lessons that should fuel greater development, understanding and use of PHM. The science of PHM should play […]

Traditional pencil drawing methods have their own drawbacks, such as modeling complexity and higher time-consuming. Thus, they are difficult to be suitable for the real-time rendering. In this paper, we present a new pencil texture generating method based on the pencil filter. This approach can conveniently generate the pencil drawing effect by convoluting the input […]

String matching is one of the oldest and most pervasive problems in computer science. Nowadays applications related to string matching can be found everywhere. Meanwhile, the heterogeneous processing of CPU+GPU has become the popular parallel platform in solving high performance computing applications. This paper proposes a GPU-based multi-string matching algorithm, CUgrep, and uses this algorithm […]

Current GPUs perform a significant amount of redundant shading when surfaces are tessellated into small triangles. We address this inefficiency by augmenting the GPU pipeline to gather and merge rasterized fragments from adjacent triangles in a mesh. This approach has minimal impact on output image quality, is amenable to implementation in fixed-function hardware, and, when […]

BACKGROUND: With the exploding volume of data generated by continuously evolving high-throughput technologies, biological network analysis problems are growing larger in scale and craving for more computational power. General Purpose computation on Graphics Processing Units (GPGPU) provides a cost-effective technology for the study of large-scale biological networks. Designing algorithms that maximize data parallelism is the […]

High-performance feature tracking from video input is a valuable tool in many computer vision techniques and mixed reality applications. This work presents a refined and substantially accelerated approach to KLT feature tracking performed on the GPU. Additionally, a global gain ratio between successive frames is estimated to compensate for changes in the camera exposure. The […]

A feasible routine for complex fluid simulation is presented, consisting of the pre-processing and runtime stage. The pre-processing stage generates all computation-aided textures, which speeds up the simulating and rendering at run-time stage. We improve the unreasonable processing in most previous methods and give a correct discretized solution of Poisson equation. To improve the computational […]