EDITORIAL GRAPH MATCHING IN PATTERN RECOGNITION AND MACHINE VISION

摘要

In recent years there has been a renewed interest in the applications of the theory of graph matching, especially for problems in structural pattern recognition, image understanding, data mining and intelligent signal processing in general. This is partly due to the increase in computational power of modern computers as well as the emergence of new types of algorithms for solving inexact graph matching problems. Indeed, the activities of TC2, the technical committee on structural and syntactic pattern recognition (http://www.cs.ualberta.ca/~tcaelli/TC2/TC2.html), and the emergence of a new technical committee (TC15: http://www.iapr-tc15.unisa.it/) within the International Association for Pattern Recognition (IAPR: http://www.iapr.org/) is indicative of such interests in this area.