Minimum description length principle in the field of image analysis and pattern recognition
- 68 Downloads
Problems of decision criterion in the tasks of image analysis and pattern recognition are considered. Overlearning as a practical consequence of fundamental paradoxes in inductive inference is illustrated with examples. Theoretical (on the base of algorithmic complexity) and practical formulations of the minimum description length (MDL) principle are given. Decrease of the overlearning effect is shown in the examples of modern recognition, grouping, and segmentation methods modified with the MDL principle. Novel possibilities of construction of learnable image analysis algorithms by representation optimization on the base of the MDL principle are described.
- 2.M. Li and P. Vitanyi, “Philosophical Issue in Kolmogorov Complexity,” in Proc. ICALP’92 (Vienna, 1992), pp. 1–15.Google Scholar
- 3.U. von Luxburg, O. Bousquet, and B. Schölkopf, “A Compression Approach to Support Vector Model Selection,” Mach. Learn. Res. 5, 293–323 (2004).Google Scholar
- 6.M. Sato, M. Kudo, J. Toyama, and M. Shimbo, “Construction of a Nonlinear Discrimination Function Based on the MDL Criterion,” in Proc. 1st Workshop on Stat. Techniques in Pattern Recognition (Prague, 1997), pp. 141–146.Google Scholar
- 7.R. Solomonoff, Does Algorithmic Probability Solve the Problem of Induction? (Cambridge MA, 1997).Google Scholar
- 8.H. Tenmoto, M. Kudo, and M. Shimbo, “MBL-Based Selection of the Number of Components in Mixture Models for Pattern Classification,” Adv. Pattern Recogn., No. 1451, 831–836 (1998).Google Scholar