Dot Pattern Processing Using Voronoi Neighborhoods

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-4, Issue 3, 1982, Pages 336-343

  Ahuja, Narendra ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Clustering; computational complexity; dot patterns; Gabriel graph; k nearest neighbors; matching; minimal spanning tree; neighborhood; neighbors; perceptual boundary extraction; relative neighborhood graph; Voronoi tessellation

Indexed keywords

IMAGE PROCESSING;

EID: 0020125692     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.1982.4767255     Document Type: Article

References (43)

1. G. H. Ball, “Data analysis in the social sciences: What about the details?,” In Proc. 1965 Fall Joint Comput. Conf., AFIPS, 1965, pp. 533-559.
2. S. T. Bernard and W. B. Thompson, “Disparity analysis of images,” IEEE Trans. Pattern Anal. Machine Intell, vol. PAMI-2, pp. 333-340, July 1980.
3. J. Besag, “Spatial interaction and the statistical analysis of lattice patterns,” J. Royal Stat. Soc, Series B, vol. 36, no. 2, pp. 192-236,1974.
4. J. Besag, 9 “Statistical analysis of non-lattice data,” Statistician, vol. 24, no. 3, pp. 179-195.
5. L. S. Davis, “Shape matching using relaxation techniques,” IEEE Trans. Pattern Anal. Machine Intell, vol. PAMI-1, pp. 60-72, 1979.
6. J. Fairfield, “Contoured shape generation: Forms that people see in dot patterns,” in Proc. IEEE Conf. Syst.,Man, Cybern., 1979, pp. 60-64.
7. K. Fukunaga and W.L.G. Koontz, “A criterion and algorithm for grouping data,” IEEE Trans. Comput., vol. C-19, pp. 917-923, Oct. 1970.
8. I. Gitman, “A parameter free clustering model,” Pattern Recog., vol. 4, pp. 307-315, 1972.
9. J. C. Gower and G.J.S. Ross, “Minimum spanning trees and single linkage cluster analysis,” Appl. Statist, vol. 18, no. 1, pp. 54-64, 1969.
10. J. A. Hartigan, Clustering Algorithms. New York: Wiley, 1975.
11. L. J. Hubert, “Some applications of graph theory to clustering,” Psychometrika, vol. 39, pp. 283-309, 1974.
12. R. A. Jarvis and E. A. Patrick, “Clustering using a similarity measure based on shared near neighbors,” IEEE Trans. Comput., vol. C-22, pp. 1025-1034, Nov. 1973.
13. S. C. Johnson, “Hierarchical clustering schemes,” Psychometricka, vol. 32, pp. 241-252, Sept. 1967.
14. D. J. Kahl, “Sketch matching,” M. S. thesis, Dep. Comput. Sci., Univ. Maryland, College Park, 1978.
15. D. J. Kahl, A. Rosenfeld, and A. Danker, “Some experiments in point pattern matching,” Univ. Maryland, Comput. Sci. Tech. Rep. TR-690, Sept. 1978.
16. D. Lavine, B. A. Lambird, and L. N. Kanal, “Recognition of spatial point patterns,” in Proc. IEEE Conf. Pattern Recog. Image Processing, Dallas, TX, Aug. 3-5, 1981, pp. 49-53.
17. W.L.G. Koontz and K. Fukunaga, “A nonparametric valley-seeking technique for cluster analysis,” IEEE Trans. Comput, vol.C-21,pp. 171-178, 1972.
18. D. T. Lee, “Proximity and reachability in the plane,” Ph.D. dissertation, Coord. Sci. Lab., Univ. Illinois, Urbana, Rep. ACT-12, 1978.
19. J. F. O'Callaghan, “An alternative definition for neighborhood of a point,”IEEE Trans. Comput, vol. C-24, pp. 1121-1125, 1975.
20. J. F. O'Callaghan, “Human perception of homogeneous dot patterns,” Perception, vol. 3, pp. 33-45, 1974.
21. J. F. O'Callaghan, “Computing the perceptual boundaries of dot patterns,” Comput. Graphics Image Processing, vol. 3, pp. 141-162, 1974.
22. E. A. Patrick and L. Shen, “Interactive use of problem knowledge for clustering and decision making,” IEEE Trans. Comput, vol. C-20, pp. 216-222, Feb. 1971.
23. E. C. Pielou, Mathematical Ecology. New York: Wiley, 1977.
24. S. Ranade and A. Rosenfeld, “Point pattern matching by relaxation,” Univ. Maryland, Comput. Sci. Tech. Rep. TR-702, Oct. 1978.
25. C. A. Rogers, Packing and Covering (Math. Tract No. 54). London and New York: Cambridge Univ. Press, 1964.
26. A. Rosenfeld, R. Hummel, and S. W. Zucker, “Scene labeling by relaxation operations,” IEEE Trans. Syst., Man, Cybern., vol. SMC-6, pp. 420-433, 1976.
27. A. Rosenfeld and A. Kak, Digital Picture Processing. New York: Academic, 1976.
28. M. I. Shamos and D. Hoey, “Closest-point problems,” in Proc. 16th Annu. Symp. Foundations of Comput Sci, Oct. 1975, pp. 131-162.
29. R. Sibson, “The Dirichlet tessellation as an aid in data analysis,” Scandinavian J. Statist, vol. 7, pp. 14-20, 1980.
30. J. Simon, A. Checroun, and C. Roche, “A method of comparing two patterns independent of possible transformations and small distortions,” Pattern Recog., vol. 4, pp. 73-81, 1972.
31. P.H.A. Sneath, “A method for curve seeking from scattered points,” Comput J., vol. 9, pp. 383-391, 1966.
32. A. H. Thiessen, “Precipitation averages for large areas,” Mon. Weather Rev., vol. 39, pp. 1082-1084, 1911.
33. W. R. Tobler, “Linear operators applied to areal data,” in Display and Analysis of Spatial Data, J. C. Davis and M. J. McCullagh, Eds. New York: Wiley, 1975.
34. G. T. Toussaint, “The relative neighborhood graph of a finite planar set” Pattern Recog., vol. 12, pp. 261-268, Aug. 1980.
35. G. T. Toussaint, “Pattern recognition and geometrical complexity,” in Proc. 5th Int. Conf. Pattern Recog., Miami Beach, FL, Dec. 1980, pp. 1324-1347.
36. G. T. Toussaint and R. S. Poulsen, “Some new algorithms and software implementation methods for pattern recognition research,” presented at COMPSAC, Chicago, IL, Nov. 1979.
37. F.R.D. Velasco, “A method for the analysis of Gaussian-like clusters,” Univ. Maryland, Comput. Sci. Tech. Rep. TR-718, Jan. 1979.
38. F.R.D. Velasco and A. Rosenfeld, “Some methods for the analysis of sharply bounded clusters,” Univ. Maryland, Comput. Sci. Tech. Rep. TR-740, Mar. 1979.
39. G. Voronoi, “Nouvelles applications des parametres Continus a la theorie des formes quadratiques. Deuxieme memoire: Recherches sur les parallelloedres primitifs,” J. Reine Angew. Math., vol. 134, pp. 198-287, 1908.
40. C. T. Zahn, “Graph-theoretical methods for detecting and describing Gestalt clusters,” IEEE Trans. Comput., vol. C-20, pp. 68-86, 1971.
41. C. T. Zahn, “An algorithm for noisy template matching,” Proc. IFIP,1974, pp. 727-732.
42. S. W. Zucker, “Region growing: Childhood and adolescence,” Comput. Graphics Image Processing, vol. 5, pp. 382-399, 1976.
43. S. W. Zucker and R. A. Hummel, “Toward a low-level description of dot clusters: Labelling edge, interior and noise points,” Comput Graphics Image Processing, vol. 9, pp. 213-233, 1979.