Chebyshev approximations to the histogram χ 2 kernel

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2012, Pages 2424-2431

  Li, Fuxin ^a   Lebanon, Guy ^a   Sminchisescu, Cristian ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE APPROXIMATION; CHEBYSHEV POLYNOMIALS; CLASSIFICATION ACCURACY; CONSTANT FACTORS; DATA SETS; FOURIER; FOURIER APPROXIMATIONS; KERNEL CLASSIFIERS; LINEAR TIME; NON-LINEAR MODEL; NON-TRIVIAL; OUT-OF-CORE; PERFORMANCE GAPS; PERFORMANCE IMPROVEMENTS; PERIODIC APPROXIMATION; TESTING DATA; TIME COMPLEXITY; TRAINING EXAMPLE;

APPROXIMATION THEORY; CHEBYSHEV APPROXIMATION; GRAPHIC METHODS; POLYNOMIALS; PRINCIPAL COMPONENT ANALYSIS;

COMPUTER VISION;

EID: 84866664674     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2012.6247956     Document Type: Conference Paper

References (30)

1. F. Bach and M. I. Jordan. Predictive low-rank decomposition for kernel methods. In ICML, 2005. 2
2. P. L. Bartlett, O. Bousquet, and S. Mendelson. Local Rademacher Complexities. Annals of Statistics, 33:1497-1537, 2005. 1
3. L. Bo and C. Sminchisescu. Efficient match kernels between sets of features for visual recognition. In NIPS, 2009. 2
4. J. P. Boyd. Chebyshev and Fourier Spectral Methods (second ed.). Dover, 2001. 3
5. R. Caflisch. Monte Carlo and quasi-Monte Carlo Methods. Acta Mumerica, 7:1-49, 1998. 4
6. J. Carreira, F. Li, and C. Sminchisescu. Object recognition by sequential figure-ground ranking. IJCV, 98, 2012. 1, 6
7. J. Carreira and C. Sminchisescu. Constrained parametric min cuts for automatic object segmentation. In CVPR, 2010. 6
8. J. Carreira and C. Sminchisescu. Constrained parametric min-cuts for automatic object segmentation. PAMI, 34, 2012. 6
9. K. Chatfield, V. Lempitsky, A. Vedaldi, and A. Zisserman. The devil is in the details: an evaluation of recent feature encoding methods. In BMVC, 2011. 2
10. J. Deng, A. C. Berg, K. Li, and L. Fei-Fei. What does classifying more than 10,000 image categories tell us? In ECCV, 2010. 7, 8
11. J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei- Fei. Imagenet: A large-scale hierarchical image database. In CVPR, 2009. 2, 5
12. P. Drineas and M. Mahoney. On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning. JMLR, 6:2153-2175, 2005. 2
13. M. Everingham, L. V. Gool, C. Williams, J. Winn, and A. Zisserman. The pascal visual object classes (voc) challenge. IJCV, 88:303-338, 2010. 5
14. S. Fine and K. Scheinberg. Efficient svm training using lowrank kernel representation. JMLR, 2:243-264, 2001. 2
15. P. V. Gehler and S. Nowozin. On feature combination for multiclass object classification. In ICCV, 2009. 4
16. H. Lee, A. Battle, R. Raina, and A. Y. Ng. Efficient sparse coding algorithms. In NIPS, pages 801-808, 2007. 2
17. H. Lee, R. Grosse, R. Ranganath, and A. Y. Ng. Convolutional deep belief networks for scalable unsupervised learning of hierarchical representations. In ICML, 2009. 2
18. F. Li, J. Carreira, and C. Sminchisescu. Object recognition as ranking holistic figure-ground hypotheses. In CVPR, 2010. 6
19. F. Li, C. Ionescu, and C. Sminchisescu. Random Fourier approximations for skewed multiplicative histogram kernels. In DAGM, 2010. 1, 6
20. F. Li, G. Lebanon, and C. Sminchisescu. The Chebyshev Approximation for the Histogram 2 Kernel and Principal Components of Fourier Features. Technical report, Computational Science and Engineering, Georgia Institute of Technology and Institute for Numerical Simulation, University of Bonn, June 2012. 2, 3
21. Y. Lin, F. Lv, S. Zhu, M. Yang, T. Cour, K. Yu, L. Cao, and T. S. Huang. Large-scale image classification: Fast feature extraction and svm training. In CVPR, 2011. 2, 6
22. M. Pedersoli, A. Vedaldi, and J. Gonzalez. A coarse-to-fine approach for fast deformable object detection. In CVPR, 2011. 1
23. F. Perronnin, J. Sánchez, and T. Mensink. Improving the fisher kernel for large-scale image classification. In ECCV, 2010. 2
24. Y. Qu, G. Ostrouchov, N. Samatova, and A. Geist. Principal component analysis for dimension reduction in massive distributed data sets. In ICDM, 2002. 4
25. A. Rahimi and B. Recht. Random features for large-scale kernel machines. In NIPS, 2007. 1, 2, 3
26. V. Sreekanth, A. Vedaldi, C. V. Jawahar, and A. Zisserman. Generalized rbf feature maps for efficient detection. In BMVC, 2010. 1, 3
27. A. Vedaldi and A. Zisserman. Efficient additive kernels via explicit feature maps. In CVPR, 2010. 1
28. A. Vedaldi and A. Zisserman. Efficient additive kernels via explicit feature maps. PAMI, 34:480-492, 2012. 1, 2, 6
29. J. Wang, J. Yang, K. Yu, F. Lv, T. Huang, and Y. Gong. Locality-constrained linear coding for image classification. In CVPR, 2010. 2
30. C. K. I.Williams and M. Seeger. Using the Nyström Method to Speed Up Kernel Machines. In NIPS, 2001. 2, 6