Abstract
We address the problem of finding the optimal number of reference vectors for vector quantisation from the point of view of the Minimum Description Length (MDL) principle. We formulate vector quantisation in terms of the MDL principle, and then derive different instantiations of the algorithm, depending on the coding procedure. Moreover, we develop an efficient algorithm (similar to EM-type algorithms) for optimising the MDL criterion. In addition, we use the MDL principle to increase the robustness of the training algorithm, namely, the MDL principle provides a criterion to decide which data points are outliers. We illustrate our approach on 2D clustering problems (in order to visualise the behaviour of the algorithm), and present applications on image coding. Finally, we outline various ways to extend the algorithm.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 11 November 1998¶Received in revised form: 15 January 1999¶Accepted: 15 January 1999
Rights and permissions
About this article
Cite this article
Bischof, H., Leonardis, A. & Selb, A. MDL Principle for Robust Vector Quantisation. Pattern Analysis & Applications 2, 59–72 (1999). https://doi.org/10.1007/s100440050015
Published:
Issue Date:
DOI: https://doi.org/10.1007/s100440050015