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

• Main Authors: TAN, Hung-Khoon, NGO, Chong-wah, CHUA, Tat-Seng
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2010
• Subjects: Keyword matching; Partial near-duplicate; temporal graph; Graphics and Human Computer Interfaces; OS and Networks
• Online Access: https://ink.library.smu.edu.sg/sis_research/6319; https://ink.library.smu.edu.sg/context/sis_research/article/7322/viewcontent/csvt_hktan_10.pdf
• Institution: Singapore Management University

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.