Near-duplicate video retrieval through toeplitz kernel partial least squares

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The existence of huge volumes of near-duplicate videos shows a rising demand on effective near-duplicate video retrieval technique in copyright violation and search result re-ranking. In this paper, Kernel Partial Least Squares (KPLS) is used to find strong information correlation in near-duplicate videos. Furthermore, to solve the problem of “curse of kernelization” when querying a large-scale video database, we propose a Toeplitz Kernel Partial Least Squares method. The Toeplitz matrix multiplication can be implemented by the Fast Fourier Transform (FFT) to accelerate the computation. Extensive experiments on the widely used CC_WEB_VIDEO dataset demonstrate that the proposed approach exhibits superior performance of near-duplicate video retrieval (NDVR) over state-of-the-art methods, such as BCS, SE, SSBelt and CCA, achieving a mean average precision (MAP) score of 0.9665.

Cite

CITATION STYLE

APA

Tao, J. L., Zhang, J. M., Wang, L. J., Shen, X. J., & Zha, Z. J. (2019). Near-duplicate video retrieval through toeplitz kernel partial least squares. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11296 LNCS, pp. 352–364). Springer Verlag. https://doi.org/10.1007/978-3-030-05716-9_29

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