This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Evaluation of Parallel Thinning Algorithms for Character Recognition
September 1995 (vol. 17 no. 9)
pp. 914-919

Abstract—Skeletonization algorithms have played an important role in the preprocessing phase of OCR systems. In this paper we report on the performance of 10 recent parallel thinning algorithms from this perspective by gathering statistics from their performance on large sets of data and examining the effects of the different thinning algorithms on an OCR system.

[1] C. Arcelli,L. Cordella,, and S. Levialdi,“Parallel thinning of binary pictures,” Electron. Letters, vol. 11, no. 7, pp. 148-149, 1975.
[2] C. Arcelli and G. Sanniti di Baja,“A thinning algorithm based on prominence detection,” Pattern Recognition, vol. 13, no. 3, pp. 225-235, 1981.
[3] Y.-S. Chen and W.-H. Hsu,“A systematic approach for designing 2-subcycle and pseudo 1-subcycle parallel thinning algorithms,” Pattern Recognition, vol. 22, no. 3, pp. 267-282, 1989.
[4] Y.-S. Chen and W.-H. Hsu,“A comparison of some one-pass parallel thinnings,” Pattern Recognition Letters, vol. 11, no. 1, pp. 35-41, 1990.
[5] C.-S. Chen and W.-H. Tsai,“A new fast one-pass thinning algorithm and its parallel hardware implementation,” Pattern Recognition Letters, vol. 11, pp. 471-477, 1990.
[6] R.T. Chin,H.-K. Wan,D.L. Stover,, and R.D. Iverson,“A one-pass thinning algorithm and its parallel implementation,” Computer Vision, Graphics, Image Processing, vol. 40, pp. 30-40, 1987.
[7] R. Fenrich and J.J. Hull,“Concerns in creation of image databases,” Pre-Proc. 3rd Int’l Workshop Frontiers in Handwriting Recognition, pp. 112-121,Buffalo, N.Y., May 1993.
[8] Z. Guo and R.W. Hall,“Fast fully parallel thinning algorithms,” CVGIP: Image Understanding, vol. 55, no. 3, pp. 317-328, 1992.
[9] R.W. Hall,“Fast parallel thinning algorithms: Parallel speed and connectivity preservation,” Comm. ACM, vol. 32, no. 1, pp. 124-131, 1989.
[10] R.W. Hall,“Optimally small operator supports for fully parallel thinning algorithms,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 8, pp. 828-833, 1993.
[11] C.J. Hilditch,“Linear skeletons from square cupboards,” Machine Intelligence, vol. 4, B. Meltzer and D. Michie, eds., pp. 403-420, New York: American Elsevier, 1969.
[12] C.J. Hilditch,“Comparison of thinning algorithms on a parallel processor,” Image Vision Comput., vol. 1, no. 3, pp. 115-132, 1983.
[13] P. Bates,“Distributed debugging tools for heterogeneous distributed systems,” Proc. 8th Int’l Conf. on Distributed Computing Systems,San Jose, Calif., June 1988, pp. 308-315.
[14] M.Y. Jaisimha,R.M. Haralick,, and D. Dori,“A methodology for the characterization of the performance of thinning algorithms,” Proc. Second Int’l Conf. Document Analysis and Recognition, pp. 282-286,Tsukuba, Japan, 1993.
[15] M.Y. Jaisimha,R.M. Haralick,, and D. Dori,“Quantitative performance evaluation of thinning algorithms under noisy conditions,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 678-683,Seattle, Wash., June 1994.
[16] L. Lam and C.Y. Suen, "Structural Classification and Relaxation Matching of Totally Unconstrained Handwritten Zip-Code Numbers," Pattern Recognition, vol. 21, no. 1, pp. 19-31, 1988.
[17] L. Lam, S.W. Lee, and C.Y. Suen, “Thinning Methodologies: A Comprehensive Survey,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, pp. 869-885, 1992.
[18] L. Lam,S.-W. Lee,, and C.Y. Suen,“Automatic comparisons by shape matching methods,” Int’l J. Pattern Recognition and Artificial Intelligence, vol. 7, no. 5, pp. 1,271-1,286, 1993.
[19] S.-W. Lee,L. Lam,, and C.Y. Suen,“A systematic evaluation of skeletonization algorithms,” Int’l J. Pattern Recognition and Artificial Intelligence, vol. 7, no. 5, pp. 1,203-1,225, 1993.
[20] R. Plamondon,C.Y. Suen,M. Bourdeau,, and C. Barriere,“Methodologies for evaluating thinning algorithms for character recognition,” IJPRAI, vol. 7, no. 5, pp. 1,247-1,270, 1993.
[21] D. Rutovitz,“Pattern recognition,” J. Royal Statistical Soc., vol. 129, Series A, pp. 504-530, 1966.
[22] S. Smith, M.O. Bourgoin, K. Sims, and H.L. Voorhees, "Handwritten Character Classification Using Nearest Neighbor in Large Databases," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, pp. 915-919, 1994.
[23] S. Suzuki and K. Abe,“Binary picture thinning by an iterative parallel two-subcycle operation,” Pattern Recognition, vol. 10, no. 3, pp. 297-307, 1987.
[24] T. Wakahara, "Shape Matching Using LAT and Its Application to Handwritten Numeral Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 6, pp. 618-629, June 1994.
[25] P.S.P. Wang and Y.Y. Zhang, “A Fast and Flexible Thinning Algorithm,” IEEE Trans. Computers, vol. 38, no. 5, pp. 741-745, May 1989.
[26] R.-Y. Wu and W.-H. Tsai,“A new one-pass parallel thinning algorithm for binary images,” Pattern Recognition Letters, vol. 13, pp. 715-723, 1992.
[27] S. Yokoi,J.-I. Toriwaki,, and T. Fukumura,“Topological properties in digitized binary pictures,” Syst. Comput. Controls, vol. 4, no. 6, pp. 32-39, 1973.
[28] 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.

Index Terms:
Thinning, parallel algorithms, image processing, character recognition.
Citation:
Louisa Lam, Ching Y. Suen, "An Evaluation of Parallel Thinning Algorithms for Character Recognition," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 9, pp. 914-919, Sept. 1995, doi:10.1109/34.406659
Usage of this product signifies your acceptance of the Terms of Use.