Hopfield neural network image matching based on hausdorff distance and chaos optimizing

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Due to its capability of high-speed information processing and uncertainty information processing, Feature point based Hopfield Neural Network image matching method has attracted considerable attention in recent years. However, there often exists much difference between two images, especially under the influences of distortion factors, thus the result of image matching is affected greatly. In addition, Hopfield Neural Network is often trapped in local minima, which gives an optimization solution with an unacceptable high cost. To overcome the defects mentioned above, in this paper, Hausdorff distance is used to measure the degree of the similarity of two images. Chaos is used to optimize the search process of Hopfield Neural Network, and a new energy formulation for general invariant matching is derived. Experimental results demonstrate the efficiency and the effectiveness of the proposed method. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Shi, Z., Feng, Y., Zhang, L., & Huang, S. (2005). Hopfield neural network image matching based on hausdorff distance and chaos optimizing. In Lecture Notes in Computer Science (Vol. 3497, pp. 848–853). Springer Verlag. https://doi.org/10.1007/11427445_136

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free