loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1
Visual Learning Given Sparse Data of Unknown Complexity
Beijing, China
October 17-October 20
ISBN: 0-7695-2334-X
Tao Xiang, University of London
Shaogang Gong, University of London
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].
Citation:
Tao Xiang, Shaogang Gong, "Visual Learning Given Sparse Data of Unknown Complexity," iccv, vol. 1, pp.701-708, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1, 2005
Usage of this product signifies your acceptance of the Terms of Use.