İlker KILIÇ, Yücel KOÇYİĞİT, Mustafa NİL

Görüntü Sıkıştırmada Kod Vektör Listesi Üretimi İçin Yeni Bir Bölme Tabanlı LBG Algoritması

Linde-Buzo-Gray (LBG) algoritması, görüntü sıkıştırmada Vektör Nicemleme (VN) tekniği için kullanılan,

Anahtar Kelimeler:

Bulanık C–ortalamalar, K-ortalamalar, LBG, vektör nicemleme

A New Spliting LBG Algorithm for Codebook Generation in Image Compression

Linde-Buzo-Gray (LBG) algorithm is used in image processing for Vector Quantization (VQ). LBGtechnique is robust, performs locally best but depends on the initial codebook. In the splitting based VQ, the firstcenter is defined as average of all vectors. The rest of 2n centres are calculated by splitting and updated procedure.In the proposed new technique (NLBG) the LBG is improved and insted of splitting all centres into two newareas, the worst area that has highest mean square error splitted and updated into to new areas. Therefore, thenumber of codevectors is increased one by one apart from the classical LBG. Consequently, the performance ofthe codebook is increased globally. In this paper, the new technique is applied to the standard images, comparedto the FCM(Fuzzy C-Means), K-Means (K – Ortalamalar) and LBG. As a result, it is seen that the proposed newtechnique performs better according to the criteria of MSE.

Keywords:

Fuzzy C-means, K-means, LBG, vector quantization,

PDF

___

Gray RM, 1984. Vector Quantization. IEEE ASSP Magazine, 1(2): 4-29.
Linde Y, Buzo A, Gray RM, 1980. An Algorithm for Vector Quantizer Design. IEEE Transactions on Communications, 28: 84-95.
Lin YC, Tai SC, 1998. A Fast Linde-Buzo-Gray Algorithm in Image Vector Quantization. IEEE Transactions on Circiuts and Systems-II : Analog and Digital Signal Processing, 45: 432-435.
Patane G, Russo M, 2001. The enhanced LBG algorithm. Neural Networks, 14: 1219 – 1237.
Tsai CW, Lee CY, Chiang MC, Yang CS, 2009. A fast VQ codebook generation algorithm via pattern reduction. Pattern Recognition Letters, 30: 653–660.
Pan ZB, Yu GH, Li Y, 2011. Improved fast LBG training algorithm in Hadamard domain. Electronics Letters, 47(8): 488-489.
Ku NY, Chang SC, Hwang SH, 2014. Binary search vector quantization. AASRI Procedia, 8: 112 – 117.
Khan MAU, Mousa WA, Khan TM, 2015. Entropy-constrained reflected residual vector quantization: A realization of large block vector quantization. Optik, 126: 888–897.
Dunn JC, 1973. A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters. Journal of Cybernetics, 3: 32-57.
Bezdek JC, Ehrlich R, Full W, 1984. FCM: The Fuzzy C-Means clustering algorithm. Computers & Geosciences, 10(2-3): 191-203.
Ya-zhong L, Gan H, Jin-ku GU, 2011. Improved FCM algorithm using difference of neighborhood information. Journal of Computer Applications, 31(2): 375-378.
Kang J, Min L, Luan Q, Li X, Liu J, 2009. Novel modified fuzzy c-means algorithm with applications. Digital Signal Processing, 19(2): 309-319.
Lloyd Stuart P, 1982. Least squares quantization in PCM. IEEE Transactions on Information Theory, 28 (2): 129–137.
Bagirov AM, Ugon J, Webb D, 2011. Fast modified global k-means algorithm for incremental cluster construction. Pattern Recognition 44(4): 866-876.
Bai L, Liang J, Sui C, Dang C, 2013. Fast global k-means clustering based on local geometrical information. Information Sciences, 245: 168–180.
Tzortzis G, Likas A, 2014. The MinMax k-Means clustering algorithm. Pattern Recognition, 47: 2505–2516.
Khah SS, Chouakria AD, Gaussier E, 2016. Generalize d k -means-base d clustering for temporal data under weighted and kernel time warp. Pattern Recognition Letters, 75: 63–69.