OSA's Digital Library

Journal of Optical Technology

Journal of Optical Technology


  • Vol. 79, Iss. 11 — Nov. 1, 2012
  • pp: 689–692

Using multiple video-information representations in automatic image-analysis systems

A. S. Potapov  »View Author Affiliations

Journal of Optical Technology, Vol. 79, Issue 11, pp. 689-692 (2012)

View Full Text Article

Acrobat PDF (96 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



This paper analyzes the necessity of using many information representations simultaneously in image-processing and -analysis systems. The difference between Kolmogorov-complexity and algorithmic-probability criteria when solving induction problems and making decisions is investigated. It is shown that making the optimum decisions (for example, in recognition or prediction problems) requires the use of many representations of information, in terms of which alternative descriptions of the images are constructed. A representational algorithmic-probability criterion is derived for determining the optimum set of representations from a given selection of images.

© 2012 OSA

Original Manuscript: May 29, 2012
Published: November 30, 2012

A. S. Potapov, "Using multiple video-information representations in automatic image-analysis systems," J. Opt. Technol. 79, 689-692 (2012)

Sort:  Author  |  Year  |  Journal  |  Reset


  1. D. Marr, Vision: A Computational Investigation into the Human Representation and Processing of Visual Information (W. H. Freeman, San Francisco, 1982; Radio i Svyaz’, Moscow, 1987).
  2. A. S. Potapov, “Choosing image representations by minimizing their representational description length,” Izv. Vyssh. Uchebn. Zaved. Prib. 51, No. 7, 3 (2008).
  3. V. A. Kovalevski?, “Local versus global decisions in image recognition,” Proc. IEEE 67, 745 (1979). [CrossRef]
  4. R. J. Solomonoff, Does Algorithmic Probability Solve the Problem of Induction? (Oxbridge Research, Cambridge, Mass., 1997).
  5. R. J. Solomonoff, “Algorithmic probability, heuristic programming and AGI,” in Proceedings of the 3rd Conference on Artificial General Intelligence (AGI-2010), Lugano, Switzerland, March 5–8, 2010, pp. 151–157.
  6. J. Poland and M. Hutter, “MDL convergence speed for Bernoulli sequences,” Stat. Comp. 16, 161 (2006). [CrossRef]
  7. E. Bauer and R. Kohavi, “An empirical comparison of voting classification algorithms: bagging, boosting, and variants,” Mach. Learn. 36, 105 (1999). [CrossRef]
  8. A. S. Potapov, “Synthetic pattern-recognition methods based on the representational minimum description length principle,” in Proceedings OSAV’2008, The 2nd International Topical Meeting on Optical Sensing and Artificial Vision, St. Petersburg, Russia, 12–15 May, 2008, pp. 354–362.
  9. R. E. Schapire, Y. Freund, P. Bartlett, and W. S. Lee, “Boosting the margin: a new explanation for the effectiveness of voting methods,” Ann. Stat. 26, 1651 (1998). [CrossRef]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited