• Aucun résultat trouvé

Graph-based pattern recognition and applications

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "Graph-based pattern recognition and applications"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Graph-based pattern recognition and applications

Roberto Marcondes CESAR JR.

1

Universidade de Sao Paulo, Brazil

Abstract.Structural pattern recognition plays a central role in many applications.

Recent advances include new theoretical results, methods and successful applica- tions. In the present talk, some recent graph-based methods for shape analysis will be shown. The presented methods include a new representation for graph-matching- based interactive segmentation and models for the analysis of spatial relations be- tween objects. Applications will be presented and discussed.

1E-mail: cesar@ime.usp.br

21

Références

Télécharger maintenant ( PDF - 1 Page - 36.50 KB )

Documents relatifs

Semantic image segmentation based on spatial relationships and inexact graph matching

This type of approach ignores the structural information that can be observed at a high level. This structural information can for example concern spatial relationships

Constraint-based Graph Matching

Let us consider for example the extended graph edit distance (EGED) defined in [14]. This distance extends GE D by adding two edit operations for splitting and merging nodes.

Truncated Lévy distributions in an inelastic gas

Nevertheless, Maxwell models constitute an ideal framework, due to their mathematical simplicity, in order to study non-trivial features of the Boltzmann equation, such

Segmentation and graph matching for online analysis of student arithmetic operations

The goal is to evaluate the analysis score improvement of using the new graph of lines representation over different sizes of graphs in relation to the number of operations reaching

The Maven Dependency Graph: a Temporal Graph-based Representation of Maven Central

1) Libraries maintenance: Java Libraries continuously evolve by releasing new versions with new functional- ity or enhanced performance. However, in some cases, clients decide not

A bottom-up method using texture features and a graph-based representation for lettrine recognition and classification

Subsequently, the obtained graphs, characterizing the involved lettrines, were compared using a graph dissimilarity for lettrine clustering according to their ornamental

A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition

On the other hand, explicit graph embedding methods explicitly embed an input graph into a feature vector and thus enable the use of all the method- ologies and techniques devised

Exacts and Inexacts methods for graph similarity in Structural Pattern Recognition

This thesis has been devoted in exploring two different methods to compute the similarity between graphs: the first is based on the subgraph isomorphism an exact graph matching