{"title":"应用于矢量量化器设计的竞争算法的计算复杂性","authors":"F. Madeiro, W. Lopes, B. G. A. Neto, M. Alencar","doi":"10.21528/LNLM-VOL2-NO1-ART4","DOIUrl":null,"url":null,"abstract":"In the present paper, the computational complexity of a competitive learning algorithm applied to vector quantization (VQ) codebook design is investigated. Analytical expressions (as a function of the codebook size, the dimension of the codevectors, the number of training vectors and the number of iterations performed) are derived for the number of operations (multiplications, divisions, additions, subtractions and comparisons) performed by the competitive algorithm. Analytical expressions are also derived for the tradional LBG (Linde-Buzo-Gray) algorithm. Regarding VQ codebook design for image coding, results show that the computational complexity of the competitive algorithm is lower than that of LBG.","PeriodicalId":386768,"journal":{"name":"Learning and Nonlinear Models","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Complexidade computacional de um algoritmo competitivo aplicado ao projeto de quantizadores vetoriais\",\"authors\":\"F. Madeiro, W. Lopes, B. G. A. Neto, M. Alencar\",\"doi\":\"10.21528/LNLM-VOL2-NO1-ART4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the present paper, the computational complexity of a competitive learning algorithm applied to vector quantization (VQ) codebook design is investigated. Analytical expressions (as a function of the codebook size, the dimension of the codevectors, the number of training vectors and the number of iterations performed) are derived for the number of operations (multiplications, divisions, additions, subtractions and comparisons) performed by the competitive algorithm. Analytical expressions are also derived for the tradional LBG (Linde-Buzo-Gray) algorithm. Regarding VQ codebook design for image coding, results show that the computational complexity of the competitive algorithm is lower than that of LBG.\",\"PeriodicalId\":386768,\"journal\":{\"name\":\"Learning and Nonlinear Models\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Learning and Nonlinear Models\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21528/LNLM-VOL2-NO1-ART4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Learning and Nonlinear Models","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21528/LNLM-VOL2-NO1-ART4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Complexidade computacional de um algoritmo competitivo aplicado ao projeto de quantizadores vetoriais
In the present paper, the computational complexity of a competitive learning algorithm applied to vector quantization (VQ) codebook design is investigated. Analytical expressions (as a function of the codebook size, the dimension of the codevectors, the number of training vectors and the number of iterations performed) are derived for the number of operations (multiplications, divisions, additions, subtractions and comparisons) performed by the competitive algorithm. Analytical expressions are also derived for the tradional LBG (Linde-Buzo-Gray) algorithm. Regarding VQ codebook design for image coding, results show that the computational complexity of the competitive algorithm is lower than that of LBG.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
