Knowing a good HOG filter when you see it: Efficient selection of filters for detection

8Citations
Citations of this article
70Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Collections of filters based on histograms of oriented gradients (HOG) are common for several detection methods, notably, poselets and exemplar SVMs. The main bottleneck in training such systems is the selection of a subset of good filters from a large number of possible choices. We show that one can learn a universal model of part "goodness" based on properties that can be computed from the filter itself. The intuition is that good filters across categories exhibit common traits such as, low clutter and gradients that are spatially correlated. This allows us to quickly discard filters that are not promising thereby speeding up the training procedure. Applied to training the poselet model, our automated selection procedure allows us to improve its detection performance on the PASCAL VOC data sets, while speeding up training by an order of magnitude. Similar results are reported for exemplar SVMs. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Ahmed, E., Shakhnarovich, G., & Maji, S. (2014). Knowing a good HOG filter when you see it: Efficient selection of filters for detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8689 LNCS, pp. 80–94). Springer Verlag. https://doi.org/10.1007/978-3-319-10590-1_6

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