Structural Pattern Recognition using Graph Matching: Approximate and Error-Tolerant Algorithms

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)