Efficient video similarity measurement with video signature

被引:115
作者
Cheung, SCS [1 ]
Zakhor, A [1 ]
机构
[1] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
基金
美国国家科学基金会;
关键词
randomized algorithm; video similarity; video summarization; Voronoi diagram;
D O I
10.1109/TCSVT.2002.808080
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 [电气工程]; 0809 [电子科学与技术];
摘要
The proliferation of video content on the Web makes similarity detection an indispensable tool in Web data management, searching, and navigation. In this paper, we propose a number of algorithms to efficiently measure video similarity. We define video as a set of frames, which are represented as high dimensional vectors in a feature space. Our goal is to measure ideal video similarity (IVS), defined as the percentage of clusters of similar frames shared between two video sequences. Since IVS is too complex to be deployed in large database applications, we approximate it with Voronoi video similarity (VVS), defined as the volume of the intersection between Voronoi cells of similar clusters. We propose a class of randomized algorithms to estimate VVS by first summarizing each video with a small set of its sampled frames, called the video signature (ViSig), and then calculating the distances between corresponding frames from the two ViSigs. By generating samples with a probability distribution that describes the video statistics, and ranking them based upon their likelihood of making an error in the estimation, we show analytically that ViSig can provide an unbiased estimate of IVS. Experimental results on a large dataset of Web video and a set of MPEG-7 test sequences with artificially generated similar versions are provided to demonstrate the retrieval performance of our proposed techniques.
引用
收藏
页码:59 / 74
页数:16
相关论文
共 27 条
[1]
A distance measure for video sequence similarity matching [J].
Adjeroh, DA ;
Lee, MC ;
King, I .
INTERNATIONAL WORKSHOP ON MULTI-MEDIA DATABASE MANAGEMENT SYSTEMS- PROCEEDINGS, 1998, :72-79
[2]
[Anonymous], 1999, FINDING PIRATED VIDE
[3]
Syntactic clustering of the Web [J].
Broder, AZ ;
Glassman, SC ;
Manasse, MS ;
Zweig, G .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1997, 29 (8-13) :1157-1166
[4]
Chang HS, 1999, IEEE T CIRC SYST VID, V9, P1269, DOI 10.1109/76.809161
[5]
CHEUNG SC, UNPUB IEEE T MULTIME
[6]
Cheung SCS, 2000, IEEE IMAGE PROC, P85, DOI 10.1109/ICIP.2000.900898
[7]
Cheung SCS, 2000, PROC SPIE, V3964, P34
[8]
*COMP SYST RES CTR, 1998, 1998014 SRC COMP SYS
[9]
Cormen T. H., 2001, Introduction to Algorithms, V2nd
[10]
Greenspan H, 2002, LECT NOTES COMPUT SC, V2353, P461