Hierarchical Bag of Paths for Kernel Based Shape Classification

10/20/2008
by   François-Xavier Dupé, et al.
0

Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where until recently solely reserved to numerical data. Within the shape classification framework, graphs are often produced by a skeletonization step which is sensitive to noise. We propose in this paper to integrate the robustness to structural noise by using a kernel based on a bag of path where each path is associated to a hierarchy encoding successive simplifications of the path. Several experiments prove the robustness and the flexibility of our approach compared to alternative shape classification methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2017

Bag-of-Vector Embeddings of Dependency Graphs for Semantic Induction

Vector-space models, from word embeddings to neural network parsers, hav...
research
05/12/2017

Shape Classification using Spectral Graph Wavelets

Spectral shape descriptors have been used extensively in a broad spectru...
research
12/13/2014

A Framework for Shape Analysis via Hilbert Space Embedding

We propose a framework for 2D shape analysis using positive definite ker...
research
02/23/2020

Tree++: Truncated Tree Based Graph Kernels

Graph-structured data arise ubiquitously in many application domains. A ...
research
07/08/2018

Hierarchical Stochastic Graphlet Embedding for Graph-based Pattern Recognition

Despite being very successful within the pattern recognition and machine...
research
03/20/2018

Containment of Shape Expression Schemas for RDF

We study the problem of containment for shape expression schemas (ShEx) ...

Please sign up or login with your details

Forgot password? Click here to reset