MDL principle for robust vector quantisation

DOI10.1007/S100440050015zbMATH Open0926.68151OpenAlexW2103229869MaRDI QIDQ1294723FDOQ1294723

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

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

zbMATH Keywords

clusteringminimum description length

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Cited In (4)

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

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)