Graph Based Representations in Pattern Recognition 4th IAPR International Workshop, GbRPR 2003, York, UK, June 30 - July 2, 2003. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Hancock, Edwin (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Vento, Mario (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2726
• Θέματα: Pattern recognition.; Computer science.; Data structures (Computer science).; Computer science-Mathematics.; Computer graphics.; Pattern Recognition.; Science, Humanities and Social Sciences, multidisciplinary.; Computer Science, general.; Data Structures.; Discrete Mathematics in Computer Science.; Computer Graphics.

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), Haind...

Πίνακας περιεχομένων:

• 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.