GPU Accelerated Greedy Algorithms for Compressed Sensing
Department of Mathematics and Statistics, Grinnell College, Grinnell, IA 50112
Univeristy of Edinburgh, 2012
@article{blanchard2012gpu,
title={GPU Accelerated Greedy Algorithms for Compressed Sensing},
author={Blanchard, J.D. and Tanner, J.},
year={2012}
}
For appropriate matrix ensembles, greedy algorithms have proven to be an efficient means of solving the combinatorial optimization problem associated with compressed sensing. This paper describes an implementation for graphics processing units (GPU) of hard thresholding, iterative hard thresholding, normalized iterative hard thresholding, hard thresholding pursuit, and a two stage thresholding algorithm based on compressive sampling matching pursuit and subspace pursuit. The GPU acceleration of the former bottleneck, namely the matrix-vector multiplications, transfers a significant portion of the computational burden to the identification of the support set. The software solves high dimensional problems in fractions of second which permits large-scale testing at dimensions currently unavailable in the literature. The GPU implementations exhibit up to 70x acceleration over standard MatLab central processing unit implementations using automatic multi-threading.
June 20, 2012 by hgpu
