Proceedings of the 15th ACM International Conference on Multimedia 2007
DOI: 10.1145/1291233.1291446
|View full text |Cite
|
Sign up to set email alerts
|

Video search reranking through random walk over document-level context graph

Abstract: Multimedia search over distributed sources often result in recurrent images or videos which are manifested beyond the textual modality. To exploit such contextual patterns and keep the simplicity of the keyword-based search, we propose novel reranking methods to leverage the recurrent patterns to improve the initial text search results. The approach, context reranking, is formulated as a random walk problem along the context graph, where video stories are nodes and the edges between them are weighted by multim… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

3
192
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 199 publications
(195 citation statements)
references
References 17 publications
3
192
0
Order By: Relevance
“…Specifically, the random-walk approach for multimodal fusion was introduced in [12], where the fusion of textual and visual information leads to improved performance in the video search task. The framework in [2] includes as special cases all well-known fusion models (e.g.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Specifically, the random-walk approach for multimodal fusion was introduced in [12], where the fusion of textual and visual information leads to improved performance in the video search task. The framework in [2] includes as special cases all well-known fusion models (e.g.…”
Section: Related Workmentioning
confidence: 99%
“…The transition probability p κλ between two multimodal items is also depicted in Figure 2 and provides the weight on the link from node κ to node λ. The graphbased approach has been proposed in [12] in the context of video retrieval, but is directly applicable to any pairs of modalities.…”
Section: Graph-based Fusion In Multimedia Retrievalmentioning
confidence: 99%
“…The images reranking methods can be classified into that of classification based [12,25], clustering based [2,3,4,7,14], graph based [8,16], and learning to rerank [22,26,27].…”
Section: Related Workmentioning
confidence: 99%
“…The process of reranking is formulated as random walk over the graph and the relevance scores are propagated through the edges. So, the relevance of the image to the query keyword can be measured by relevance scores defined on the graphs [8,16].…”
Section: Related Workmentioning
confidence: 99%
“…The other popular method is the graph based random walk, where the stationary probability of the random walk process is used as the ranking scores of the nodes. Such ranking method has been widely used in video search reranking [11], social media tag ranking [15], etc. However, all these methods are limited to homogeneous networks with nodes of the same type, which are inadequate for modeling the heterogeneous entities and relations.…”
Section: Related Workmentioning
confidence: 99%