Fast similarity search and clustering of video sequences on the world-wide-web

被引:42
作者
Cheung, SCS [1 ]
Zakhor, A
机构
[1] Univ Kentucky, Dept Elect & Comp Engn, Lexington, KY 40506 USA
[2] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
基金
美国国家科学基金会;
关键词
clustering; dimension reduction; similarity search; video signature; web search;
D O I
10.1109/TMM.2005.846906
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 [计算机科学与技术];
摘要
We define similar video content as video sequences with almost identical content but possibly compressed at different qualities, reformatted to different sizes and frame-rates, undergone minor editing in either spatial or temporal domain, or summarized into keyframe sequences. Building a search engine to identify such similar content in the World-Wide Web requires: 1) robust video similarity measurements; 2) fast similarity search techniques on large databases; and 3) intuitive organization of search results. In a previous paper, we proposed a randomized technique called the video signature (ViSig) method for video similarity measurement. In this paper, we focus on the remaining two issues by proposing a feature extraction scheme for fast similarity search, and a clustering algorithm for identification of similar clusters. Similar to many other content-based methods, the ViSig method uses high-dimensional feature vectors to represent video. To warrant a fast response time for similarity searches on high dimensional vectors, we propose a novel nonlinear feature extraction scheme on arbitrary metric spaces that combines the triangle inequality with the classical Principal Component Analysis (PCA). We show experimentally that the proposed technique outperforms PCA, Fastmap, Triangle-Inequality Pruning, and Haar wavelet on signature data. To further improve retrieval performance, and provide better organization of similarity search results, we introduce a new graph-theoretical clustering algorithm on large databases of signatures. This algorithm treats all signatures as an abstract threshold graph, where the distance threshold is determined based on local data statistics. Similar clusters are then identified as highly connected regions in the graph. By measuring the retrieval performance against a ground-truth set, we show that our proposed algorithm outperforms simple thresholding, single-link and complete-link hierarchical clustering techniques.
引用
收藏
页码:524 / 537
页数:14
相关论文
共 30 条
[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]
[Anonymous], 1989, The Design and Analysis of Spatial Data Structures
[4]
A flexible image database system for content-based retrieval [J].
Berman, AP ;
Shapiro, LG .
COMPUTER VISION AND IMAGE UNDERSTANDING, 1999, 75 (1-2) :175-195
[5]
Bezdek J., 1999, FUZZY MODELS ALGORIT
[6]
ON LIPSCHITZ EMBEDDING OF FINITE METRIC-SPACES IN HILBERT-SPACE [J].
BOURGAIN, J .
ISRAEL JOURNAL OF MATHEMATICS, 1985, 52 (1-2) :46-52
[7]
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
[8]
Chang HS, 1999, IEEE T CIRC SYST VID, V9, P1269, DOI 10.1109/76.809161
[9]
CHEUNG SC, 2002, THESIS U CALIFORNIA
[10]
Efficient video similarity measurement with video signature [J].
Cheung, SCS ;
Zakhor, A .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2003, 13 (01) :59-74