4362

Posts

Jun, 6

Fast Hardware-Accelerated Volume Rendering of CT Scans

As CT scanning is a very common medical imaging method, we propose new hardware-based algorithms using GPU (Graphical Processor Unit) programming for rapid visualization. Firstly, 3D volumes are constructed from CT scans. Then volume rendering is used to display anatomical structures via algorithms founded on improved ray casting and 2D textures. Our methods achieve interactive […]
Jun, 6

Illustrative Stream Surfaces

Stream surfaces are an intuitive approach to represent 3D vector fields. In many cases, however, they are challenging objects to visualize and to understand, due to a high degree of self-occlusion. Despite the need for adequate rendering methods, little work has been done so far in this important research area. In this paper, we present […]
Jun, 6

Massively Parallel Network Coding on GPUs

Network coding has recently been widely applied in various networks for system throughput improvement and/or resilience to network dynamics. However, the computational overhead introduced by the network coding operations is not negligible and has become the cornerstone for real deployment of network coding. In this paper, we exploit the computing power of contemporary Graphic Processing […]
Jun, 6

Real-time 3D surface modeling for image based relighting

This paper proposes to obtain 3D modeling of object surface and to create a relit image in real-time. The proposed algorithm uses a single camera and synchronized stereo lights to capture the light field images by turning on and off the lights alternatively. The light field images from the controlled lighting approximate the reflectance models […]
Jun, 6

Scene image classfying via the Partially Connected Neural Network

This paper presented a new method for scene images classification via Partially Connected Neural Network. The neural network has a mesh structure in which each neuron maintain a fixed number of connections with other neurons. In training, the evolutionary computation method was used to optimize the connection target neurons and its connection weights. The model […]
Jun, 6

Leveraging Computation Sharing and Parallel Processing in Location-Based Services

A variety of research exists for the processing of continuous queries in large, mobile environments. Each method tries, in its own way, to address the computational bottleneck of constantly processing so many queries. In this paper, we introduce an efficient and scalable system for monitoring continuous queries by leveraging the parallel processing capability of the […]
Jun, 6

An adaptive octree textures painting algorithm

Traditional texturing using a set of two dimensional image maps is an established and widespread practice. However, it is difficult to parameterize a model in texture space, particularly with representations such as implicit surfaces, subdivision surfaces, and very dense or detailed polygonal meshes. Based on an adaptive octree textures definition, this paper proposes a direct […]
Jun, 6

Accelerating biomedical signal processing algorithms with parallel programming on graphic processor units

This paper investigates the benefits derived by adopting the use of Graphics Processing Unit (GPU) parallel programming in the field of biomedical signal processing. The differences in execution time when computing the Correlation Dimension (CD) of multivariate neurophysiological recordings and the Skin Conductance Level (SCL) are reported by comparing several common programming environments. Moreover, as […]
Jun, 5

Exploiting Computing Power on Graphics Processing Unit

With recent technological advances, graphics processing units (GPUs) are providing increasingly higher performance with improvement programmability. This paper investigates NVIDIApsilas CUDA technology that enables data mining algorithm be parallelized effectively on GPU. The proposed algorithm exploits the computational power and the memory hierarchy of GPUs, using the shared memory to store frequently accessed data. Experimental […]
Jun, 5

Large neighborhood local search optimization on graphics processing units

Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as "walks through neighborhoods" where the walks are performed by iterative procedures that allow to move from a solution to another one in the solution space. In these heuristics, designing operators to […]
Jun, 5

Employ Bump Mapping to Enrich the 3D NPR Image

This paper presents a simple approach for adding more details to non-photorealistic image without increasing the complexity of the model. Bump mapping technique is introduced to create the details that can vary automatically with the change of light and view direction, but this technique originally aims to make a rendered surface look more realistic, so […]
Jun, 5

How to Render FDTD Computations More Effective Using a Graphics Accelerator

Graphics processing units (GPUs) for years have been dedicated mostly to real time rendering. Recently leading GPU manufactures have extended their research area and decided to support also graphics computing. In this paper, we describe an impact of new GPU features on development process of an efficient finite difference time domain (FDTD) implementation.

* * *

* * *

HGPU group © 2010-2024 hgpu.org

All rights belong to the respective authors

Contact us: