Learning class specific graph prototypes

6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper describes how to construct a graph prototype model from a large corpus of multi-view images using local invariant features. We commence by representing each image with a graph, which is constructed from a group of selected SIFT features. We then propose a new pairwise clustering method based on a graph matching similarity measure. The positive example graphs of a specific class accompanied with a set of negative example graphs are clustered into one or more clusters, which minimize an entropy function. Each cluster is simplified into a tree structure composed of a series of irreducible graphs, and for each of which a node co-occurrence probability matrix is obtained. Finally, a recognition oriented class specific graph prototype (CSGP) is automatically generated from the given graph set. Experiments are performed on over 50K training images spanning ~500 objects and over 20K test images of 68 objects. This demonstrates the scalability and recognition performance of our model. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Xia, S., & Hancock, E. R. (2009). Learning class specific graph prototypes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5716 LNCS, pp. 269–277). Springer Verlag. https://doi.org/10.1007/978-3-642-04146-4_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free