Learning optimal compact codebook for efficient object categorization

Cited 0 time in webofscience Cited 20 time in scopus
  • Hit : 521
  • Download : 484
Representation of images using the distribution of local features on a visual codebook is an effective method for object categorization. Typically, discriminative capability of the codebook can lead to a better performance. However, conventional methods usually use clustering algorithms to learn codebooks without considering this. This paper presents a novel approach of learning optimal compact codebooks by selecting a subset of discriminative codes from a large codebook Firstly, the Gaussian models of object categories based on a single code are learned from the distribution of local features within each image. Then two discriminative criteria, i.e. likelihood ratio and Fisher, are introduced to evaluate how each code contributes to the categorization. We evaluate the optimal codebooks constructed by these two criteria on Caltech-4 dataset, and report superior performance of object categorization compared with traditional K-means method with the same size of codebook.
Publisher
WACV '08
Issue Date
2008-01-07
Language
English
Citation

2008 IEEE Workshop on Applications of Computer Vision, WACV, pp.229

DOI
10.1109/WACV.2008.4544027
URI
http://hdl.handle.net/10203/23026
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0