Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

10-2009

Abstract

Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate videos. Most existing techniques either focus on the fast retrieval of full copies or near-duplicates, or consider localization in a heuristic manner. This paper considers the scalable detection and localization of partial near-duplicate videos by jointly considering visual similarity and temporal consistency. Temporal constraints are embedded into a network structure as directed edges. Through the structure, partial alignment is novelly converted into a network flow problem where highly efficient solutions exist. To precisely decide the boundaries of the overlapping segments, pair-wise constraints generated from keypoint matching can be added to the network to iteratively refine the localization result. We demonstrate the effectiveness of partial alignment for three different tasks. The first task links partial segments in fulllength movies to videos crawled from YouTube. The second task performs fast web video search, while the third performs near-duplicate shot and copy detection. The experimental result demonstrates the effectiveness and efficiency of the proposed method compared to state-of-the-art techniques.

Keywords

Network flow, Partial near-duplicate, Temporal graph

Discipline

Databases and Information Systems | Data Storage Systems | Graphics and Human Computer Interfaces

Research Areas

Intelligent Systems and Optimization

Publication

Proceedings of the 17th ACM international conference on Multimedia, MM'09, Beijing, China, October 19-24

First Page

145

Last Page

154

ISBN

9781605586083

Identifier

10.1145/1631272.1631295

Publisher

ACM

City or Country

Beijing, China

Download

Share

COinS