Skip to main content
SpringerLink
Log in

Minimum description length principle in the field of image analysis and pattern recognition

  • Plenary Papers
  • Published:
Pattern Recognition and Image Analysis Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. T. Lee, “A Minimum Description Length Based Image Segmentation Procedure, and Its Comparison with a Cross-Validation Based Segmentation Procedure,” J. Am. Stat. Assoc. 95, 259–270 (2000).

    Article  MATH  Google Scholar 

  2. M. Li and P. Vitanyi, “Philosophical Issue in Kolmogorov Complexity,” in Proc. ICALP’92 (Vienna, 1992), pp. 1–15.

  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 

  4. A. S. Potapov, I. A. Malyshev, A. E. Puysha, and A. N. Averkin, “New Paradigm of Learnable Computer Vision Algorithms Based on the Rsepresentational MDL Principle,” Proc. SPIE 7696, 769606 (2010).

    Article  Google Scholar 

  5. J. J. Rissanen, “Modeling by the Shortest Data Description,” Automat. J. IFAC 14, 465–471 (1978).

    Article  MATH  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.

  7. R. Solomonoff, Does Algorithmic Probability Solve the Problem of Induction? (Cambridge MA, 1997).

  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).

Download references

Author information

Authors and Affiliations

  1. Vavilov State Optical Institute, Birzhevaya line 12, St. Petersburg, 199034, Russia

    A. S. Potapov

Authors
  1. A. S. Potapov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. S. Potapov.

Additional information

This article was translated by the author.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Potapov, A.S. Minimum description length principle in the field of image analysis and pattern recognition. Pattern Recognit. Image Anal. 21, 156–159 (2011). https://doi.org/10.1134/S1054661811020908

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1054661811020908

Keywords

Search

Navigation