Using graph distance in object recognition

Authors:
Ewa Kubicka;Grzegorz Kubicki;Ignatios Vakalis
Affiliations:
Department of Mathematics and Computer Science, Emory University, Atlanta, GA;Department of Mathematics and Computer Science, Emory University, Atlanta, GA;Department of Mathematics and Statistics, Western Michigan University, Kalamazoo, MI
Venue:
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Year:
1990

Citing 4
Cited 3

Three-dimensional object recognition

ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Graphs & digraphs (2nd ed.)

Graphs & digraphs (2nd ed.)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

Virtual Environments: Graphtracker: A topology projection invariant optical tracker

Computers and Graphics
Object recognition using wavelets, L-G graphs and synthesis of regions

Pattern Recognition
Ekfrasis: A Formal Language for Representing and Generating Sequences of Facial Patterns for Studying Emotional Behavior

Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the concept of the distance between graphs is applied to the problem of recognizing objects. An unknown object is represented by a graph H and from the data base of possible solutions {G1, …, Gn} (also graphs) we select the graph Gi for which the distance to H is the smallest. The graph Gi is the recognition of H. The distance between graphs is defined in terms of edge rotation and deletion. It is shown that this distance defines a metric on the space of all graphs. The bounds for distance between two graphs are given in terms of their sizes and the size of their greatest common subgraph. It is proved that finding a distance between two graphs is an NP-complete problem even for planar graphs. An algorithm based on exhaustive search utilizing the linear algorithm by Hopcroft and Wong for recognizing isomorphism of planar graphs with some stopping criteria to maintain polynomial complexity, is possible.