New paradigm of learnable computer vision algorithms based on the representational MDL principle

被引:9
作者
Potapov, Alexey S. [1 ]
Malyshev, Igor A. [1 ]
Puysha, Alexander E. [1 ]
Averkin, Anton N. [2 ]
机构
[1] Vavilov State Opt Inst, St Petersburg, Russia
[2] Univ Informat Technol Mech & Opt, St Petersburg, Russia
来源
AUTOMATIC TARGET RECOGNITION XX; ACQUISITION, TRACKING, POINTING, AND LASER SYSTEMS TECHNOLOGIES XXIV; AND OPTICAL PATTERN RECOGNITION XXI | 2010年 / 7696卷
关键词
image; representation; learning; segmentation; feature; MDL; information-theoretic; FEATURES;
D O I
10.1117/12.849532
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
Learning is one of the most crucial components, which increases generality, flexibility, and robustness of computer vision systems. At present, image analysis algorithms adopt particular machine learning methods resulting in rather superficial learning. We present a new paradigm for constructing essentially learnable image analysis algorithms. Learning is interpreted as optimization of image representations. Notion of representation is formalized within information-theoretic framework. Optimization criterion is derived from well-known minimum description length (MDL) principle. Adaptation of the MDL principle in computer vision has been receiving increasing attention. However, this principle has been applied in heuristic way. We deduced representational MDL (RMDL) principle that fills the gap between theoretical MDL principle and its practical applications. The RMDL principle gives criteria both for optimal model selection of a single image within given representation, and for optimal representation selection for an image sample. Thus, it can be used for optimization of computer vision systems functioning within specific environment. Adequacy of the RMDL principle was validated on segmentation-based representations applied to different object domains. A method for learning local features as representation optimization was also developed. This method outperformed some popular methods with predefined representations such as SURF. Thus, the paradigm can be admitted as promising.
引用
收藏
页数:11
相关论文
共 12 条
  • [1] SURF: Speeded up robust features
    Bay, Herbert
    Tuytelaars, Tinne
    Van Gool, Luc
    [J]. COMPUTER VISION - ECCV 2006 , PT 1, PROCEEDINGS, 2006, 3951 : 404 - 417
  • [2] Hyvarinen A., 1999, Neural Computing Surveys, V2
  • [3] Ke Y, 2004, PROC CVPR IEEE, P506
  • [4] KOPPARAPU SK, 2001, SPRINGER INT SERIES, V616
  • [5] LI M, 1992, P ICALP92 IV LECT, P1
  • [6] Distinctive image features from scale-invariant keypoints
    Lowe, DG
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 2004, 60 (02) : 91 - 110
  • [7] Piater JH, 2000, LECT NOTES COMPUT SC, V1811, P52
  • [8] Image feature set for correspondence mappings
    Pineda-Torres, IH
    Gokcen, I
    Buckles, BP
    [J]. INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2002, 16 (03) : 273 - 283
  • [9] MODELING BY SHORTEST DATA DESCRIPTION
    RISSANEN, J
    [J]. AUTOMATICA, 1978, 14 (05) : 465 - 471
  • [10] SIM R, 2004, P IEEE RSJ C INT ROB, V4, P3481