ScholarLens Back to search
2001•Systems engineering and electronicsRequires access

Efficient Algorithm for Reducing the Computation Redundancy of LBG Algorithm

Chao Pang

Open publisher page 0 citations

Abstract

A fast codebook generation algorithm named fast local clustering algorithm is presented in this paper by the equivalence of norm and the property that data cluster locally. The experiment by the typical test picture Lena and Barb shows that the algorithm is 3.74～9.59 times faster than LBG, and PSNR of it is only 0.25～0.43dB smaller than PSNR of LBG. It is the best algorithm among the six type algorithms introduced in this paper.

About this research paper

What this paper is about

A fast codebook generation algorithm named fast local clustering algorithm is presented in this paper by the equivalence of norm and the property that data cluster locally. The experiment by the typical test picture Lena and Barb shows that the algorithm is 3.74～9.59 times faster than LBG, and PSNR of it is only 0.25～0.43dB smaller than PSNR of LBG. It is the best algorithm among the six type algorithms introduced in this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A fast codebook generation algorithm named fast local clustering algorithm is presented in this paper by the equivalence of norm and the property that data cluster locally. The experiment by the typical test picture Lena and Barb shows that the algorithm is 3.74～9.59 times faster than LBG, and PSNR of it is only 0.25～0.43dB smaller than PSNR of LBG. It is the best algorithm among the six type algorithms introduced in this paper.

Key concepts: Algorithm, Codebook, Linde–Buzo–Gray algorithm, Computation, Cluster analysis, k-medoids, Redundancy (engineering), Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Efficient Algorithm for Reducing the Computation Redundancy of LBG Algorithm — Research Paper | ScholarLens