Image Categorization Using Directed Graphs
Hua Wang, Heng Huang, Chris Ding
ECCV - 2010
Most existing graph-based semi-supervised classification methods use pairwise similarities as edge weights of an undirected graph with images as the nodes of the graph. Recently several new graph construction methods produce, however, directed graph (asymmetric similarity between nodes). A simple symmetrization is often used to convert a directed graph to an undirected one. This, however, loses important structural information conveyed by asymmetric similarities. In this paper, we propose a novel symmetric co-linkage similarity which captures the essential relationship among the nodes in the directed graph. We apply this new co-linkage similarity in two important computer vision tasks for image categorization: object recognition and image annotation. Extensive empirical studies demonstrate the effectiveness of our method.
Links
- View publications from Hua Wang
- View publications presented in ECCV
- View publications researching Graph Representations/Learning
- View publications applied to Computer Vision
Cite this paper
MLA
Wang, Hua, Heng Huang, and Chris Ding. "Image categorization using directed graphs." European Conference on Computer Vision. Springer, Berlin, Heidelberg, 2010.
BibTeX
@inproceedings{wang2010image,
title={Image categorization using directed graphs},
author={Wang, Hua and Huang, Heng and Ding, Chris},
booktitle={European Conference on Computer Vision},
pages={762--775},
year={2010},
organization={Springer}
}