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

Name: Graph Based Representations in Pattern Recognition 4th IAPR International Workshop, GbRPR 2003, York, UK, June/July 2003 - Proceedings
Price: 55.56 USD
Availability: InStock
ISBN: 9783540404521

ISBN-10: 354040452X

ISBN-13: 9783540404521

Edition: 2003

Authors: Edwin Hancock, Mario Vento, International Association for Pattern Recognition Staff

List price: $99.00

30 day, 100% satisfaction guarantee!

Marketplace

2 new & used from $55.56

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

This book constitutes the refereed proceedings of the 4th IAPR International Workshop on Graph-Based Representation in Pattern Recognition, GbRPR 2003, held in York, UK in June/July 2003. The 23 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on data structures and representation, segmentation, graph edit distance, graph matching, matrix methods, and graph clustering.

Book details

List price: $99.00
Copyright year: 2003
Publisher: Springer
Publication date: 6/18/2003
Binding: Paperback
Pages: 276
Size: 6.00" wide x 9.75" long x 0.75" tall
Weight: 0.946
Language: English



Construction of Combinatorial Pyramids



On Graphs with Unique Node Labels



Constructing Stochastic Pyramids by MIDES - Maximal Independent Directed Edge Set



Functional Modeling of Structure Images



Building of Symbolic Hierarchical Graphs for Feature Extraction



Comparison and Convergence of Two Topological Models for 3D Image Segmentation



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



Orthonormal Kernel Kronecker Product Graph Matching



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



Graph Matching Using Spectral Seriation and String Edit Distance



Graph Polynomials, Principal Pivoting, and Maximum Independent Sets



Graph Partition for Matching



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



Author Index