Skip to main navigation Skip to search Skip to main content

Video clip retrieval by maximal matching and optimal matching in graph theory

Yu-Xin Peng, Chong-Wah Ngo, Qing-Jie Dong, Zong-Ming Guo, Jian-Guo Xiao

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

In this paper, a novel approach for automatic matching, ranking and retrieval of video clips is proposed. Motivated by the maximal and optimal matching theories in graph analysis, a new similarity measure of video clips is defined based on the representation and modeling of bipartite graph. Four different factors: visual similarity, granularity, interference and temporal order of shots are taken into consideration for similarity ranking. These factors are progressively analyzed in the proposed approach. Maximal matching utilizes the granularity factor to efficiently filter false matches, while optimal matching takes into account the visual, granularity and interference factors for similarity measure. Dynamic programming is also formulated to quantitatively evaluate the temporal order of shots. The final similarity measure is based on the results of optimal matching and dynamic programming. Experimental results indicate that the proposed approach is effective and efficient in retrieving and ranking similar video clips.
Original languageEnglish
Title of host publicationProceedings - IEEE International Conference on Multimedia and Expo
PublisherIEEE Computer Society
PagesI317-I320
Volume1
ISBN (Print)780379659
DOIs
Publication statusPublished - 2003
Event2003 International Conference on Multimedia and Expo, ICME 2003 - Baltimore, United States
Duration: 6 Jul 20039 Jul 2003

Publication series

Name
Volume1
ISSN (Print)1945-7871
ISSN (Electronic)1945-788X

Conference

Conference2003 International Conference on Multimedia and Expo, ICME 2003
PlaceUnited States
CityBaltimore
Period6/07/039/07/03

Fingerprint

Dive into the research topics of 'Video clip retrieval by maximal matching and optimal matching in graph theory'. Together they form a unique fingerprint.

Cite this