Structural Pattern Recognition using Graph Matching
Approximate and Error-Tolerant Algorithms
- Publisher's listprice GBP 145.00
-
71 557 Ft (68 150 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 7 156 Ft off)
- Discounted price 64 402 Ft (61 335 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
71 557 Ft
Availability
Not yet published.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 1
- Publisher Chapman and Hall
- Date of Publication 30 September 2025
- ISBN 9781032850344
- Binding Hardback
- No. of pages250 pages
- Size 234x156 mm
- Language English
- Illustrations 54 Illustrations, black & white; 1 Halftones, black & white; 53 Line drawings, black & white; 20 Tables, black & white 700
Categories
Short description:
This book presents a comprehensive exploration of structural pattern recognition with a clear understanding of graph representation and manipulation.
More
Long description:
This book presents a comprehensive exploration of structural pattern recognition with a clear understanding of graph representation and manipulation. It explains graph matching techniques, unearthing the core principles of graph similarity measures, subgraph isomorphism, and advanced algorithms tailored to various pattern recognition tasks. It bridges the gap between theory and application by providing case studies, hands-on examples, and applications. It is a reference book for academicians, researchers, and students working in the fields of structural pattern recognition, computer vision, artificial intelligence, and data science.
• Begins with the fundamentals of graph theory, graph matching algorithms, and structural pattern recognition concepts and explains the principles, methodologies, and practical implementations
• Presents relevant case studies and hands-on examples across chapters to guide making informed decisions by graph matching
• Discusses various graph-matching algorithms, including exact and approximate methods, geometric methods, spectral techniques, graph kernels, and graph neural networks, including practical examples to illustrate the strengths and limitations of each approach
• Showcases the versatility of graph matching in real-world applications, such as image analysis, biological molecule identification, object recognition, social network clustering, and recommendation systems
• Describes deep learning models for graph matching, including graph convolutional networks (GCNs) and graph neural networks (GNNs)
MoreTable of Contents:
1. Introduction 2. Structural Pattern Recognition 3. Graph Matching Algorithms: A Survey 4. Graph Matching using Extensions to Graph Edit Distance 5. Graph Matching using Centrality Measures 6. Geometric Graph Matching 7. Graph Kernels and Embedding 8. Graph Matching in Image Analysis 9. Graph Matching in Social Network Analysis 10. Recent Advances and Future Directions. A. Graph Matching Tools
Bibliography
Index
