In this work we evaluate purely structural graph measures for 3D object classification. We extract spectral features from different Reeb graph representations and successfully deal with a multi-class problem. We use an information-theoretic filter for feature selection. We show experimentally that a small change in the order of selection has a significant impact on the classification performance and we study the impact of the precision of the selection criterion. A detailed analysis of the feature participation during the selection process helps us to draw conclusions about which spectral features are most important for the classification problem. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bonev, B., Escolano, F., Giorgi, D., & Biasotti, S. (2010). High-dimensional spectral feature selection for 3D object recognition based on reeb graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6218 LNCS, pp. 119–128). https://doi.org/10.1007/978-3-642-14980-1_11
Mendeley helps you to discover research relevant for your work.