Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

IEEE Transactions on Computers

Volumn C-20, Issue 1, 1971, Pages 68-86

  Zahn, Charles T ^a  

^a SLAC NATIONAL ACCELERATOR LABORATORY   (United States)

Author keywords

Clustering; data structure analysis; evaluation; feature space; gestalt psychology; graph theory; minimal spanning trees; nearest neighbor methods; numerical taxonomy; pattern recognition

Indexed keywords

ITCOB; PATTERN RECOGNITION SYSTEMS;

EID: 0014976008     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1971.223083     Document Type: Article

References (43)

1. R.E. Bonner, “On some clustering techniques,” IBM J., pp. 22–32, January 1964.
2. A. Rosenfeld, Picture Processing by Computer. New York: Academic Press, 1969.
3. S.M. Pizer and H.G. Vetter, “Perception and processing of medical radioisotope scans,” in Pictorial Pattern Recognition. Washington, D.C.: Thompson Book Co., 1968, pp. 147–156.
4. A. Rosenfeld and J.L. Pfaltz, “Distance functions on digital pictures,” in Pattern Recognition, vol. I. New York: Pergamon Press, 1968, pp. 33–61.
5. R. Clark and W.F. Miller, “Computer based data analysis systems at Argonne,” Methods in Computational Physics, vol. V.
6. T.M. Cover and P.E. Hart, “Nearest neighbor pattern classification,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 21–23, January 1967.
7. G. Nagy, “State of the art in pattern recognition,” Proc. IEEE, vol. 56, pp. 836–862, May 1968.
8. A. G. Arkadev and E.M. Braverman, Computers and Pattern Recognition. Washington, D.C.: Thompson Book Co., 1967.
9. B. Julesz, “Visual pattern discrimination,” IRE Trans. Inform. Theory, vol. IT-8, pp. 84–92, February 1962.
10. R. Narasimhan, “Syntactic descriptions of pictures and gestalt phenomena of visual perception,” Digital Computer Lab., University of Illinois, Urbana, Ill., Rept. 142, July 1963.
11. J.B. Kruskal, Jr., “On the shortest spanning subtree of a graph and the traveling salesman problem,” Proc. Amer. Math. Soc., no. 7, pp. 48–50.1956.
12. R.C. Prim, “Shortest connection networks and some generalizations,” Bell Sys. Tech. J., 1389–1401, November 1957.
13. E.W. Dijkstra, “Some theorems on spanning subtrees of a graph,” Kon. Ned. Akad. Wetensch., Versl. Gewone Vergad. Afd. Natuurk., series A, vol. 63, no. 2
14. Indag. Math., vol. 22, no. 2, pp. 196–199, 1960.
15. R. Kalaba, “Graph theory and automatic control,” in Applied Combinatorial Mathematics. New York: Wiley, 1964, ch,. 8.
16. I. Pohl, “Bi-directional and heuristic search in path problems,” Stanford Linear Accelerator Center, Stanford University, Stanford, Calif., Rept. SLAC-104, pp. 111–115, May 1969.
17. J.M.S. Prewitt and M.L. Mendelsohn, “The analysis of cell images,” Ann. N.Y. Acad. Sci., no. 128, pp. 1035–1953, 1966.
18. G. H. Ball, “A comparison of some cluster-seeking techniques,” Stanford Res. Inst., Stanford, Calif., Tech. Rept. RADC-TR-66-514, November 1966.
19. H. Blum, “A transformation for extracting new descriptors of shape,” Models for the Perception of Speech and Visual Form. Cambridge, Mass.: M.I.T. Press, 1967, PP. 362–380.
20. W. Köhler. Gestalt Psychology. New York: Mentor Books. 1947.
21. J.E. Hochberg, Perception. Englewood Cliffs, N.J.: Prentice-Hall, 1964.
22. K. Koffka, Principles of Gestalt Psychology. New York: Harcourt, 1935.
23. W. Ellis, A Source Book of Gestalt Psychology. New York: Harcourt, 1938.
24. D. Beardsley and M. Wertheimer, Readings in Perception. Princeton, N.J.: Van Nostrand, 1958.
25. M. Wertheimer, “Laws of organization in perceptual forms,” in A Source Book of Gestalt Psychology, W. Ellis, Ed. New York: Harcourt, 1938.
26. K. Gottschaldt, “Gestalt factors and repetition,” in A Source Book of Gestalt Psychology, W. Ellis, Ed. New York: Harcourt, 1938.
27. M. Wertheimer, “Principles of perceptual organization,” in Readings in Perception, D. Beardsley and M. Wertheimer, Eds. Princeton, N.J.: Van Nostrand, 1958.
28. J.E. Hochberg, “Effects of the gestalt revolution: The Cornell symposium on perception,” in Readings in Perception, D. Beardsley and M. Wertheimer, Eds. Princeton, N.J.: Van Nostrand, 1958.
29. S.C. Johnson, “Hierarchical clustering schemes,” Psychometrika, vol. 32, pp. 241–254, September 1967.
30. C.T. Zahn, “A formal description for two-dimensional patterns,” Proc. Int. Joint Conf. on Artificial lntelligence, pp. 621–628, May 1969.
31. C.T. Zahn, “Two-dimensional pattern description and recognition via curvaturepoints,” Stanford Linear Accelerator Center, Stanford University, Stanford, Calif., RePt. SLAC-70, December 1966.
32. C. Abraham, “Evaluation of clusters on the basis of random graph theory,” IBM Corp., Yorktown Heights, N.Y., IBM Res. Memo, November 1962.
33. P.V.C. Hough, “Method and means for recognizing complex patterns,” U.S. Patent 3069 654. December 1962.
34. I.C. Ross and F. Harary, “Identification of the liaison persons of an organization using the structure matrix,” Management Sci., pp. 251–258, 1955.
35. C.T. Zahn. unpublished manuscript, 1969.
36. R.R. Sokal and P.H. Sneath, Principles of Numerical Taxonomy. San Francisco, Calif.: Freeman, 1963.
37. J.C. Gower and G.J.S. Ross, “Minimum spanning trees and single linkage cluster analysis,” Appl. Statistics, vol. 18, no. 1, pp. 54–64, 1969.
38. M. Minsky and S. Papert, Perceptrons. Cambridge, Mass.: M.I.T. Press, 1969, p. 233.
39. A. Rosenfeld, R.B. Thomas, and Y.H. Lee, “Edge and curve enhancement in digital pictures,” Computer Sci. Center, University of Maryland, College Park, Md., Tech. Rept. 69–93, May 1969.
40. R.A. Fisher, “Multiple measurements in taxonomic problems,” Contributions to Mathematical Statistics. New York: Wiley.
41. O. Ore, Theory of Graphs, Amer. Math. Soc. Colloquium Publ., vol. XXXVIII, 1962.
42. F. Attneave and M.D. Arnoult, “The quantitative study of shape and pattern perception,” Pattern Recognition, L. Uhr, Ed. New York: Wiley, 1966.
43. J.W. Sammon, Jr., “A nonlinear mapping for data structure analysis,” IEEE Trans. Computers, vol. C-18, pp. 401–409, May 1969.