pith. sign in

arxiv: 0910.4711 · v1 · submitted 2009-10-26 · 💻 cs.CV · cs.DC

Parallelization of the LBG Vector Quantization Algorithm for Shared Memory Systems

classification 💻 cs.CV cs.DC
keywords codebookalgorithmparalleldataquantizationvectorarbitrarybeen
0
0 comments X
read the original abstract

This paper proposes a parallel approach for the Vector Quantization (VQ) problem in image processing. VQ deals with codebook generation from the input training data set and replacement of any arbitrary data with the nearest codevector. Most of the efforts in VQ have been directed towards designing parallel search algorithms for the codebook, and little has hitherto been done in evolving a parallelized procedure to obtain an optimum codebook. This parallel algorithm addresses the problem of designing an optimum codebook using the traditional LBG type of vector quantization algorithm for shared memory systems and for the efficient usage of parallel processors. Using the codebook formed from a training set, any arbitrary input data is replaced with the nearest codevector from the codebook. The effectiveness of the proposed algorithm is indicated.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.