Get Free Shipping on orders over $79
Structural Pattern Recognition using Graph Matching : Approximate and Error-Tolerant Algorithms - Shri Prakash Dwivedi

Structural Pattern Recognition using Graph Matching

Approximate and Error-Tolerant Algorithms

By: Shri Prakash Dwivedi, Ravi Shankar Singh

eText | 30 September 2025 | Edition Number 1

At a Glance

eText


$118.80

or 4 interest-free payments of $29.70 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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)

on
Desktop
Tablet
Mobile

More in Artificial Intelligence

AI-Powered Search - Trey Grainger

eBOOK

HBR Guide to Generative AI for Managers : HBR Guide - Elisa Farri

eBOOK

AI : The End of Human Race - Alex Wood

eBOOK