DocumentCode
2617916
Title
Clustering and quantization of binary vectors with stochastic complexity
Author
Gyllenberg, Mats ; Koski, Timo ; Verlaan, Martin
Author_Institution
Dept. of Appl. Phys., Turku Univ., Finland
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
390
Abstract
Stochastic complexity (SC) is used for determining both the codebook and its size in a vector quantizer for binary strings given a training sequence
Keywords
codes; computational complexity; stochastic processes; vector quantisation; binary strings; binary vectors; clustering; codebook; quantization; stochastic complexity; training sequence; vector quantizer; Clustering algorithms; Distortion measurement; Entropy; Frequency; Nearest neighbor searches; Probability distribution; Quantization; Source coding; Stochastic processes; Taxonomy;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.394629
Filename
394629
Link To Document