Thinning methodologies—a comprehensive survey

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 14, Issue 9, 1992, Pages 869-885

  Lam, Louisa ^a   Lee, Seong Whan ^b  

^a Gina Cody School of Engineering and Computer Science   (Canada)

^b Chungbuk National University   (South Korea)

Author keywords

Parallel thinning; sequential thinning; skeleton; skeletonization; thinning

Indexed keywords

ALGORITHMS; PATTERN RECOGNITION;

ITERATIVE THINNING; PIXELS; THINNING ALGORITHMS;

IMAGE PROCESSING;

EID: 0026925546     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.161346     Document Type: Article

References (138)

1. W. H. Abdulla, A. O. M. Saleh, and A. H. Morad, “A preprocessing algorithm for handwritten character recognition,” Pattern Recogn. Lett., vol. 7, no. 1, pp. 13–18, 1988.
2. T. M. Alcorn and C. W. Hoggar, “Preprocessing of data for character recognition,” Marconi Rev., vol. 32, pp. 61–81, 1969.
3. C. J. Ammann and A. G. Sartori-Angus, “Fast thinning algorithm for binary images,” Image Vision Comput., vol. 3, no. 2, pp. 71–79, 1985.
4. C. Arcelli, L. Cordelia, and S. Levialdi, “Parallel thinning of binary pictures,” Electron. Lett., vol. 11, no. 7, pp. 148–149, 1975.
5. C. Arcelli and G. Sanniti di Baja, “On the sequential approach to medial line transformation,” IEEE Trans. Syst. Man Cybern., vol. SMC-8, no. 2, pp. 139–144, 1978.
6. C. Arcelli, “A condition for digital points removal,” Signal Processing, vol. 1, no. 4, pp. 283–285, 1979.
7. C. Arcelli and G. Sanniti di Baja, “Medial lines and figure analysis,” in Proc. 5th Int. Conf. Pattern Recogn., 1980, pp. 1016–1018.
8. C. Arcelli and G. Sanniti di Baja, “A thinning algorithm based on prominence detection,” Pattern Recogn., vol. 13, no. 3, pp. 225–235, 1981.
9. C. Arcelli, L. P. Cordella, and S. Levialdi, “From local maxima to connected skeletons,” IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-3, no. 2, pp. 134–143, 1981.
10. C. Arcelli, “Pattern thinning by contour tracing,” Comput. Graphics Image Processing, vol. 17, pp. 130–144, 1981.
11. C. Arcelli and G. Sanniti di Baja, “Finding multiple pixels,” in Image Analysis and Processing (V. Cantoni, S. Levialdi, and G. Musso, Eds.). New York: Plenum, 1986, pp. 137–144.
12. C. Arcelli and G. Sanniti di Baja, “On the simplicity of digital curves and contours,” in Proc. 8th Int. Conf. Patt. Recogn. (Paris, France), 1986, pp. 283–285.
13. C. Arcelli and G. Sanniti di Baja, “A contour characterization for multiply connected figures,” Patt. Recogn. Lett., vol. 6, no. 4, pp. 245–249, 1987.
14. C. Arcelli and G. Sanniti di Baja, “A one-pass two-operation process to detect the skeletal pixels on the 4-distance transform,” IEEE Trans. Patt. Anal. Machine Intell., vol. 11, no. 4, pp. 411–414, 1989.
15. O. Baruch, “Line thinning by line following,” Patt. Recogn. Lett., vol. 8, no. 4, pp. 271–276, 1988.
16. H. Beffert and R. Shinghal, “Skeletonizing binary patterns on the homogeneous multiprocessor,” Patt. Recogn. Artificial Intell., vol. 3, no. 2, pp. 207–216, 1989.
17. A. Bel-Lan and L. Montoto, “A thinning transform for digital images,” Signal Processing, vol. 3, no. 1, pp. 37–47, 1981.
18. M. Beun, “A flexible method for automatic reading of handwritten numerals,” Philips Tech. Rev., vol. 33, no. 5, pp. 89-101; 130–137, 1973.
19. F. L. Bookstein, “The line-skeleton,” Comput. Graphics Image Processing, vol. 11, pp. 123–137, 1979.
20. N. G. Bourbakis, “A parallel-symmetric thinning algorithm,” Patt. Recogn., vol. 22, no. 4, pp. 387–396, 1989.
21. Y.-S. Chen and W.-H. Hsu, “A modified fast parallel algorithm for thinning digital patterns,” Pattern Recogn. Lett., vol. 7, no. 2, pp. 99–106, 1988.
22. Y.-S. Chen and W.-H. Hsu, “A systematic approach for designing 2-subcycle and pseudo 1-subcycle parallel thinning algorithms,” Patt. Recogn., vol. 22, no. 3, pp. 267–282, 1989.
23. Y.-S. Chen and W.-H. Hsu, “A 1-subcycle parallel thinning algorithm for producing perfect 8-curves and obtaining isotropic skeleton of an L-shape pattern,” in Proc. Int. Conf. Comput. Vision Patt. Recogn. (San Diego, CA), 1989, pp. 208–215.
24. Y.-S. Chen and W.-H. Hsu, “A comparison of some one-pass parallel thinnings,” Patt. Recogn. Lett., vol. 11, no. 1, pp. 35–41, 1990.
25. R. T. Chin, H.-K. Wan, D. L. Stover, and R. D. Iverson, “A one-pass thinning algorithm and its parallel implementation,” Comput. Vision Graphics Image Processing., vol. 40, pp. 30–40, 1987.
26. Y. K. Chu and C. Y. Suen, “An alternative smoothing and stripping algorithm for thinning digital binary patterns,” Signal Processing, vol. 11, no. 3, pp. 207–222, 1986.
27. N. Chuei, T. Y. Zhang, and C. Y. Suen, “New algorithms for thinning binary images and Chinese characters,” Comput. Processing Chinese Oriental Languages, vol. 2, no. 3, pp. 169–179, 1986.
28. C. H. Cox, P. Coueignoux, B. Blesser, and M. Eden, “Skeletons: A link between theoretical and physical letter descriptions,” Pattern Recogn., vol. 15, no. 1, pp. 11–22, 1982.
29. E. R. Davies and A. P. N. Plummer, “A new method for the compression of binary picture data,” in Proc. 5th Int. Conf. Patt. Recogn., 1980, pp. 1150–1152.
30. E. R. Davies and A. P. N. Plummer, “Thinning algorithms: A critique and a new methodology,” Pattern Recogn., vol. 14, no. 1, pp. 53–63, 1981.
31. J.-D. Dessimoz, “Specialized edge-trackers for contour extraction and line-thinning,” Signal Processing, vol. 2, no. 1, pp. 71–73, 1980.
32. E. S. Deutsch, “Preprocessing for character recognition,” in Proc. IEEE NPL Conf. Patt. Recogn. (Teddington), 1968, pp. 179–190.
33. E. S. Deutsch, “Comments on a line thinning scheme,” Comput. J., vol. 12, 1969, p. 412.
34. E. S. Deutsch, “Toward isotropic image reduction,” in Proc. IFIP Congress (Ljubljana, Yugoslavia), 1971, pp. 161–172.
35. E. S. Deutsch, “Thinning algorithms on rectangular, hexagonal, and triangular arrays,” Comm. ACM, vol. 15, no. 9, pp. 827–837, 1972.
36. A. R. Dill, M. D. Levine, and P. B. Noble, “Multiple resolution skeletons,” IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-9, no. 4, pp. 495–504, 1987.
37. G. P. Dinnen, “Programming pattern recognition,” in Proc. West. Joint Comput. Conf (New York), 1955, pp. 94–100.
38. R. O. Duda, P. E. Hart, and J. H. Munson, “Graphical-data-processing research study and experimental investigation,” AD650926, pp. 28–30, Mar. 1967.
39. U. Eckhardt, “A note on Rutovitz’ method for parallel thinning,” Patt. Recogn. Lett., vol. 8, no. 1, pp. 35–38, 1988.
40. U. Eckhardt and G. Maderlechner, “Thinning algorithms for document processing systems,” in Proc. IAPR Workshop Comput. Vision: Spec. Hardware Ind. Applications (Tokyo, Japan), 1988, pp. 169–172.
41. A. Favre and H. Keller, “Parallel syntactic thinning by recoding of binary pictures,” Comput. Vision Graphics Image Processing, vol. 23, pp. 99–112, 1983.
42. G. Feigin and N. Ben-Yosef, “Line thinning algorithm,” Proc. SPIE, vol. 397, pp. 108–112, 1984.
43. G. E. Forsen, “Processing visual data with an automaton eye,” in Pictorial Pattern Recognition (G. C. Cheng, R. S. Ledley, D. K. Pollock, and A. Rosenfeld, Eds.). Washington DC: Thompson, 1968, pp. 471–502.
44. J. G. Fraser, “Further comments on a line thinning scheme,” Comput. J., vol. 13, pp. 221–222, 1970.
45. G. Gallus and P. W. Neurath, “Improved computer chromosome analysis incorporating preprocessing and boundary analysis,” Phys. Med. Biol, vol. 15, no. 3, pp. 435–445, 1970.
46. R. C. Gonzalez and P. Wintz, “The skeleton of a region,” in Digital Image Processing. Reading, MA: Addison-Wesley, 1987, pp. 398–402.
47. V. K. Govindan and A. P. Shivaprasad, “A pattern adaptive thinning algorithm,” Pattern Recogn., vol. 20, no. 6, pp. 623–637, 1987.
48. F. C. A. Groen and N. J. Foster, “A fast algorithm for cellular logic operations on sequential machines,” Pattern Recogn. Lett., vol. 2, no. 5, pp. 333–338, 1984.
49. Z. Guo and R. W. Hall, “Parallel thinning with two-subiteration algorithms,” Comm. ACM, vol. 32, no. 3, pp. 359–373, 1989.
50. R. W. Hall, “Fast parallel thinning algorithms: Parallel speed and connectivity preservation,” Comm. ACM, vol. 32, no. 1, pp. 124—131, 1989.
51. C. J. Hilditch, “An application of graph theory in pattern recognition,” in Machine Intell., (B. Meltzer and D. Michie, Eds.). New York: Amer. Elsevier, 1968, pp. 325–347, vol. 3.
52. C. J. Hilditch, “Linear skeletons from square cupboards,” in Machine Intell. (B. Meltzer and D. Michie, Eds.). New York: Amer. Elsevier, 1969, pp. 403–420, vol. 4.
53. C. J. Hilditch, “Comparison of thinning algorithms on a parallelprocessor,” Image Vision Comput., vol. 1, no. 3, pp. 115–132, 1983.
54. C. M. Holt, A. Stewart, M. Clint, and R. H. Perrott, “An improved parallel thinning algorithm,” Comm. ACM, vol. 30, no. 2, pp. 156–160, 1987.
55. C. Holt and A. Stewart, “A parallel thinning algorithm with fine grain subtasking,” Parallel Comput., vol. 10, pp. 329–334, 1989.
56. S. H. Y. Hung and T. Kasvand, “Critical points on a perfectly 8-or 6-connected thin binary line,” Pattern Recogn., vol. 16, no. 3, pp. 297–306, 1983.
57. M. I. Izutsdkiver, “Algorithm for the initial processing of an ensemble of symbols in the recognition process,” Auto. Remote Contr., vol. 35, no. 8, pp. 1292–1298, 1974.
58. N. Izzo and W. Coles, “Blood-cell scanner identifies rare cells,” Electron., vol. 35, pp. 52–55, Apr. 1962.
59. R. N. Jones and M. C. Fairhurst, “Skeletonisation of binary patterns: A heuristic approach,” Electron. Lett., vol. 14, no. 9, pp. 265–266, 1978.
60. K. Kedem and D. Keret, “A fast algorithm for skeletonizing lines by midline technique,” in Proc. Int. Comput. Sci. Conf, (Hong Kong), 1988, pp. 731–735.
61. R. A. Kirsch, L. Cahn, C. Ray, and G. J. Urban, “Experiments inpro-cessing pictorial information with a digital computer,” in Proc. East. Joint Comput. Conf. (New York), 1957, pp. 221–229.
62. T. Y. Kong and A. Rosenfeld, “Digital topology: Introduction and survey,” Comput. Vision Graphics Image Processing, vol. 48, pp. 357–393, 1989.
63. J. T. Kuehn, J. A. Fessler, and H. J. Siegel, “Parallel image thinning and vectorization on PASM,” in Proc. Int. Conf. Comput. Vision Patt. Recogn., 1985, pp. 368–374.
64. P. C. K. Kwok, “A thinning algorithm by contour generation,” Comm. ACM, vol. 31, no. 11, pp. 1314–1324, 1988.
65. P. C. K. Kwok, “Customising thinning algorithms,” in Proc. IEEE Int. Conf. Image Processing Applications, 1989, pp. 633–637.
66. P. C. K. Kwok, “Thinning in a distributed environment,” in Proc. 10th Int. Conf. Patt. Recogn. (Atlantic City, NJ), 1990, pp. 694–699.
67. L. Lam and C. Y. Suen, “Structural classification and relaxation matching of totally unconstrained handwritten Zip-code numbers,” Patt. Recogn., vol. 21, no. 1, pp. 19–31, 1988.
68. C. Lantuejoul, “Skeletonization in quantitative metallography,” in Issues in Digital Image Processing (R. M. Haralick and J. C. Simon, Eds.). Amsterdam: Sijthoff and Noordoff, 1980, pp. 107–135.
69. Y. Le Cun et al., “Handwritten digit recognition: Applications of neural network chips and automatic learning,” IEEE Commun. Mag., pp. 41–46, Nov. 1989.
70. P. S. P. Wang, “An improved fast parallel thinning algorithm for digital patterns,” in Proc. Int. Conf Comput. Vision Patt. Recogn.(San Francisco), 1985, pp. 364–367.
71. P. S. P. Wang, “A comment on a fast parallel algorithm for thinning digital patterns,” Comm. ACM, vol. 29, no. 3, pp. 239–242, 1986.
72. M. P. Martinez-Perez, J. Jimenez, and J. L. Navalon, “A thinning algorithm based on contours,” Comput. Vision Graphics Image Processing, vol. 38, pp. 186–201, 1987.
73. B. H. McCormick, “The Illinois pattern recognition computer—Illiac III,” IEEE Trans. Electron. Comput., vol. EC-12, no. 6, pp. 791–813, 1963.
74. B. Moayer and K. S. Fu, “A syntactic approach to fingerprint pattern recognition,” Pattern Recogn., vol. 7, pp. 1–23, 1975.
75. J. L. Mundy and R. E. Joynson, “Automatic visual inspection using syntactic analysis,” in Proc. Int. Conf. Patt. Recogn. Image Processing, 1977, pp. 144–147.
76. I. S. N. Murthy and K. J. Udupa, “A search algorithm for skeletonization of thick patterns,” Comput. Graphics Image Processing, vol. 3, pp. 247–259, 1974.
77. N. J. Naccache and R. Shinghal, “STPA: A proposed algorithm for thinning binary patterns,” IEEE Trans. Syst. Man Cybern., vol. SMC-14, no. 3, pp. 409–418, 1984.
78. N. J. Naccache and R. Shinghal, “An investigation into the skeletonization approach of Hilditch,” Pattern Recogn., vol. 17, no. 3, pp. 279–284, 1984.
79. N. J. Naccache and R. Shinghal, “In response to ’A comment on an investigation into the skeletonization approach to Hilditch,”’ Patt. Recogn., vol. 19, no. 2, p. III, 1986.
80. A. Nakayama, F. Kimura, Y. Yoshida, and T. Fukumura, “An efficient thinning algorithm for large scale images based upon pipeline structure,” in Proc. 7th Int. Conf. Patt. Recogn. (Montreal), 1984, pp. 1184–1187.
81. T. V. Nguyen and J. Sklansky, “A fast skeleton-finder for coronary arteries,” in Proc. 8th Int. Conf. Patt. Recogn. (Paris, France), 1986, pp. 481—483.
82. H. Ogawa and K. Taniguchi, “Thinning and stroke segmentation for handwritten Chinese character recognition,” Patt Recogn., vol. 15, no. 4, pp. 299–308, 1982.
83. J. F. O’Callaghan and J. Loveday, “Quantitative measurement of soil cracking patterns,” Patt. Recogn., vol. 5, pp. 83–98, 1973.
84. L. O’Gorman, “k x k thinning,” Comput. Vision Graphics Image Processing, vol. 51, pp. 195–215, 1990.
85. T. Pavlidis, “A thinning algorithm for discrete binary images,” Comput. Graphics Image Processing, vol. 13, pp. 142–157, 1980.
86. T. Pavlidis, “A flexible parallel thinning algorithm,” in Proc. Int. Conf. Patt. Recog. Image Processing (Dallas, TX), 1981, pp. 162–167.
87. T. Pavlidis, Algorithms for Graphics and Image Processing. Rockville, MD: Comput. Sci., 1982, pp. 195–214.
88. T. Pavlidis, “An asynchronous thinning algorithm,” Comput. Graphics Image Processing, vol. 20, pp. 133–157, 1982.
89. T. Pavlidis, “A vectorizer and feature extractor for document recognition,” Comput. Vision Graphics Image Processing, vol. 35, pp. 111–127, 1986.
90. E. Persoon and K. S. Fu, “Shape discrimination using Fourier descriptors,” IEEE Trans. Syst., Man Cybern., vol. SMC-7, no. 3, pp. 170–179, 1977.
91. J. Piper, “Efficient implementation of skeletonisation using interval coding,” Patt. Recogn. Lett., vol. 3, no. 6, pp. 389–397, 1985.
92. R. Plamondon and C. Y. Suen, “On the definition of reference skeletons for comparing thinning algorithms,” in Proc. Vision Interface 1988 (Edmonton, Canada), 1988, pp. 70–75.
93. R. Plamondon and C. Y. Suen, “Thinning of digitized characters from subjective experiments: A proposal for a systematic evaluation protocol of algorithms,” in Computer Vision and Shape Recognition (A. Krzyzak, T. Kasvand, and C. Y. Suen, Eds.). Singapore: World Scientific, 1989, pp. 261–272.
94. K. Preston, “The CELLSCAN system—A leucocyte pattern analyzer,” in Proc. West. Joint Comput. Conf. (Los Angeles, CA), 1961, pp. 173–183.
95. K. Preston, M. J. B. Duff, S. Levialdi, P. E. Norgren, and J.-I. Toriwaki, “Basics of cellular logic with some applications in medical image processing,” Proc. IEEE, vol. 67, no. 5, pp. 826–857, 1979.
96. M. C. Rahier and P. G. A. Jespers, “Dedicated LSI for a microprocessor controlled hand carried OCR system,” IEEE J. Solid-State Circuits, vol. SC-15, no. 1, pp. 14–24, 1980.
97. S. Riazanoff, B. Cervelle, and J. Chorowicz, “Parametrisable skeletonization of binary and multilevel images,” Patt. Recogn. Lett., vol. 11, no. 1, pp. 25–33, 1990.
98. A. Rosenfeld and J. L. Pfaltz, “Sequential operations in digital picture processing,” J. ACM, vol. 13, no. 4, pp. 471–494, 1966.
99. A. Rosenfeld, “Connectivity in digital pictures,” J. ACM, vol. 17, no. 1, pp. 146–160, 1970.
100. A. Rosenfeld, “A characterization of parallel thinning algorithms,” Inform. Contr., vol. 29, no. 3, pp. 286–291, 1975.
101. A. Rosenfeld and L. S. Davis, “A note on thinning,” IEEE Trans. Syst. Man Cybern., vol. 25, pp. 226–228, 1976.
102. A. Rosenfeld and A. C. Kak, Digital Picture Processing (2nd ed.). New York: Academic, 1982, vol. II, ch. 11.
103. D. Rutovitz, “Pattern recognition,” J. Roy. Stat. Soc., vol. 129, Series A, pp. 504–530, 1966.
104. P. Saraga and D. J. Woollons, “The design of operators for pattern processing,” in Proc. IEEE NPL Conf. Patt. Recogn. (Teddington), 1968, pp. 106–116.
105. B. Shapiro, J. Pisa, and J. Sklansky, “Skeletons from sequential boundary data,” in Proc. Int. Conf Patt. Recog. Image Processing (Chicago, IL), 1979, pp. 265–270.
106. B. Shapiro, J. Pisa, and J. Sklansky, “Skeleton generation from x,y boundary sequences,” Comput. Graphics Image Processing, vol. 15, pp. 136–153, 1981.
107. H. Sherman, “A quasitopological method for the recognition of line patterns.” in Proc. Int. Conf. on Inform. Processing (Paris, France), 1959, pp. 232–238.
108. R. M. K. Sinha, “Primitive recognition and skeletonization via labeling,” in Proc. Int. Conf Syst. Man Cybern. (Halifax, Canada), 1984, pp. 272–279.
109. R. M. K. Sinha and C. J. Ammann, “Comments on fast thinning algorithm for binary images,” Image Vision Comput., vol. 4, no. 1, pp. 57–58, 1986.
110. R. M. K. Sinha, “A width-independent algorithm for character skeleton estimation,” Comput. Vision Graphics Image Processing, vol. 40, pp. 388–397, 1987.
111. R. W. Smith, “Computer processing of line images: A survey,” Patt. Recogn., vol. 20, no. 1, pp. 7–15, 1987.
112. M. Del Sordo and T. Kasvand, “A near-neighbor processor for line thinning,” in Proc. Int. Conf Acoust. Speech Signal Processing, 1985, pp. 1523–1525.
113. M. Del Sordo and T. Kasvand, “Neighborhood look-up tables for skeletonization,” in Proc. 4th Scand. Conf Image Anal. (Trondheim, Norway), 1985, pp. 663–670.
114. J. H. Sossa, “An improved parallel algorithm for thinning digital patterns,” Patt. Recogn. Lett., vol. 10, no. 2, pp. 77–80, 1989.
115. R. Stefanelli and A. Rosenfeld, “Some parallel thinning algorithms for digital pictures,”J. ACM, vol. 18, no. 2, pp. 255–264, 1971.
116. R. Stefanelli, “A comment on an investigation into the skeletonization approach of Hilditch,” Patt. Recogn., vol. 19, no. 1, pp. 13–14, 1986.
117. C. Y. Suen, M. Berthold, and S. Mori, “Automatic recognition of handprinted characters,” Proc. IEEE, vol. 68, no. 4, pp. 469–487, 1980.
118. S. Suzuki and K. Abe, “Binary picture thinning by an iterative parallel two-subcycle operation,” Patt. Recogn., vol. 10, no. 3, pp. 297–307, 1987.
119. T. Suzuki and S. Mori, “A thinning method based on cell structure,” in Proc. Int. Workshop Frontiers Handwriting Recogn. (Montreal, Canada), 1990, pp. 39–52.
120. H. Tamura, “A comparison of line thinning algorithms from a digital geometry viewpoint,” in Proc. 4th Int. Conf. Patt. Recogn. (Kyoto, Japan), 1978, pp. 715–719.
121. C. C. Tappert, C. Y. Suen, and T. Wakahara, “The state of the art in on-line handwriting recognition,” IEEE Trans. Patt. Anal. Machine Intell, vol. 12, no. 8, pp. 787–808, 1990.
122. J.-I. Toriwaki and S. Yokoi, “Distance transformation and skeletons of digitized pictures with applications,” in Progress in Pattern Recognition (L. N. Kanal and A. Rosenfeld, Eds.). New York: North-Holland, 1981, pp. 189–264.
123. E. E. Triendl, “Skeletonization of noisy hand-drawn symbols using parallel operations,” Patt. Recogn., vol. 2, pp. 215–226, 1970.
124. Y. F. Tsao and K. S. Fu, “Parallel thinning operations for digital binary images,” in Proc. Int. Conf. Patt. Recog. Image Processing (Dallas, TX), 1981, pp. 150–155.
125. Y. F. Tsao and K. S. Fu, “A general scheme for constructing skeleton models,” Inform. Sci., vol. 27, no. 1, pp. 53–87, 1982.
126. L. J. Vliet and B. J. H. Verwer, “A contour processing method for fast neighborhood operations,” Patt. Recogn. Lett., vol. 7, no. 1, pp. 27–36, 1988.
127. A. M. Vossepoel, J. P. Buys, and G. Koelewijn, “Skeletons from chain-coded contours,” in Proc. 10th Int. Conf. Patt. Recogn. (Atlantic City), 1990, pp. 70–73.
128. P. S. P. Wang, L.-W. Hui, and T. Fleming, “Further improved fast parallel thinning algorithm for digital patterns,” in Computer Vision, Image Processing and Communications—Systems and Applications (P. S. P. Wang, Ed.). Singapore: World Scientific, 1986, pp. 37–40.
129. P. S. P. Wang and Y. Y. Zhang, “A fast serial and parallel thinning algorithm,” in Proc. Eighth Euro. Meeting Cybern. Syst. Res. (Vienna, Austria), 1986, pp. 909–915.
130. P. S. P. Wang and Y. Y. Zhang, “A fast and flexible thinning algorithm,” IEEE Trans. Comput., vol. 38, no. 5, pp. 741–745, 1989.
131. Y. Xia, “A new thinning algorithm for binary images,” in Proc. 8th Int. Conf. Patt. Recogn. (Paris, France), 1986, pp. 995–997.
132. W. Xu and C. Wang, “CGT: A fast thinning algorithm implemented on a sequential computer,” IEEE Trans. Syst. Man Cybern., vol. SMC-17, no. 5, pp. 847–851, 1987.
133. Q.-Z. Ye and P. E. Danielsson, “Inspection of printed circuit boards by connectivity preserving shrinking,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 10, no. 5, pp. 737–742, 1988.
134. S. Yokoi, J.-I. Toriwaki, and T. Fukumura, “Topological properties in digitized binary pictures,” Syst. Comput. Contr., vol. 4, no. 6, pp. 32–39, 1973.
135. S. Yokoi, J.-I. Toriwaki, and T. Fukumura, “An analysis of topological properties of digitized binary pictures using local features,” Comput. Graphics Image Processing, vol. 4, pp. 63–73, 1975.
136. T. Y. Zhang and C. Y. Suen, “A fast parallel algorithm for thinning digital patterns,” Comm. ACM, vol. 27, no. 3, pp. 236–239, 1984.
137. Y. Y. Zhang and P. S. P. Wang, “A modified parallel thinning algorithm,” in Proc. 9th Int. Conf. Patt. Recogn. (Rome, Italy), 1988, pp. 1023–1025.
138. Y. Y. Zhang and P. S. P. Wang, “A maximum algorithm for thinning digital patterns,” in Proc. 9th Int. Conf. Patt. Recogn. (Rome, Italy), 1988, pp. 942–944.