Combining local feature histograms of different granularities

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Histograms of local features have proven to be powerful representations in image category detection. Histograms with different numbers of bins encode the visual information with different granularities. In this paper we experimentally compare techniques for combining different granularities in a way that the resulting descriptors can be used as feature vectors in conventional vector space learning algorithms. In particular, we consider two main approaches: fusing the granularities on SVM kernel level and moving away from binary or hard to soft histograms. We find soft histograms to be a more effective approach, resulting in substantial performance improvement over single-granularity histograms. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Viitaniemi, V., & Laaksonen, J. (2009). Combining local feature histograms of different granularities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5575 LNCS, pp. 636–645). https://doi.org/10.1007/978-3-642-02230-2_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free