Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

10-2008

Abstract

In this paper, we investigate a novel approach of exploiting visual-duplicates for web video reranking using hypergraph. Current graph-based reranking approaches consider mainly the pair-wise linking of keyframes and ignore reliability issues that are inherent in such representation. We exploit higher order relation to overcome the issues of missing links in visual-duplicate keyframes and in addition identify the latent relationships among keyframes. Based on hypergraph, we consider two groups of video threads: visual near-duplicate threads and story threads, to hyperlink web videos and describe the higher order information existing in video content. To facilitate reranking using random walk algorithm, the hypergraph is converted to a star-like graph using star expansion algorithm. Experiments on a dataset of 12,790 web videos show that hypergraph reranking can improve web video retrieval up to 45% over the initial ranked result by the video sharing websites and 8.3% over the pair-wise based graph reranking in mean average precision (MAP).

Keywords

Algorithms, Experimentation, Performance

Discipline

Data Storage Systems | Theory and Algorithms

Research Areas

Intelligent Systems and Optimization

Publication

Proceedings of the 16th ACM International Conference on Multimedia, MM '08, Vancouver, 2008 October 26-31

First Page

659

Last Page

662

ISBN

9781605583037

Identifier

10.1145/1459359.1459453

Publisher

ACM

City or Country

Vancouver, Canada

Download

Share

COinS