Learning with Preknowledge: Clustering with Point and Graph Matching Distance Measures

Neural Computation

Volumn 8, Issue 4, 1996, Pages 787-804

  Gold, Steven ^a   Rangarajan, Anand ^b   Mjolsness, Eric ^c  

^a Yale University   (United States)

^b YALE UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004792112     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/neco.1996.8.4.787     Document Type: Article

References (29)

1. Bienenstock, E., and Doursat, R. 1991. Issues of representation in neural networks. In Representations of Vision: Trends and Tacit Assumptions in Vision Research, A. Gorea, ed. Cambridge University Press, Cambridge, England.
2. Buhmann, J., and Hofmann, T. 1994. Central and pairwise data clustering by competitive neural networks. In Advances in Neural Information Processing Systems 6, J. Cowan, G. Tesauro, and J. Alspector, eds., pp. 104-111. Morgan Kaufmann, San Mateo, CA.
3. Buhmann, J., and Kuhnel, H. 1993. Complexity optimized data clustering by competitive neural networks. Neural Comp. 5(1), 75-88.
4. Dempster, A. P., Laird, N. M., and Rubin, D. B. 1977. Maximum likelihood from incomplete data via the EM algorithm. J. R. Statist. Soc. Ser. B 39, 1-38.
5. Duda, R., and Hart, P. 1973. Pattern Classification and Scene Analysis. John Wiley, New York.
6. Geman, S., Bienenstock, E., and Doursat, R. 1992. Neural networks and the bias/variance dilemma. Neural Comp. 4(1), 1-58.
7. Gold, S., and Rangarajan, A. 1996. A Graduated Assignment Algorithm for Graph Matching. IEEE Trans. Patt. Anal. Mach. Intell. (In press.)
8. Gold, S., Mjolsness, E., and Rangarajan, A. 1994. Clustering with a domain specific distance measure. In Advances in Neural Information Processing Systems 6, J. Cowan, G. Tesauro, and J. Alspector, eds., pp. 96-103. Morgan Kaufmann, San Mateo, CA.
9. Gold, S., Lu, C. P., Rangarajan, A., Pappu, S., and Mjolsness, E. 1995. New algorithms for 2-D and 3-D point matching: Pose estimation and correspondence. In Advances in Neural Information Processing Systems 7, G. Tesauro, D. S. Touretzky, and T. K. Leen, eds., pp. 957-964. MIT Press, Cambridge, MA.
10. Grimson, E. 1990. Object Recognition by Computer: The Role of Geometric Constraints. MIT Press, Cambridge, MA.
11. Hathaway, R. 1986. Another interpretation of the EM algorithm for mixture distributions. Statist. Probability Lett. 4, 53-56.
12. Hopfield, J. J., and Tank, D. W. 1986. Collective computation with continuous variables. In Disordered Systems and Biological Organization, pp. 155-170. Springer-Verlag, Berlin.
13. Jain, A. K., and Dubes, R. C. 1988. Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs, NJ.
14. Jordan, M. I., and Jacobs, R. A. 1994. Hierarchical mixtures of experts and the EM algorithm. Neural Comp. 6(2), 181-214.
15. Kosowsky, J. J., and Yuille, A. L. 1994. The invisible hand algorithm: Solving the assignment problem with statistical physics. Neural Networks 7(3), 477-490.
16. Kurita, T., Sekita, I., and Otsu, N. 1994. Invariant distance measures for planar shapes based on complex autoregressive model. Patt. Recogn. 27(7), 903-911.
17. Mjolsness, E. 1993. Bayesian inference on visual grammars by relaxation nets. Unpublished manuscript.
18. Mjolsness, E. 1994. Connectionist grammars for high-level vision. In Artificial Intelligence and Neural Networks: Steps Toward Principled Integration, V. Honavar, and L. Uhr, eds., pp. 423-451. Academic Press, San Diego, CA.
19. Mjolsness, E., and Garrett, C. 1990. Algebraic transformations of objective functions. Neural Networks 3, 651-669.
20. Mjolsness, E., and Miranker, W. 1993. Greedy Lagrangians for Neural Networks: Three Levels of Optimization in Relaxation Dynamics. Tech. Rep. YALEU/DCS/ TR-945, Department of Computer Science, Yale University.
21. Peterson, C., and Soderberg, B. 1989. A new method for mapping optimization problems onto neural networks. Int. J. Neural Syst. 1(1), 3-22.
22. Rangarajan, A., and Mjolsness, E. 1994. A Lagrangian relaxation network for graph matching. In IEEE International Conference on Neural Networks (ICNN), Vol. 7, pp. 4629-4634. IEEE Press, New York.
23. Rangarajan, A., Gold, S., and Mjolsness, E. 1996. A novel optimizing network architecture with applications. Neural Comp. (in press).
24. Rose, K., Gurewitz, E., and Fox, G. 1990. Statistical mechanics and phase transitions in clustering. Phys. Rev. Lett. 65(8), 945-948.
25. Shepard, R. 1989. Internal representation of universal algorithms: A challenge for connectionism. In Neural Connections, Mental Computation, L. Nadel, L. Cooper, P. Culicover, and R. Harnish, eds., pp. 104-134. Bradford/MIT Press, Cambridge, MA.
26. Simard, P., le Cun, Y., and Denker, J. 1993. Efficient pattern recognition using a new transformation distance. In Advances in Neural Information Processing Systems 5, S. Hanson, J. Cowan, and C. Giles, eds., pp. 50-58. Morgan Kaufmann, San Mateo, CA.
27. von der Malsburg, C. 1988. Pattern recognition by labeled graph matching. Neural Networks, 1, 141-148.
28. Williams, C., Zemel, R., and Mozer, M. 1993. Unsupervised Learning of Object Models. Tech. Rep. AAAI Tech. Rep. FSS-93-04, Department of Computer Science, University of Toronto.
29. Yuille, A. L., and Kosowsky, J. J. 1994. Statistical physics algorithms that converge. Neural Comp. 6(3), 341-356.