Exploiting the Circulant Structure of Tracking-by-Detection with Kernels

Explore this paper's citation graph

Summary

Using the well-established theory of Circulant matrices, this work provides a link to Fourier analysis that opens up the possibility of extremely fast learning and detection with the Fast Fourier Transform, which can be done in the dual space of kernel machines as fast as with linear classifiers.

Published
2012-10-07
Cited by
2,360
References
26
Access
Open access

References

Cited by

Related papers

No related papers recorded.