MDL principle for robust vector quantisation

DOI10.1007/S100440050015MaRDI QIDQ1294723zbMATH OpenOpenAlexFDO

Authors Horst Bischof, Aleš Leonardis, Alexander Selb

Publication date 29 November 1999

Published in PAA. Pattern Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s100440050015

zbMATH Keywords

clusteringminimum description length

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• Vector quantization by deterministic annealing
• Applying MDL to learn best model granularity
• Model selection based on minimum description length
• Model Selection and the Principle of Minimum Description Length

Cited in

(4)

• MDL Denoising Revisited
• Approximation of the Two-Part MDL Code
• On the MDL principle for i.i.d. sources with large alphabets
• Robust growing neural gas algorithm with application in cluster analysis

This page was built for publication: MDL principle for robust vector quantisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294723)