New Clustering Algorithm for Vector Quantization using Rotation of Error Vector

Computer Science – Computer Vision and Pattern Recognition

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

IEEE Publication format, International Journal of Computer Science and Information Security, IJCSIS, Vol. 7 No. 3, March 2010,

Scientific paper

The paper presents new clustering algorithm. The proposed algorithm gives less distortion as compared to well known Linde Buzo Gray (LBG) algorithm and Kekre's Proportionate Error (KPE) Algorithm. Constant error is added every time to split the clusters in LBG, resulting in formation of cluster in one direction which is 1350 in 2-dimensional case. Because of this reason clustering is inefficient resulting in high MSE in LBG. To overcome this drawback of LBG proportionate error is added to change the cluster orientation in KPE. Though the cluster orientation in KPE is changed its variation is limited to +/- 450 over 1350. The proposed algorithm takes care of this problem by introducing new orientation every time to split the clusters. The proposed method reduces PSNR by 2db to 5db for codebook size 128 to 1024 with respect to LBG.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

New Clustering Algorithm for Vector Quantization using Rotation of Error Vector does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New Clustering Algorithm for Vector Quantization using Rotation of Error Vector, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Clustering Algorithm for Vector Quantization using Rotation of Error Vector will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-600224

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.