Mining repetitive clips through finding continuous paths

Junsong Yuan*, Wei Wang, Jingjing Meng, Ying Wu, Dongge Li

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations


Automatically discovering repetitive clips from large video database is a challenging problem due to the enormous computational cost involved in exploring the huge solution space. Without any a priori knowledge of the contents, lengths and total number of the repetitive clips, we need to discover all of them in the video database. To address the large computational cost, we propose a novel method which translates repetitive clip mining to the continuous path finding problem in a matching trellis, where sequence matching can be accelerated by taking advantage of the temporal redundancies in the videos. By applying the locality sensitive hashing (LSH) for efficient similarity query and the proposed continuous path finding algorithm, our method is of only quadratic complexity of the database size. Experiments conducted on a 10.5-hour TRECVID news dataset have shown the effectiveness, which can discover repetitive clips of various lengths and contents in only 25 minutes, with features extracted off-line.

Original languageEnglish (US)
Title of host publicationProceedings of the Fifteenth ACM International Conference on Multimedia, MM'07
Number of pages4
StatePublished - 2007
Event15th ACM International Conference on Multimedia, MM'07 - Augsburg, Bavaria, Germany
Duration: Sep 24 2007Sep 29 2007

Publication series

NameProceedings of the ACM International Multimedia Conference and Exhibition


Other15th ACM International Conference on Multimedia, MM'07
CityAugsburg, Bavaria


  • Repetitive pattern discovery
  • Video data mining

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Mining repetitive clips through finding continuous paths'. Together they form a unique fingerprint.

Cite this