ACM Home Page
Please provide us with feedback. Feedback
Modeling video hyperlinks with hypergraph for web video reranking
Full text PdfPdf (200 KB)
Source
International Multimedia Conference archive
Proceeding of the 16th ACM international conference on Multimedia table of contents
Vancouver, British Columbia, Canada
SESSION: Content track short papers session 1: content analysis table of contents
Pages 659-662  
Year of Publication: 2008
ISBN:978-1-60558-303-7
Authors
Hung-Khoon Tan  City University of Hong Kong, Kowloon, Hong Kong
Chong-Wah Ngo  City University of Hong Kong, Kowloon, Hong Kong
Xiao Wu  City University of Hong Kong, Kowloon, Hong Kong
Sponsors
ACM: Association for Computing Machinery
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 87,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1459359.1459453
What is a DOI?

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).


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
T.-S. Chua and et. al. Trecvid 2004 search and feature extraction task by NUS PRIS. In TRECVID Workshop, 2004.
4
5
6
7
 
8
L. Page, S. Brin, L. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
9
 
10
Wikipedia. http://en.wikipedia.org/wiki/youtube.
11
 
12
R. Yan and A. G. Hauptmann. Multimedia search with pseudo-relevance feedback. In CIVR, 2003.
 
13
Y. H. Yang and W. H. Hsu. Video search reranking via online ordinal reranking. In ICME, 2008.
 
14
W. L. Zhao, C.-W. Ngo, H.-K. Tan, and X. Wu. Near-duplicate keyframe identification with interest point matching and pattern learning. In IEEE Trans. on Multimedia, volume 9, pages 1037--1048, Aug 2006.
 
15
J. Y. Zien, M. D. F. Schlag, and P. K. Chan. Multi-level spectral hypergraph partitioning with arbitrary vertex sizes. In IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, volume 18, pages 1389--1399, 1999.

Collaborative Colleagues:
Hung-Khoon Tan: colleagues
Chong-Wah Ngo: colleagues
Xiao Wu: colleagues