GPU Parallel Implementation of the Approximate K-SVD Algorithm Using OpenCL

Paul Irofti, Bogdan Dumitrescu
Department of Automatic Control and Computers, University Politehnica of Bucharest, 313 Spl. Independentei, 060042 Bucharest, Romania
22nd European Signal Processing Conference, 2014


   title={GPU Parallel Implementation of the Approximate K-SVD Algorithm Using OpenCL},

   author={Irofti, Paul and Dumitrescu, Bogdan},



Download Download (PDF)   View View   Source Source   



Training dictionaries for sparse representations is a time consuming task, due to the large size of the data involved and to the complexity of the training algorithms. We investigate a parallel version of the approximate K-SVD algorithm, where multiple atoms are updated simultaneously, and implement it using OpenCL, for execution on graphics processing units (GPU). This not only allows reducing the execution time with respect to the standard sequential version, but also gives dictionaries with which the training data are better approximated. We present numerical evidence supporting this somewhat surprising conclusion and discuss in detail several implementation choices and difficulties.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: