Multi-scale attributed graph kernel for image categorization

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The spatial pyramid matching has been widely adopted for scene recognition and image retrieval. It splits the image into sub-regions and counts the local features within the sub-region. However, it has not captured the spatial relationship between the local features located in the sub-region. This paper proposes to construct the multi-scale attributed graphs which involve the vocabulary label to characterize the spatial structure of the local features at different scales. We compute the distances of any two attributed graph corresponding to the image grids and find the optimal matching to aggregate. Then we poll the distances of graphs at different scales to build the kernel for image classification. We conduct our method on the Caltech 101, Caltech 256, Scene Categories, and Six Actions datasets and compare with five methods. The experiment results demonstrate that our method can provide a good accuracy for image categorization.

Cite

CITATION STYLE

APA

Hu, D., Xu, Q., Tang, J., & Luo, B. (2018). Multi-scale attributed graph kernel for image categorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11258 LNCS, pp. 610–621). Springer Verlag. https://doi.org/10.1007/978-3-030-03338-5_51

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