Graph based representations in pattern recognition : 4th IAPR international workshop, GbRPR 2003, York, UK, June 30-July 2, 2003 : proceedings
This volume contains the papers presented at the Fourth IAPR Workshop on Graph Based Representations in Pattern Recognition. The workshop was held at the King s Manor in York, England between 30 June and 2nd July 2003. The previous workshops in the series were held in Lyon, France (1997), Haindorf,...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
2726 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graph based representations in pattern recognition, 4th IAPR international workshop, GbRPR 2003, York, UK, June 30-July 2, 2003, proceedings, Edwin Hancock, Mario Vento (eds.), 2003, Berlin, Springer, 1 vol. (VIII-270 p.), Lecture notes in computer science, 3-540-40452-X • Graph Based Representations in Pattern Recognition, Texte imprimé, 9783662204719 |
Indholdsfortegnelse:
- Data Structures and Representation
- Construction of Combinatorial Pyramids
- On Graphs with Unique Node Labels
- Constructing Stochastic Pyramids by MIDES Maximal Independent Directed Edge Set
- Segmentation
- Functional Modeling of Structured Images
- Building of Symbolic Hierarchical Graphs for Feature Extraction
- Comparison and Convergence of Two Topological Models for 3D Image Segmentation
- Graph Edit Distance
- Tree Edit Distance from Information Theory
- Self-Organizing Graph Edit Distance
- Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification
- Graph Matching
- Orthonormal Kernel Kronecker Product Graph Mdatching
- Theoretical Analysis and Experimental Comparison of Graph Matching Algorithms for Database Filtering
- A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs
- Swap Strategies for Graph Matching
- Matrix Methods
- Graph Matching Using Spectral Seriation and String Edit Distance
- Graph Polynomials, Principal Pivoting, and Maximum Independent Sets
- Graph Partition for Matching
- Graph Clustering
- Spectral Clustering of Graphs
- Comparison of Distance Measures for Graph-Based Clustering of Documents
- Some Experiments on Clustering a Set of Strings
- A New Median Graph Algorithm
- Graph Clustering Using the Weighted Minimum Common Supergraph
- ACM Attributed Graph Clustering for Learning Classes of Images
- A Competitive Winner-Takes-All Architecture for Classification and Pattern Recognition of Structures.