2004

Learning Generative Visual Models From Few Training Examples: An Incremental Bayesian Approach Tested on 101 Object Categories

Li Fei Fei, Rob Fergus, Pietro Perona

citations

Cite Score

77

AI summary

This paper introduces an incremental Bayesian algorithm for learning generative visual models of object categories, outperforming batch Bayesian and maximum likelihood methods, and tested on a dataset of 101 object categories, making real-time learning feasible with few training examples.

Main Contributions

  • Proposes an incremental Bayesian algorithm for learning object categories from a limited number of training examples.
  • Tests the algorithm on a new, large dataset of 101 diverse object categories, significantly larger than typical datasets used at the time.
  • Compares the incremental Bayesian algorithm with batch Bayesian and maximum-likelihood methods, demonstrating comparable classification performance on small training sets but significantly faster learning.
  • Highlights the effectiveness of using prior information derived from previously learned (unrelated) object categories.
  • Emphasizes the potential for real-time learning and the ability to train complex models with a handful of images, achieving better than chance performance with minimal training data.

Abstract

Current computational approaches to learning visual object categories require thousands of training images, are slow, cannot learn in an incremental manner and cannot incorporate prior information into the learning process. In addition, no algorithm presented in the literature has been tested on more than a handful of object categories. We present an method for learning object categories from just a few training images. It is quick and it uses prior information in a principled way. We test it on a dataset composed of images of objects belonging to 101 widely varied categories. Our proposed method is based on making use of prior information, assembled from (unrelated) object categories which were previously learnt. A generative probabilistic model is used, which represents the shape and appearance of a constellation of features belonging to the object. The parameters of the model are learnt incrementally in a Bayesian manner. Our incremental algorithm is compared experimentally to an earlier batch Bayesian algorithm, as well as to one based on maximum-likelihood. The incremental and batch versions have comparable classification performance on small training sets, but incremental learning is significantly faster, making real-time learning feasible. Both Bayesian methods outperform maximum likelihood on small training sets.

Citation Graph

Loading graph...

References [18]

Sort:
Filter:

P. Viola, M. J. Jones - 2001

10 papers in library cite

D. G. Lowe - 1999

6 papers in library cite

Li Fei Fei, Rob Fergus, Pietro Perona - 2003

4 papers in library cite

Radford M. Neal, Geoffrey E. Hinton - 1998

4 papers in library cite

Rob Fergus, Pietro Perona, Andrew Zisserman - 2003

4 papers in library cite

Y. Amit, D. Geman - 1999

3 papers in library cite

Cordelia Schmid, R. Mohr - 1997

3 papers in library cite

I. Biederman - 1987

3 papers in library cite

T. Kadir, M. Brady - 2001

3 papers in library cite

M. Weber, M. Welling, Pietro Perona - 2000

3 papers in library cite

M. Burl, M. Weber, Pietro Perona - 1996

2 papers in library cite

H. Attias - 1999

2 papers in library cite

Missing author list

1994

2 papers in library cite

W. Penny - 2001

2 papers in library cite

H. Schneiderman, Takeo Kanade - 2000

1 paper in library cites

Michael I. Jordan, Zoubin Ghahramani, T. S. Jaakkola, L. K. Saul - 1999

1 paper in library cites

S. R. Waterhouse, D. J. C. Mackay, A. J. Robinson - 1996

1 paper in library cites

E. Miller, N. Matsakis, P. Viola - 2000

1 paper in library cites

Cited by

15

papers in your library

Cites

0

papers in your library

Read

on February 5, 2026

Your review

Tags

Paper Aliases

No aliases