Image classification using frequent approximate subgraphs

5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Frequent approximate subgraph (FAS) mining is used in applications where it is important to take into account some tolerance under slight distortions in the data. Following this consideration, some FAS miners have been developed and applied in several domains of science. However, there are few works related to the application of these types of graph miners in classification tasks. In this paper, we propose a new framework for image classification, which uses FAS patterns as features. We also propose to compute automatically the substitution matrices needed in the process, instead of using expert knowledge. Our approach is tested in two real image collections showing that it obtains good results, comparable to other non-miner solutions reported, and that FAS mining is better than the exact approach for this task. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Acosta-Mendoza, N., Morales-González, A., Gago-Alonso, A., García-Reyes, E. B., & Medina-Pagola, J. E. (2012). Image classification using frequent approximate subgraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7441 LNCS, pp. 292–299). https://doi.org/10.1007/978-3-642-33275-3_36

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