Graph-Based Video Search Reranking with Local and Global Consistency Analysis


IEICE TRANSACTIONS on Information and Systems   Vol.E101-D    No.5    pp.1430-1440
Publication Date: 2018/05/01
Publicized: 2018/01/30
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2017EDP7277
Type of Manuscript: PAPER
Category: Image Processing and Video Processing
video search reranking,  graph learning,  graph consistency analysis,  spectral clustering,  

Full Text: PDF(1.4MB)>>
Buy this Article

Video reranking is an effective way for improving the retrieval performance of text-based video search engines. This paper proposes a graph-based Web video search reranking method with local and global consistency analysis. Generally, the graph-based reranking approach constructs a graph whose nodes and edges respectively correspond to videos and their pairwise similarities. A lot of reranking methods are built based on a scheme which regularizes the smoothness of pairwise relevance scores between adjacent nodes with regard to a user's query. However, since the overall consistency is measured by aggregating only the local consistency over each pair, errors in score estimation increase when noisy samples are included within query-relevant videos' neighbors. To deal with the noisy samples, the proposed method leverages the global consistency of the graph structure, which is different from the conventional methods. Specifically, in order to detect this consistency, the propose method introduces a spectral clustering algorithm which can detect video groups, in which videos have strong semantic correlation, on the graph. Furthermore, a new regularization term, which smooths ranking scores within the same group, is introduced to the reranking framework. Since the score regularization is performed by both local and global aspects simultaneously, the accurate score estimation becomes feasible. Experimental results obtained by applying the proposed method to a real-world video collection show its effectiveness.

open access publishing via