Skip to main navigation Skip to search Skip to main content

Efficient mining of multiple partial near-duplicate alignments by temporal network

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

Abstract

This paper considers the mining and localization of near-duplicate segments at arbitrary positions of partial near-duplicate videos in a corpus. Temporal network is proposed to model the visual-temporal consistency between video sequence by embedding temporal constraints as directed edges in the network. Partial alignment is then achieved through network flow programming. To handle multiple alignments, we consider two properties of network structure: conciseness and divisibility, to ensure that the mining is efficient and effective. Frame-level matching is further integrated in the temporal network for alignment verification. This results in an iterative alignment-verification procedure to fine tune the localization of near-duplicate segments. The scalability of frame-level matching is enhanced by exploring visual keyword matching algorithms. We demonstrate the proposed work for mining partial alignments from two months of broadcast videos and across six TV sources. © 2006 IEEE.
Original languageEnglish
Article number5580060
Pages (from-to)1486-1498
JournalIEEE Transactions on Circuits and Systems for Video Technology
Volume20
Issue number11
DOIs
Publication statusPublished - Nov 2010

Research Keywords

  • Keyword matching
  • partial near-duplicate
  • temporal graph

Fingerprint

Dive into the research topics of 'Efficient mining of multiple partial near-duplicate alignments by temporal network'. Together they form a unique fingerprint.

Cite this