EMD-Based Video Clip Retrieval by Many-to-Many Matching

This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach allows many-to-many matching methodology and is capable of tolerating errors due to video partitioning and various video editing effects. We formulate clip-based retrieval as a graph matching problem in two stages. In the first stage, to allow the matching between a query and a long video, an online clip segmentation algorithm is employed to rapidly locate candidate clips for similarity measure. In the second stage, a weighted graph is constructed to model the similarity between two clips. EMD is proposed to compute the minimum cost of the weighted graph as the similarity between two clips. Experimental results show that the proposed approach is better than some existing methods in term of ranking capability.

• Type: Conference
• Year: 2005
• Where: CIVR
• Authors: Yuxin Peng, Chong-Wah Ngo
• Keywords: CIVR 2005, Graph Matching Problem, One-to-one Matching Constraint, Weighted Graph