Digital topology: Introduction and survey

Computer Vision, Graphics and Image Processing

Volumn 48, Issue 3, 1989, Pages 357-393

  Kong, T Y ^a   Rosenfeld, A ^b  

^a OHIO UNIVERSITY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BORDER FOLLOWING; CONNECTED COMPONENT LABELLING; CONTOUR FILLING; DIGITAL TOPOLOGY; DISCRETE ARRAYS; TWO-DIMENSIONAL THINNING;

IMAGE PROCESSING;

DIGITAL TOPOLOGY; IMAGE PROCESSING;

EID: 0024856991     PISSN: 0734189X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0734-189X(89)90147-3     Document Type: Short Survey

References (139)

1. Topological structure analysis of pictures by digital computer
2. Linear time algorithms for an image labelling machine
3. Dot pattern processing using Voronoi polygons as neighborhoods
4. Image representation using Voronoi tessellation
5. The boundary count of digital pictures
6. A condition for digital point removal
7. Pattern thinning by contour tracing
8. Parallel thinning of binary pictures
9. From local maxima to connected skeletons
10. On the sequential approach to medial line transformation
11. A thinning algorithm based on prominence detection
12. A width-independent fast thinning algorithm
13. The theory, design, implementation, and evaluation of a three-dimensional boundary detection algorithm
14. Improvements to a recent 3D-border algorithm
15. Counting regions, holes, and their nesting level in time proportional to the border
16. A thinning transform for digital images
17. Skeletons in derived grids
18. Computing the Euler characteristic and related additive functionals of digital objects from their bintree representation
19. Algorithms for the Euler characteristics and related functionals of digital objects
20. A transformation for extracting new descriptors of shape
21. Graph Theory: An Introductory Course
22. A grammar for the topological analysis of plane figures
23. An improved algorithm for the sequential extraction of boundaries from a raster scan
24. A one-pass thinning algorithm and its parallel implementation
25. An improved segmentation and coding algorithm for binary and non-binary images
26. Knight's distance in digital geometry
27. Thinning algorithms, a critique and a new methodology
28. On some preprocessing techniques for character recognition
29. Comments on a line thinning scheme
30. Toward isotropic image reduction
31. Thinning algorithms on rectangular hexagonal and triangular arrays
32. Computing the Euler number of an image from its quadtree
33. Thinning algorithms for grayscale pictures
34. Parallel syntactic thinning by recording of binary pictures
35. Hexagonal parallel pattern transformations
36. Local properties of binary images in two dimensions
37. Fast parallel thinning algorithms: Parallel speed and connectivity preservation
38. Uporiadochenie Topologicheskie Prostranstva
39. Dynamic boundary surface detection
40. A topological proof of a surface tracking algorithm
41. Linear skeletons from square cupboards
42. Comparison of thinning algorithms on a parallel processor
43. An improved parallel thinning algorithm
44. Connected component labelling in image processing with MIMD architectures
45. Digital connectedness, an algebraic approach
46. Pattern analysis of N-dimensional digital images
47. Topological structures in computer science
48. Motion, deformation and homotopy in finite spaces
49. Finite primitive and Euclidean spaces
50. The m-dimensional grid point space
51. Digital Topology with Applications to Image Processing
52. Polyhedral analogs of locally finite topological spaces
53. Continuous analogs of axiomatized digital surfaces
54. A theory of binary digital pictures
55. Characterizations of simply-connected finite polyhedra in 3-space
56. Discrete topology and contour definition
57. On the topology of discrete spaces
58. A thinning algorithm by contour generation
59. Connectivity issues in 2D and 3D images
60. Computing the Euler number of a 3D image
61. On shrinking binary patterns
62. Three-dimensional skeletonization, principle, and algorithm
63. A comment on “A fast parallel algorithm for thinning digital patterns”
64. A new connected components algorithm for virtual memory computers
65. Fast binary-image boundary extraction
66. A thinning algorithm based on contours
67. Some characterizations of city block distance
68. Surfaces in three-dimensional digital images
69. On the topological properties of quantized spaces I The notion of dimension
70. On the topological properties of quantized spaces II Connectivity and order of connectivity
71. SPTA: A proposed algorithm for thinning binary patterns
72. On the recognition of properties of three-dimensional pictures
73. Finding connected components and connected ones on a mesh connected parallel computer
74. Thinning and stroke segmentation for handwritten Chinese character recognition
75. Filling algorithms for raster graphics
76. A thinning algorithm for discrete binary images
77. An asynchronous thinning algorithm
78. Multidimensional logical transforms
79. Checking connectivity preservation properties of some types of picture processing operations
80. A parallel shrinking algorithm for binary patterns
81. On the characterization of simple closed surfaces in three-dimensional digital images
82. Recognition of surfaces in three-dimensional digital images
83. A topological characterization of thinning
84. Connectivity in digital pictures
85. Arcs and curves in digital pictures
86. Adjacency in digital pictures
87. A characterization of parallel thinning algorithms
88. A converse to the Jordan Curve Theorem for digital curves
89. Fuzzy digital topology
90. Digital topology
91. Three dimensional digital topology
92. On connectivity properties of grayscale pictures
93. The fuzzy geometry of image subsets
94. “Continuous” functions on digital pictures
95. A note on thinning
96. Digital geometry
97. Sequential operations in digital picture processing
98. Pattern recognition
99. An improved approach to connected component labelling of images
100. An O(log n) parallel connectivity algorithm
101. A theory of non-uniformly digitized binary pictures
102. Neighborhood coding of binary images for fast contour following and general binary array processing
103. Representation of three-dimensional digital images
104. Understanding the bin of parts
105. Some parallel thinning algorithms for digital pictures
106. Two discrete forms of the Jordan Curve Theorem
107. Topological structural analysis of digitized binary images by border following
108. A comparison of line-thinning algorithms from a digital geometry viewpoint
109. Linear time algorithm for finding a picture's connected components
110. Topological properties and topology-preserving transformation of a three-dimensional binary picture
111. Some results on computational topology
112. A parallel thinning algorithm for 3D pictures
113. A general scheme for constructing skeleton models
114. A 3D parallel skeletonwise thinning algorithm
115. Labelling connected components on a massively parallel tree machine
116. Boundary detection in multidimensions
117. Euler formulas and geometric modeling
118. CGT: A fast thinning algorithm implemented on a sequential computer
119. Address location on envelopes
120. Topological properties in digital binary pictures
121. A fast parallel algorithm for thinning digital patterns