Learning Tree-structured Descriptor Quantizers for Image Categorization

Josip Krapac 1 Jakob Verbeek 1 Frédéric Jurie 1, 2
1 LEAR - Learning and recognition in vision
Inria Grenoble - Rhône-Alpes, LJK - Laboratoire Jean Kuntzmann, INPG - Institut National Polytechnique de Grenoble
2 Equipe Image - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : Current state-of-the-art image categorization systems rely on bag-of-words representations that model image content as a histogram of quantization indices that code local image appearance. In this context, randomized tree-structured quantizers have been shown to be both computationally efficient and yielding discriminative visual words for a given categorization task. This paper presents a new algorithm that builds tree-structured quantizers not to optimize patch classification but to directly optimize the image classification performance. This approach is experimentally validated on several challenging data sets for which it outperforms other patch quantizers such as standard decision trees or k-means.
Document type :
Conference papers
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download


https://hal.inria.fr/inria-00613118
Contributor : Thoth Team <>
Submitted on : Tuesday, August 2, 2011 - 6:49:08 PM
Last modification on : Thursday, February 7, 2019 - 5:47:27 PM
Long-term archiving on : Monday, November 12, 2012 - 3:07:18 PM

Files

paper.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Josip Krapac, Jakob Verbeek, Frédéric Jurie. Learning Tree-structured Descriptor Quantizers for Image Categorization. BMVC 2011 - British Machine Vision Conference, Aug 2011, Dundee, United Kingdom. pp.47.1-47.11, ⟨10.5244/C.25.47⟩. ⟨inria-00613118⟩

Share

Metrics

Record views

835

Files downloads

733