
Structural Pattern Recognition using Graph Matching
Approximate and Error-Tolerant Algorithms
- English
- ePUB (mobile friendly)
- Available on iOS & Android
Structural Pattern Recognition using Graph Matching
Approximate and Error-Tolerant Algorithms
About this book
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)
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover Page
- Half-Title Page
- Title Page
- Copyright Page
- Dedication Page
- Contents
- List of Figures
- List of Tables
- Preface
- Author Biography
- Symbol Description
- 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
- 11 Appendix: Graph Matching Tools
- Bibliography
- Index