Topology matching for fully automatic similarity estimation of 3D shapes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
An introduction to variable and feature selection
The Journal of Machine Learning Research
Clustering and Embedding Using Commute Times
IEEE Transactions on Pattern Analysis and Machine Intelligence
Reeb graphs for shape analysis and applications
Theoretical Computer Science
Pattern Analysis & Applications - Special Issue: Non-parametric distance-based classification techniques and their applications
Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Information Theory in Computer Vision and Pattern Recognition
Information Theory in Computer Vision and Pattern Recognition
Graph descriptors from B-matrix representation
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Information-geometric graph indexing from bags of partial node coverages
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Invariants of distance k-graphs for graph embedding
Pattern Recognition Letters
Hi-index | 0.00 |
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.