Self-annealing and self-annihilation: Unifying deterministic annealing and relaxation labeling

Pattern Recognition

Volumn 33, Issue 4, 2000, Pages 635-649

  Rangarajan, Anand ^a,b  

^a YALE UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Deterministic annealing; Relaxation labeling; Self amplification; Self annealing; Self annihilation; Softassign; Softmax

Indexed keywords

ALGORITHMS; PATTERN MATCHING; SIMULATED ANNEALING;

DETERMINISTIC ANNEALING ALGORITHMS; RELAXATION LABELING ALGORITHMS; SELF-ANNEALING; SELF-ANNIHILATION;

COMPUTER VISION;

EID: 0033908649     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(99)00077-1     Document Type: Article

References (48)

1. R. Duda, P. Hart, Pattern Classification and Scene Analysis, Wiley, New York, NY, 1973.
2. A.L. Yuille, J.J. Kosowsky, Statistical physics algorithms that converge, Neural Comput. 6 (3) (1994) 341-356.
3. R. Hummel, S. Zucker, On the foundations of relaxation labeling processes, IEEE Trans. Pattern Anal. Mach. Intell. 5 (3) (1983) 267-287.
4. J.J. Hopfield, D. Tank, 'Neural' computation of decisions in optimization problems, Biol. Cybernet. 52 (1985) 141-152.
5. G. Parisi, Statistical Field Theory, Addison-Wesley, Redwood City, CA, 1988.
6. A.L. Yuille, Generalized deformable models, statistical physics, and matching problems, Neural Comput. 2 (1) (1990) 1-24.
7. K. Rose, E. Gurewitz, G. Fox, Constrained clustering as an optimization method, IEEE Trans. Pattern Anal. Mach. Intell. 15 (8) (1993) 785-794.
8. J.S. Bridle, Training stochastic model recognition algorithms as networks can lead to maximum mutual information estimation of parameters, in: D.S. Touretzky (Ed.), Advances in Neural Information Processing Systems 2, Morgan Kaufmann, San Mateo, CA, 1990, pp. 211-217.
9. A. Rangarajan, S. Gold, E. Mjolsness, A novel optimizing network architecture with applications, Neural Comput. 8 (5) (1996) 1041-1060.
10. A.P. Dempster, N.M. Laird, D.B. Rubin, Maximum likelihood from incomplete data via the EM algorithm, J. Roy Statist. Soc. Ser. B 39 (1997) 1-38.
11. A. Rosenfeld, R. Hummel, S. Zucker, Scene labeling by relaxation operations, IEEE Trans. Systems Man Cybernet 6 (6) (1976) 420-433.
12. S. Peleg, A new probabilistic relaxation scheme, IEEE Trans. Pattern Anal. Mach. Intell. 2 (4) (1980) 362-369.
13. O. Faugeras, M. Berthod, Improving consistency and reducing ambiguity in stochastic labeling: an optimization approach, IEEE Trans. Pattern Anal. Mach. Intell. 3 (4) (1981) 412-424.
14. E.R. Hancock, J. Kittler, Discrete relaxation, Pattern Recognition 23 (7) (1990) 711-733.
15. W.J. Christmas, J. Kittler, M. Petrou, Structural matching in computer vision using probabilistic relaxation, IEEE Trans. Pattern Anal. Mach. Intell. 17 (5) (1995) 749-764.
16. M. Pelillo, Learning compatibility coefficients for relaxation labeling processes, IEEE Trans. Pattern Anal. Mach. Intell. 16 (9) (1994) 933-945.
17. B. Kamgar-Parsi, B. Kamgar-Parsi, On problem solving with Hopfield networks, Biol. Cybernet. 62 (1990) 415-423.
18. T. Hofmann, J.M. Buhmann, Pairwise data clustering by deterministic annealing, IEEE Trans. Pattern Anal. Mach. Intell. 19 (1) (1997) 1-14.
19. A. Rangarajan, A.L. Yuille, S. Gold, E. Mjolsness, A convergence proof for the softassign quadratic assignment algorithm, Advances in Neural Information Processing Systems 9, MIT Press, Cambridge, MA, 1997, pp. 620-626.
20. C. Peterson, B. Soderberg, A new method for mapping optimization problems onto neural networks, Int. J. Neural Systems 1 (1) (1989) 3-22.
21. P.D. Simic, Constrained nets for graph matching and other quadratic assignment problems, Neural Comput. 3 (1991) 268-281.
22. S. Gold, A. Rangarajan, A graduated assignment algorithm for graph matching, IEEE Trans. Pattern Anal. Mach. Intell. 18 (4) (1996) 377-388.
23. D.E. Van den Bout, T.K. Miller III, Graph partitioning using annealed networks, IEEE Trans. Neural Networks 1 (2) (1990) 192-203.
24. A. Rangarajan, H. Chui, E. Mjolsness, S. Pappu, L. Davachi, P. Goldman-Rakic, J. Duncan, A robust point matching algorithm for autoradiograph alignment, Med. Image Anal. 4 (1) (1997) 379-398.
25. S. Gold, A. Rangarajan, C.P. Lu, S. Pappu, E. Mjolsness, New algorithms for 2-D and 3-D point matching: pose estimation and correspondence, Pattern Recognition 31 (8) (1998) 1019-1031.
26. D.E. Van den Bout, T.K. Miller III, Improving the performance of the Hopfield-Tank neural network through normalization and annealing, Biol. Cybernet. 62 (1989) 129-139.
27. P.D. Simic, Statistical mechanics as the underlying theory of 'elastic' and 'neural' optimisations, Network 1 (1990) 89-103.
28. D. Geiger, A.L. Yuille, A common framework for image segmentation, Int. J. Comput. Vision 6 (3) (1991) 227-243.
29. J.J. Kosowsky, A.L. Yuille, The invisible hand algorithm: solving the assignment problem with statistical physics, Neural Networks 7 (3) (1994) 477-490.
30. A. Rangarajan, E. Mjolsness, A Lagrangian relaxation network for graph matching, IEEE Trans. Neural Networks 7 (6) (1996) 1365-1381.
31. A.L. Yuille, P. Stolorz, J. Utans, Statistical physics, mixtures of distributions, and the EM algorithm, Neural Comput. 6 (2) (1994) 334-340.
32. W.J. Wolfe, M.H. Parry, J.M. MacMillan, Hopfield-style neural networks and the TSP, IEEE Int. Conf. on Neural Networks, vol. 7, IEEE Press, 1994, pp. 4577-4582.
33. A.H. Gee, R.W. Prager, Polyhedral combinatorics and neural networks, Neural Comput. 6 (1) (1994) 161-180.
34. K. Urahama, Gradient projection network: analog solver for linearly constrained nonlinear programming, Neural Comput. 8 (5) (1996) 1061-1074.
35. R. Sinkhorn, A relationship between arbitrary positive matrices and doubly stochastic matrices, Ann. Math. Statist. 35 (1964) 876-879.
36. A.K. Jain, R.C. Dubes, Algorithms for Clustering Data, Prentice-Hall, Englewood Cliffs, NJ, 1988.
37. J. Buhmann, T. Hofmann, Central and pairwise data clustering by competitive neural networks, in: J. Cowan, G. Tesauro, J. Alspector (Eds.), Advances in Neural Information Processing Systems 6, Morgan Kaufmann, San Francisco, CA, 1994, pp. 104-111.
38. L.S. Davis, Shape matching using relaxation techniques, IEEE Trans. Pattern Anal. Mach. Intell. 1 (1) (1979) 60-72.
39. L. Kitchen, A. Rosenfeld, Discrete relaxation for matching relational structures, IEEE Trans. Systems Man Cybernet. 9 (1979) 869-874.
40. S. Ranade, A. Rosenfeld, Point pattern matching by relaxation, Pattern Recognition 12 (1980) 269-275.
41. K. Price, Relaxation matching techniques - a comparison, IEEE Trans. Pattern Anal. Mach. Intell. 7 (5) (1985) 617-623.
42. M. Pelillo, On the dynamics of relaxation labeling processes, IEEE Int. Conf. on Neural Networks (ICNN), vol. 2, IEEE Press, 1994, pp. 606-1294.
43. M. Pelillo, A. Jagota, Relaxation labeling networks for the maximum clique problem, J. Artificial Neural Networks 2 (4) (1995) 313-328.
44. J. Kivinen, M. Warmuth, Additive versus exponentiated gradient updates for linear prediction, J. Inform. Comput. 132 (1) (1997) 1-64.
45. K. Urahama, Mathematical programming formulations for neural combinatorial optimization algorithms, J. Artificial Neural Networks 2 (4) (1996) 353-364.
46. J. Besag, On the statistical analysis of dirty pictures, J. Roy. Statist. Soc. B 48 (3) (1986) 259-302.
47. S. Geman, D. Geman, Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images, IEEE Trans. Pattern Anal. Mach. Intell. 6 (6) (1984) 721-741.
48. S. Li, H. Wang, K. Chan, M. Petrou, Minimization of MRF energy with relaxation labeling, J. Math. Imaging Vision 7 (2) (1997) 149-161.