2007

Caltech-256 Object Category Dataset

Greg Griffin, Alex Holub, Pietro Perona

citations

Cite Score

64

AI summary

This paper introduces the Caltech-256 image dataset, a new benchmark for object recognition with 256 categories and 30,607 images, addressing limitations of previous datasets by increasing category count, minimum images per category, and introducing a clutter category for background rejection, demonstrating its challenge through spatial pyramid matching.

Main Contributions

  • Introduces Caltech-256, a new object category dataset with 256 categories and 30,607 images, significantly larger than Caltech-101.
  • Improves data collection by increasing minimum images per category to 80, avoiding image rotation artifacts, and adding a large clutter category for background rejection.
  • Proposes several testing paradigms to measure classification performance, including the use of a background clutter class.
  • Benchmarks the dataset using simple metrics (Size Classifier, Correlation Classifier) and a state-of-the-art Spatial Pyramid Matching algorithm, showing Caltech-256 is roughly half as challenging as Caltech-101 for the latter.
  • Demonstrates the use of the clutter category to train an interest detector for rejecting uninformative background regions.

Abstract

We introduce a challenging set of 256 object categories containing a total of 30607 images. The original Caltech-101 [1] was collected by choosing a set of object categories, downloading examples from Google Images and then manually screening out all images that did not fit the category. Caltech-256 is collected in a similar manner with several improvement: a) the number of categories is more than doubled, b) the minimum number of images in any category is increased from 31 to 80, c) artifacts due to image rotation are avoided and d) a new and larger clutter category is introduced for testing background rejection. We suggest several testing paradigms to measure classification performance, then benchmark the dataset using two simple metrics as well as a state-of-the-art spatial pyramid matching [2] algorithm. Finally we use the clutter category to train an interest detector which rejects uninformative background regions.

Citation Graph

Loading graph...

References [17]

Sort:
Filter:

Svetlana Lazebnik, Cordelia Schmid, Jean Ponce - 2006

14 papers in library cite

Li Fei Fei, Rob Fergus, Pietro Perona - 2004

15 papers in library cite

Bryan C. Russell, Antonio Torralba, Kevin P. Murphy, William T. Freeman - 2008

10 papers in library cite

Kristen Grauman, Trevor Darrell - 2005

4 papers in library cite

P. Viola, M. J. Jones - 2001

10 papers in library cite

D. Lowe - 2004

9 papers in library cite

A. C. Berg, T. L. Berg, Jitendra Malik - 2005

8 papers in library cite

Haowei Zhang, A. C. Berg, M. Maire, Jitendra Malik - 2006

6 papers in library cite

S. Nene, S. Nayar, H. Murase - 1996

4 papers in library cite

Antonio Torralba, Kevin P. Murphy, William T. Freeman - 2004

4 papers in library cite

J. Mutch, D. Lowe - 2006

3 papers in library cite

Mark Everingham, Andrew Zisserman, Christopher K. I. Williams, Luc Van Gool - 2006

3 papers in library cite

Alex Holub, M. Welling, Pietro Perona - 2005

2 papers in library cite

Rob Fergus - 2005

2 papers in library cite

S. Shore - 2005

1 paper in library cites

A. Opelt, A. Pinz - 2005

1 paper in library cites

S. Shore - 2004

1 paper in library cites

Cited by

9

papers in your library

Cites

4

papers in your library

Read

on January 31, 2026

Your review

Tags

Paper Aliases

No aliases