Feature selection for graph-based image classifiers

26Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. We propose in this article to design binary classifiers capable to recognise some generic image categories. Images are represented by graphs of regions and we define a graph edit distance to measure the dissimilarity between them. Furthermore a feature selection step is used to pick in the image the most meaningful regions for a given category and thus have a compact and appropriate graph representation. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Le Saux, B., & Bunke, H. (2005). Feature selection for graph-based image classifiers. In Lecture Notes in Computer Science (Vol. 3523, pp. 147–154). Springer Verlag. https://doi.org/10.1007/11492542_19

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