Visual Learning Given Sparse Data of Unknown Complexity

Authors:
Tao Xiang;Shaogang Gong
Affiliations:
University of London;University of London
Venue:
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Year:
2005

Citing 0
Cited 3

A general method for human activity recognition in video

Computer Vision and Image Understanding - Special issue on modeling people: Vision-based understanding of a person's shape, appearance, movement, and behaviour
Optimising dynamic graphical models for video content analysis

Computer Vision and Image Understanding
Learning a mixture model for clustering with the completed likelihood minimum message length criterion

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

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