Beyond Hard Negative Mining: Efficient Detector Learning via Block-Circulant Decomposition
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Competitive sliding window detectors require vast training sets. Since a pool of natural images provides a nearly endless supply of negative samples, in the form of patches at different scales and locations, training with all the available data is considered impractical. A staple of current approaches is hard negative mining, a method of selecting relevant samples, which is nevertheless expensive. Given that samples at slightly different locations have overlapping support, there seems to be an enormous amount of duplicated work. It is natural, then, to ask whether these redundancies can be eliminated. In this paper, we show that the Gram matrix describing such data is block-circulant. We derive a transformation based on the Fourier transform that block-diagonalizes the Gram matrix, at once eliminating redundancies and partitioning the learning problem. This decomposition is valid for any dense features and several learning algorithms, and takes full advantage of modern parallel architectures. Surprisingly, it allows training with all the potential samples in sets of thousands of images. By considering the full set, we generate in a single shot the optimal solution, which is usually obtained only after several rounds of hard negative mining. We report speed gains on Caltech Pedestrians and INRIA Pedestrians of over an order of magnitude, allowing training on a desktop computer in a couple of minutes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Histograms of Oriented Gradients for Human Detection
Dalal, N., & Triggs, B. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.177 · Cited by 33,584
Exploiting the Circulant Structure of Tracking-by-Detection with Kernels
Henriques, J. F., Caseiro, R., Martins, P., & Batista, J. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33765-9_50 · Cited by 2,310
Self-citationEnsemble of exemplar-SVMs for object detection and beyond
Malisiewicz, T., Gupta, A., & Efros, A. A. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126229 · Cited by 865
Visual features of intermediate complexity and their use in classification
Ullman, S., Vidal-Naquet, M., & Sali, E. (2002) · Nature Neuroscience · doi:10.1038/nn870 · Cited by 600
Event Retrieval in Large Video Collections with Circulant Temporal Encoding
Revaud, J., Douze, M., Schmid, C., & Jegou, H. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.318 · Cited by 133
Cited by
High-Speed Tracking with Kernelized Correlation Filters
Henriques, J. F., Caseiro, R., Martins, P., & Batista, J. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2345390 · Cited by 5,753
Self-citationAccurate Scale Estimation for Robust Visual Tracking
Danelljan, M., Häger, G., Shahbaz Khan, F., & Felsberg, M. (2014) · Proceedings of the British Machine Vision Conference 2014 · doi:10.5244/c.28.65 · Cited by 2,087
Learning Spatially Regularized Correlation Filters for Visual Tracking
Danelljan, M., Hager, G., Khan, F. S., & Felsberg, M. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.490 · Cited by 1,815
Staple: Complementary Learners for Real-Time Tracking
Bertinetto, L., Valmadre, J., Golodetz, S., Miksik, O., & Torr, P. H. S. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.156 · Cited by 1,776
A Scale Adaptive Kernel Correlation Filter Tracker with Feature Integration
Li, Y., & Zhu, J. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-16181-5_18 · Cited by 1,396
Metadata
- Authors
- Henriques, J. F., Carreira, J., Caseiro, R., & Batista, J.
- Venue
- 2013 IEEE International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2013-12
- OpenAlex
- W2157452486
- Cited by
- 107
- References
- 6
- FWCI
- 9.17
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Beyond Hard Negative Mining: Efficient Detector Learning via Block-Circulant Decomposition. https://app.cochat.ai/papers/10.1109/iccv.2013.343
- The paper
- Henriques, J. F., Carreira, J., Caseiro, R., & Batista, J. (2013). Beyond Hard Negative Mining: Efficient Detector Learning via Block-Circulant Decomposition. 2013 IEEE International Conference on Computer Vision. https://doi.org/10.1109/iccv.2013.343
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.