CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2009 vol.31 Issue No.07 - July
Issue No.07 - July (2009 vol.31)
Svetlana Lazebnik , University of North Carolina at Chapel Hill, Chapel Hill
Maxim Raginsky , Duke University, Durham
This paper proposes a technique for jointly quantizing continuous features and the posterior distributions of their class labels based on minimizing empirical information loss such that the quantizer index of a given feature vector approximates a sufficient statistic for its class label. Informally, the quantized representation retains as much information as possible for classifying the feature vector correctly. We derive an alternating minimization procedure for simultaneously learning codebooks in the euclidean feature space and in the simplex of posterior class distributions. The resulting quantizer can be used to encode unlabeled points outside the training set and to predict their posterior class distributions, and has an elegant interpretation in terms of lossless source coding. The proposed method is validated on synthetic and real data sets and is applied to two diverse problems: learning discriminative visual vocabularies for bag-of-features image classification and image segmentation.
Pattern recognition, information theory, quantization, clustering, computer vision, scene analysis, segmentation.
Svetlana Lazebnik, Maxim Raginsky, "Supervised Learning of Quantizer Codebooks by Information Loss Minimization", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.31, no. 7, pp. 1294-1309, July 2009, doi:10.1109/TPAMI.2008.138