inria-00548675, version 1
Vector quantizing feature space with a regular lattice
Tinne Tuytelaars 1Cordelia Schmid
2, 3
11th IEEE International Conference on Computer Vision (ICCV '07) (2007) 1--8
Abstract: Most recent class-level object recognition systems work with visual words, i.e., vector quantized local descriptors. In this paper we examine the feasibility of a data- independent approach to construct such a visual vocabulary, where the feature space is discretized using a regular lattice. Using hashing techniques, only non-empty bins are stored, and fine-grained grids become possible in spite of the high dimensionality of typical feature spaces. Based on this representation, we can explore the structure of the feature space, and obtain state-of-the-art pixelwise classification results. In the case of image classification, we introduce a class-specific feature selection step, which takes the spatial structure of SIFT-like descriptors into account. Results are reported on the Graz02 dataset.
- 1: Department of Electrical Engineering (ESAT)
- Katholieke Universiteit Leuven
- 2: LEAR (INRIA Grenoble Rhône-Alpes / LJK Laboratoire Jean Kuntzmann)
- CNRS : FR71 – CNRS : UMR5527 – INRIA – Laboratoire Jean Kuntzmann – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG)
- 3: Laboratoire Jean Kuntzmann (LJK)
- CNRS : UMR5224 – Université Joseph Fourier - Grenoble I – Université Pierre Mendès-France - Grenoble II – Institut Polytechnique de Grenoble - Grenoble Institute of Technology
- Domain : Computer Science/Computer Vision and Pattern Recognition
- Keywords : feature extraction – image classification – image coding – image representation – object recognition – vector quantisation
- inria-00548675, version 1
- http://hal.inria.fr/inria-00548675
- oai:hal.inria.fr:inria-00548675
- From: Team Lear
- Submitted for:
- Submitted on: Monday, 20 December 2010 10:27:13
- Updated on: Monday, 10 January 2011 17:16:04






Associated documents
Export