Paper
27 April 2010 An evaluation of GPU acceleration for sparse reconstruction
Author Affiliations +
Abstract
Image processing applications typically parallelize well. This gives a developer interested in data throughput several different implementation options, including multiprocessor machines, general purpose computation on the graphics processor, and custom gate-array designs. Herein, we will investigate these first two options for dictionary learning and sparse reconstruction, specifically focusing on the K-SVD algorithm for dictionary learning and the Batch Orthogonal Matching Pursuit for sparse reconstruction. These methods have been shown to provide state of the art results for image denoising, classification, and object recognition. We'll explore the GPU implementation and show that GPUs are not significantly better or worse than CPUs for this application.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Thomas R. Braun "An evaluation of GPU acceleration for sparse reconstruction", Proc. SPIE 7697, Signal Processing, Sensor Fusion, and Target Recognition XIX, 769715 (27 April 2010); https://doi.org/10.1117/12.849536
Lens.org Logo
CITATIONS
Cited by 9 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Associative arrays

Chemical species

Wavelets

Denoising

Reconstruction algorithms

Clocks

Image processing

Back to Top