Pattern recognition by homomorphic graph matching using Hopfield neural networks

摘要

The application of the Hopfield neural network as a constraint satisfaction network for pattern recognition is investigated in this paper. Suitable energy and compatibility functions are introduced for pattern recognition by homomorphic attributed relational graph (ARG) matching. Although many computer vision problems have been traditionally formulated as combinatorial optimization problems, most of them can be reduced to that of finding the nearest local minimum of an objective function. In this paper, a novel network initialization strategy is applied to achieve the desired complexity reduction. Further, a method to verify and localize the hypotheses generated by the Hopfield network is also presented using an efficient pose clustering algorithm. The performance of the connectionist approach to pattern recognition by homomorphic relational graph matching is demonstrated using a number of line patterns, silhouette images and circle patterns.