Visual Learning Given Sparse Data of Unknown Complexity

This study addresses the problem of unsupervised visual learning. It examines existing popular model order selection criteria before proposes two novel criteria for improving visual learning given sparse data and without any knowledge about model complexity. In particular, a rectified Bayesian Information Criterion (BICr) and a Completed Likelihood Akaike’s Information Criterion (CL-AIC) are formulated to estimate the optimal model order (complexity) for learning the dynamic structure of a visual scene. Both criteria are designed to overcome poor model selection by existing popular criteria when the data sample size varies from very small to large. Extensive experiments on learning a dynamic scene structure are carried out to demonstrate the effectiveness of BICr and CL-AIC, compared to that of BIC [15], AIC [1], ICL [3] and a MML based criterion [7].

• Type: Conference
• Year: 2005
• Where: ICCV
• Authors: Tao Xiang, Shaogang Gong
• Keywords: Computer Vision, ICCV 2005, Model Order, Unsupervised Visual Learning, Visual Learning