Computer and Machine Vision: Theory, Algorithms, Practicalities (previously entitled
Machine Vision) clearly and systematically presents the basic methodology of computer and …

Inexact graph matching has been one of the significant research foci in the area of pattern
analysis. As an important way to measure the similarity between pairwise graphs error …

The field of pattern recognition is usually subdivided into the statistical and the structural
approach. Structural pattern recognition allows one to use powerful and flexible …

In recent years the use of graph based representation has gained popularity in pattern
recognition and machine learning. As a matter of fact, object representation by means of …

In recent years, the use of graph based object representation has gained popularity.
Simultaneously, graph edit distance emerged as a powerful and flexible graph matching …

Graph edit distance is an error tolerant matching technique emerged as a powerful and
flexible graph matching paradigm that can be used to address different tasks in pattern …

This paper describes an efficient algorithm for inexact graph matching. The method is purely
structural, that is, it uses only the edge or connectivity structure of the graph and does not …

Techniques are provided for searching on three dimensional (3D) objects across large,
distributed repositories of 3D mod els. 3D shapes are created for input to a search system; …

Graph edit distance is one of the most flexible mechanisms for error-tolerant graph matching.
Its key advantage is that edit distance is applicable to unconstrained attributed graphs and …

Graph edit distance is a powerful and flexible method for error-tolerant graph matching. Yet it
can only be calculated for small graphs in practice due to its exponential time complexity …