4 search results - page 1 / 1 » Tree Covering within a Graph Kernel Framework for Shape Clas... |
ICIAP
2009
ACM
13 years 2 months ago
2009
ACM
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
CAIP
2009
Springer
13 years 8 months ago
2009
Springer
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junctio...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
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 u...
AGTIVE
2003
Springer
13 years 9 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...