Efficient Mining of Repetitions in Large-Scale TV Streams with Product Quantization Hashing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Efficient Mining of Repetitions in Large-Scale TV Streams with Product Quantization Hashing

Abstract

Duplicates or near-duplicates mining in video sequences is of broad interest to many multimedia applications. How to design an effective and scalable system, however, is still a challenge to the community. In this paper, we present a method to detect recurrent sequences in large-scale TV streams in an unsupervised manner and with little a priori knowledge on the content. The method relies on a product k-means quantizer that efficiently produces hash keys adapted to the data distribution for frame descriptors. This hashing technique combined with a temporal consistency check allows the detection of meaningful repetitions in TV streams. When considering all frames (about 47 millions) of a 22-day long TV broadcast, our system detects all repetitions in 15 minutes, excluding the computation of the frame descriptors. Experimental results show that our approach is a promising way to deal with very large video databases.
Fichier principal
Vignette du fichier
pqhash.pdf (129.01 Ko) Télécharger le fichier
Vignette du fichier
pqhash_thumb.png (45.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Loading...

Dates and versions

hal-00731090 , version 1 (12-09-2012)

Identifiers

  • HAL Id : hal-00731090 , version 1

Cite

Jiangbo Yuan, Guillaume Gravier, Sébastien Campion, Xiuwen Liu, Hervé Jégou. Efficient Mining of Repetitions in Large-Scale TV Streams with Product Quantization Hashing. Workshop on Web-scale Vision and Social Media, in conjunction with ECCV, Oct 2012, Firenze, Italy. ⟨hal-00731090⟩
341 View
412 Download

Share

Gmail Facebook X LinkedIn More