ACM Home Page
Please provide us with feedback. Feedback
Accelerating near-duplicate video matching by combining visual similarity and alignment distortion
Full text PdfPdf (328 KB)
Source
International Multimedia Conference archive
Proceeding of the 16th ACM international conference on Multimedia table of contents
Vancouver, British Columbia, Canada
SESSION: Applications track short papers session 1 table of contents
Pages 861-864  
Year of Publication: 2008
ISBN:978-1-60558-303-7
Authors
Hung-Khoon Tan  City University of Hong Kong, Kowloon, Hong Kong
Xiao Wu  City University of Hong Kong, Kowloon, Hong Kong
Chong-Wah Ngo  City University of Hong Kong, Kowloon, Hong Kong
Wan-Lei Zhao  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): 14,   Downloads (12 Months): 121,   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.1459506
What is a DOI?

ABSTRACT

In this paper, we investigate a novel approach to accelerate the matching of two video clips by exploiting the temporal coherence property inherent in the keyframe sequence of a video. Motivated by the fact that keyframe correspondences between near-duplicate videos typically follow certain spatial arrangements, such property could be employed to guide the alignment of two keyframe sequences. We set the alignment problem as an integer quadratic programming problem, where the cost function takes into account both the visual similarity of the corresponding keyframes as well as the alignment distortion among the set of correspondences. The set of keyframe-pairs found by our algorithm provides our proposal on the list of candidate keyframe-pairs for near-duplicate detection using local interest points. This eliminates the need for exhaustive keyframe-pair comparisons, which significantly accelerates the matching speed. Experiments on a dataset of 12,790 web videos demonstrate that the proposed method maintains a similar near-duplicate video retrieval performance as the hierarchical method proposed in [12] but with a significantly reduced number of keyframe-pair comparisons.


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
A. Hampapur and R. Bolle. Comparison of sequence matching techniques for video copy detection. In Conf. on Storage and Retrieval for Media Databases, 2002.
4
 
5
A. Joly, O. Buisson, and C. Frelicot. Content-based copy retrieval using distortion-based probabilistic similarity search. In IEEE Trans. on Multimedia, volume 9, pages 835--844, 2007.
6
7
 
8
 
9
 
10
11
12
13
 
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, Aug 2007.

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