Get our free extension to see links to code for papers anywhere online!Free add-on: code for papers everywhere!Free add-on: See code for papers anywhere!

Add to Chrome

Add to Firefox

Add to Edge

Yujin Tu

Vector Quantization by Minimizing Kullback-Leibler Divergence

Jan 30, 2015
Lan Yang, Jingbin Wang, Yujin Tu, Prarthana Mahapatra, Nelson Cardoso

Figure 1 for Vector Quantization by Minimizing Kullback-Leibler Divergence

Figure 2 for Vector Quantization by Minimizing Kullback-Leibler Divergence

Figure 3 for Vector Quantization by Minimizing Kullback-Leibler Divergence

Figure 4 for Vector Quantization by Minimizing Kullback-Leibler Divergence

This paper proposes a new method for vector quantization by minimizing the Kullback-Leibler Divergence between the class label distributions over the quantization inputs, which are original vectors, and the output, which is the quantization subsets of the vector set. In this way, the vector quantization output can keep as much information of the class label as possible. An objective function is constructed and we also developed an iterative algorithm to minimize it. The new method is evaluated on bag-of-features based image classification problem.

Via

Access Paper or Ask Questions