3D shape retrieval using kernels on extended Reeb graphs
From MaRDI portal
Publication:898055
DOI10.1016/j.patcog.2013.03.019zbMath1326.68125OpenAlexW2024879305MaRDI QIDQ898055
Silvia Biasotti, Vincent Barra
Publication date: 8 December 2015
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2013.03.019
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Information storage and retrieval of data (68P20)
Related Items
Iterative 3D shape classification by online metric learning ⋮ An algorithm for weighted sub-graph matching based on gradient flows ⋮ The edit distance for Reeb graphs of surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A survey of graph edit distance
- Density-based 3D shape descriptors
- Size functions for comparing 3D models
- Graph matching using the interference of continuous-time quantum walks
- Reeb graphs for shape analysis and applications
- Efficient Computation of Isometry‐Invariant Distances Between Surfaces
- Discrete laplace operator on meshed surfaces
- A graph distance metric based on the maximal common subgraph
- Learning Theory and Kernel Machines
- THE AUGMENTED MULTIRESOLUTION REEB GRAPH APPROACH FOR CONTENT-BASED RETRIEVAL OF 3D SHAPES
- Theory of Reproducing Kernels
- Discrete Geometry for Computer Imagery