Jong Kwan Lee, B.A. Wood, T.S. Newman
An approach to very rapid computation of one class of randomized Hough transform (RHT) using parallel processing capabilities of a programmable graphics processing unit is described. The method is able to detect ellipses in real-time, even in large images. It uses fragment processing in recovering ellipse shape parameters. Its effectiveness is evaluated through experiments on […]
View View   Download Download (PDF)   
Specifications GPU G71 FLOPS 384 GFLOPS Stream Processing Units 8/24 Core Clock 550 MHz Memory Clock 1400 MHz Effective Memory Clock 2800 Memory Type GDDR3 Amount of memory 256/512 MB Memory Bandwidth 44.8 GB/sec Buswidth 256 bit Tech process 90 nm Interface PCIe x16, AGP 8x PS/VS version 3.0/3.0 DirectX compliance 9.0c Retail Cards Based […]
Fabiano Romeiro, Luiz Velho, Luiz Henrique de Figueiredo
Existing methods that are able to interactively render complex CSG objects with the aid of GPUs are both image based and severely bandwidth limited. In this paper we present a new approach to this problem whose main advantage is its capability to efficiently scale the dependency on CPU instruction throughput, memory bandwidth and GPU instruction […]
View View   Download Download (PDF)   
Claude Kauffmann, Nicolas Piche
PURPOSE: We present a GPU-based framework to perform organ segmentation in N-dimensional (ND) medical image datasets by computation of weighted distances using the Ford-Bellman algorithm (FBA). Our GPU implementation of FBA gives an alternative and optimized solution to other graph-based segmentation techniques. METHODS: Given a number of K labelled-seeds, the segmentation algorithm evolves and segments […]
View View   Download Download (PDF)   
Jorik Blaas, Charl Botha, Frits Post
Parallel coordinate plots (PCPs) are commonly used in information visualization to provide insight into multi-variate data. These plots help to spot correlations between variables. PCPs have been successfullyapplied to unstructured datasets up to a few millions of points. In this paper, we present techniques to enhance the usability of PCPs forthe exploration of large, multi-timepoint […]
View View   Download Download (PDF)   
Ofir Weber, Yohai S. Devir, Alexander M. Bronstein, Michael M. Bronstein, Ron Kimmel
We present an efficient O( n ) numerical algorithm for first-order approximation of geodesic distances on geometry images, where n is the number of points on the surface. The structure of our algorithm allows efficient implementation on parallel architectures. Two implementations on a SIMD processor and on a GPU are discussed. Numerical results demonstrate up […]
View View   Download Download (PDF)   

* * *

* * *

Follow us on Twitter

HGPU group

1666 peoples are following HGPU @twitter

Like us on Facebook

HGPU group

339 people like HGPU on Facebook

* * *

Free GPU computing nodes at hgpu.org

Registered users can now run their OpenCL application at hgpu.org. We provide 1 minute of computer time per each run on two nodes with two AMD and one nVidia graphics processing units, correspondingly. There are no restrictions on the number of starts.

The platforms are

Node 1
  • GPU device 0: nVidia GeForce GTX 560 Ti 2GB, 822MHz
  • GPU device 1: AMD/ATI Radeon HD 6970 2GB, 880MHz
  • CPU: AMD Phenom II X6 @ 2.8GHz 1055T
  • RAM: 12GB
  • OS: OpenSUSE 13.1
  • SDK: nVidia CUDA Toolkit 6.5.14, AMD APP SDK 3.0
Node 2
  • GPU device 0: AMD/ATI Radeon HD 7970 3GB, 1000MHz
  • GPU device 1: AMD/ATI Radeon HD 5870 2GB, 850MHz
  • CPU: Intel Core i7-2600 @ 3.4GHz
  • RAM: 16GB
  • OS: OpenSUSE 12.3
  • SDK: AMD APP SDK 3.0

Completed OpenCL project should be uploaded via User dashboard (see instructions and example there), compilation and execution terminal output logs will be provided to the user.

The information send to hgpu.org will be treated according to our Privacy Policy

HGPU group © 2010-2015 hgpu.org

All rights belong to the respective authors

Contact us: