Digital disks and a digital compactness measure

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1984, Pages 117-124

  Kim, Chul E ^a   Anderson, Timothy A ^a  

^a WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

Algorithm; Compactness; Digital convexity; Digital disk; Digital region

Indexed keywords

ALGORITHMS;

COMPACTNESS; DIGITAL CONVEXITY; DIGITAL DISK; DIGITAL REGION; TIME ALGORITHMS;

COMPUTATION THEORY;

EID: 84936547701     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800057.808673     Document Type: Conference Paper

References (9)

1. [Ha] R. M. Haralick, 'A measure for circularity of digital figures, ' IEEE Trans. SMC vol. SMC-4, 394-396.
2. [HO] L. Hodes, 'Discrete approximation of continuous convex blobs, ' SIAM J. Appl. Math. 19-2(1970), 477-485.
3. [K1] C. E. Kim, 'On the cellular convexity of complexes, ' IEEE Trans. PAMI vol. PAMI-3(1981), 617-625.
4. [K2] C. E. Kim, 'Digital convexity, straightness and convex polygons, ' IEEE Trans. PAMI vol. PAMI-4(1982), 618-626.
5. [KR] C. E. Kim and A. Rosenfeld, 'Digital straightness and convexity, ' Proc. ACM Symp. on Theory of Computing (1981), 80-89.
6. [R] A. Rosenfeld, 'Connectivity in digital pictures, ' JACM 17(1970), 146-160.
7. [RK] A. Rosenfeld and A. C. Kak, Digital Picture Processing, Academic Press, New York, 1976.
8. [RKi] A. Rosenfeld and C. E. Kim, 'How a digital computer can tell whether a line is straight.' Amer. Math. Monthly vol. 89(1982), 230-235.
9. [s] J. Sklansky, 'Recognition of convex blobs, ' Pattern Recognition 2(1970), 3-10.