Key points are not available for this paper at this time.
(Work performed while at UC Irvine) Datasets for training object recognition systems are steadily growing in size. This paper investigates the question of whether existing detectors will continue to improve as data grows, or if models are close to saturating due to limited model complexity and the Bayes risk associated with the feature spaces in which they operate. We focus on the popular paradigm of scanning-window templates defined on oriented gradient fea-tures, trained with discriminative classifiers. We investigate the performance of mixtures of templates as a function of the number of templates (complexity) and the amount of training data. We find that additional data does help, but only with correct regularization and treatment of noisy examples or “outliers ” in the training data. Surprisingly, the per-formance of problem domain-agnostic mixture models appears to saturate quickly (∼10 templates and ∼100 positive training examples per template). However, compositional mixtures (implemented via composed parts) give much better performance because they share parameters among templates, and can synthesize new templates not encountered during training. This suggests there is still room to improve performance with linear classifiers and the existing feature space by improved representations and learning algo-rithms. 1
Building similarity graph...
Analyzing shared references across papers
Loading...
Xiangxin Zhu
Carl Vondrick
Deva Ramanan
University of California, Irvine
Building similarity graph...
Analyzing shared references across papers
Loading...
Zhu et al. (Sun,) studied this question.
www.synapsesocial.com/papers/69de665b210a0977fce9407c — DOI: https://doi.org/10.5244/c.26.80