Abstract
We present a practical implementation of a structural matching algorithm that uses the generalized deterministic annealing theory. The problem is formulated as follows: given a set of model points and object points, find a matching algorithm that brings the two sets of points into correspondence. An “energy” term represents the distance between the two sets of points. This energy has many local minima and the purpose is to escape from these local minima and to find the global minimum using the simulated annealing theory. We use a windowed implementation and a suitable definition of the energy function that reduces the computational effort of this annealing schedule without decreasing the solution quality.
Chapter PDF
References
S. Acton. A. Bovik, “Generalized deterministic annealing”. IEEE Transactions on Neural Networks May 1996
S. Gold, “A graduate assignment algorithm for graph matching”, IEEE Transactions on Pattern Anal. And Machine Intell. April 1996
A. Rangarajan, “A Lagrangian Relaxation Network for Graph Matching, IEEE Transactions on Neural Networks, Nov 1996
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Davlea, L. (2000). A Structural Matching Algorithm Using Generalized Deterministic Annealing. In: Ferri, F.J., Iñesta, J.M., Amin, A., Pudil, P. (eds) Advances in Pattern Recognition. SSPR /SPR 2000. Lecture Notes in Computer Science, vol 1876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44522-6_23
Download citation
DOI: https://doi.org/10.1007/3-540-44522-6_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67946-2
Online ISBN: 978-3-540-44522-7
eBook Packages: Springer Book Archive