DocumentCode
861297
Title
Quantising for minimum information loss
Author
Spalvieri, Arnaldo
Author_Institution
Dipartimento di Elettronica e Inf., Politecnico di Milano
Volume
32
Issue
7
fYear
1996
fDate
3/28/1996 12:00:00 AM
Firstpage
628
Lastpage
629
Abstract
A random variable pair consisting of a continuous random vector (the observation or feature) vector and of a discrete random variable (the class) is considered. The authors report on the design of a machine able to accept as input the observation of, and present as output an approximation to, the conditional probability of the classes given the observation. More precisely. They deal with the design of a histogram-type approximation with variable cell size and shape. In this approach, the cells are the Voronoi regions of a nearest neighbour vector quantiser, and the position of code vectors (i.e. the size and the shape of the cells) is designed in such a way that the information loss caused by quantisation is minimised
Keywords
decoding; entropy; image coding; probability; vector quantisation; Voronoi regions; code vectors; continuous random vector; discrete random variable; histogram-type approximation; minimum information loss; nearest neighbour vector quantiser; quantisation; random variable pair;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19960450
Filename
491862
Link To Document