Table of Contents
13 relations: Attributed graph grammar, Computer vision, Digital image processing, Graph (discrete mathematics), Graph edit distance, Graph isomorphism problem, Image segmentation, Optimization problem, Pattern matching, Pattern recognition, Similarity measure, String-searching algorithm, Subgraph isomorphism problem.
Attributed graph grammar
In computer science, an attributed graph grammar is a class of graph grammar that associates vertices with a set of attributes and rewrites with functions on attributes.
See Graph matching and Attributed graph grammar
Computer vision
Computer vision tasks include methods for acquiring, processing, analyzing and understanding digital images, and extraction of high-dimensional data from the real world in order to produce numerical or symbolic information, e.g. in the forms of decisions.
See Graph matching and Computer vision
Digital image processing
Digital image processing is the use of a digital computer to process digital images through an algorithm.
See Graph matching and Digital image processing
Graph (discrete mathematics)
In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some sense "related".
See Graph matching and Graph (discrete mathematics)
Graph edit distance
In mathematics and computer science, graph edit distance (GED) is a measure of similarity (or dissimilarity) between two graphs. Graph matching and graph edit distance are computational problems in graph theory.
See Graph matching and Graph edit distance
Graph isomorphism problem
The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic. Graph matching and graph isomorphism problem are computational problems in graph theory.
See Graph matching and Graph isomorphism problem
Image segmentation
In digital image processing and computer vision, image segmentation is the process of partitioning a digital image into multiple image segments, also known as image regions or image objects (sets of pixels).
See Graph matching and Image segmentation
Optimization problem
In mathematics, engineering, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions.
See Graph matching and Optimization problem
Pattern matching
In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern.
See Graph matching and Pattern matching
Pattern recognition
Pattern recognition is the task of assigning a class to an observation based on patterns extracted from data.
See Graph matching and Pattern recognition
Similarity measure
In statistics and related fields, a similarity measure or similarity function or similarity metric is a real-valued function that quantifies the similarity between two objects.
See Graph matching and Similarity measure
String-searching algorithm
In computer science, string-searching algorithms, sometimes called string-matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text.
See Graph matching and String-searching algorithm
Subgraph isomorphism problem
In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H. Subgraph isomorphism is a generalization of both the maximum clique problem and the problem of testing whether a graph contains a Hamiltonian cycle, and is therefore NP-complete. Graph matching and subgraph isomorphism problem are computational problems in graph theory.
See Graph matching and Subgraph isomorphism problem
References
Also known as Inexact graph matching.