Cliques, computation, and computational tractability

Pattern Recognition

Volumn 33, Issue 4, 2000, Pages 535-542

  Miller, Douglas A ^a,b   Zucker, Steven W ^a,c  

^a YALE UNIVERSITY   (United States)

^b INRIA   (France)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Complexity; Dynamical system; Early vision; Energy minimization; Game theory; Linear complementarity problem; Polymatrix games; Relaxation labeling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GAME THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; NEURAL NETWORKS;

LINEAR COMPLEMENTARITY PROBLEMS; RELAXATION LABELING;

EDGE DETECTION;

EID: 0033892074     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(99)00070-9     Document Type: Article

References (37)

1. S. Ullman, High Level Vision, MIT Press, Cambridge, MA, 1996.
2. P. Parent, S.W. Zucker, Trace inference, curvature consistency, and curve detection, IEEE Trans. Pattern Anal. Machine Intell. 11 (1989) 823-839.
3. S.W. Zucker, A. Dobbins, L. Iverson, Two stages of curve detection suggest two styles of visual computation, Neural Comput. 1 (1989) 68-81.
4. L. Iverson, S.W. Zucker, Logical/linear operators for image curves, IEEE Trans. Pattern Anal. Machine Intell. 17 (10) (1995) 982-996.
5. R.A. Hummel, S.W. Zucker, On the foundations of relaxation labeling processes, IEEE Trans. Pattern Anal. Machine Intell. PAMI-5 (1983) 267-287.
6. J.J. Hopfield, D.W. Tank, Neural compuation of decisions in optimatization problems, Biol. Cybernet. 52 (1985) 141-152.
7. D.J. Amit, Modeling Brain Function: the World of Attractor Neural Networks, Cambridge University Press, Cambridge, 1989.
8. M. Pelillo, The dynamics of nonlinear relaxation labeling processes, J. Math. Imag. Vision 7 (1997) 309-323.
9. D.A. Miller, S.W. Zucker, Copositive-plus Lemke algorithm solves polymatrix games, Oper. Res. Lett. 10 (1991) 285-290.
10. D.A. Miller, S.W. Zucker, Efficient simplex-like methods for equilibria of nonsymmetric analog networks, Neural Comput. 4 (1992) 167-190.
11. H.I. Bozma, J.S. Duncan, A game-theoretic approach to integration of modules, IEEE Trans. Pattern Anal. Machine Intell. 16 (1994) 1074-1086.
12. A. Chakraborty, J.S. Duncan, Game Theoretic Integration for Image Segmentation, IEEE Trans. Pattern Anal. Machine Intell. 21 (1999) 12-30.
13. S. Yu, M. Berthod, A game strategy approach for image labeling, Comput Vision Image Understanding 61 (1995) 32-37.
14. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation, Springer, New York, 1998.
15. T.J. Sejnowski, Skeleton filters in the brain, in: G.E. Hinton, J.A. Anderson (Eds.), Parallel Models of Associative Memory, Lawrence Erlbaum, Hillsdale, NJ, 1981.
16. J.J. Hopfield, Neurons with graded response have collective computational properties like those of two-state neurons, Proc. Natl. Acad. Sci. USA 81 (1984) 3088-3092.
17. L.M. Kirousis, C.H. Papadimitriou, The complexity of recognizing polyhedral scenes, J. Comput. System. Sci. 37 (1988) 14-38.
18. D.A. Miller, S.W. Zucker, Computing with self-excitatory cliques: a model and an application to hyperacuity-scale computation in visual cortex, Neural Comput. 11(1) (1999) 21-66.
19. D.A. Miller, S.W. Zucker, A model of hyperacuity-scale computation in visual cortex by self-excitatory cliques of pyramidal cells, Technical Report TR-CIM-93-13, Center for Intelligent Machines, McGill University, Montreal, August, 1994.
20. D. Miller, S.W. Zucker, Reliable computation and related games, in: M. Pelillo, E. Hancock (Eds.), Energy Minimization Methods in Computer Vision and Pattern Recognition, Lecture Notes in Computer Science, vol. 1223, Springer, Berlin, 1997, pp. 3-18.
21. G. Westheimer, The spatial grain of the perifoveal visual field, Vision Res. 22 (1982) 157-162.
22. G. Westheimer, S.P. McKee, Spatial configurations for visual hyperacuity, Vision Res. 17 (1977) 941-947.
23. D.O. Hebb, The Organization of Behaviour, Wiley, New York, 1949.
24. V. Braitenberg, Cell assemblies in the cerebral cortex, in: R. Heim, G. Palm (Eds.), Theoretical Approaches to Complex Systems, Lecture Notes in Biomathematics, vol. 21, Springer, New York, 1978, pp. 171-188.
25. V. Braitenberg, A. Schuez, Anatomy of the Cortex. Statistics and Geometry, Springer, Berlin, 1991.
26. G. Palm, Neural Assemblies: An Alternative Approach to Artificial Intelligence, Springer, Berlin, 1982.
27. R.J. Douglas, K.A.C. Martin, Neocortex, in: G.M. Shepherd (Ed.), The Synaptic Organization of the Brain, 3rd ed., Oxford University Press, New York, 1990, pp. 389-438.
28. R.J. Douglas, C. Koch, K.A.C. Martin, H. Suarez, Recurrent excitation in neocortical circuits, Science 269 (1995) 981-985.
29. E.F. Moore, C.E. Shannon, Reliable circuits using less reliable relays, J. Franklin Inst. 262 (1956) 191-208, 281-297.
30. S. Winograd, J.D. Cowan, Reliable Computation in the Presence of Noise, MIT Press, Cambridge, MA, 1963.
31. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979.
32. G.B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
33. M.W. Hirsch, S. Smale, Differential Equations, Dynamical Systems, and Linear Algebra, Academic Press, New York, 1974.
34. H.W. Kuhn, A.W. Tucker, Nonlinear programming, in: J. Neyman (Ed.), 2nd Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, CA, 1951, pp. 481-492.
35. K. Murty, Linear Complementarity, Linear and Nonlinear Programming, Heldermann, Berlin, 1988.
36. R.W. Cottle, J.-S. Pang, R. Stone, The Linear Complementarity Problem, Academic Press, New York, 1992.
37. C.E. Lemke, Bimatrix equilibrium points and mathematical programming, Management Sci. 11 (1965) 681-689.