
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
B.K. Jang, R.T. Chin, "OnePass Parallel Thinning: Analysis, Properties, and Quantitative Evaluation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 14, no. 11, pp. 11291140, November, 1992.  
BibTex  x  
@article{ 10.1109/34.166630, author = {B.K. Jang and R.T. Chin}, title = {OnePass Parallel Thinning: Analysis, Properties, and Quantitative Evaluation}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {14}, number = {11}, issn = {01628828}, year = {1992}, pages = {11291140}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.166630}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  OnePass Parallel Thinning: Analysis, Properties, and Quantitative Evaluation IS  11 SN  01628828 SP1129 EP1140 EPD  11291140 A1  B.K. Jang, A1  R.T. Chin, PY  1992 KW  shape analysis; onepass parallel thinning; unitwidth convergence; medial axis approximation; noise immunity; pipeline processing model; skeletal connectivity; convergence of numerical methods; image recognition; parallel algorithms; pipeline processing VL  14 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
A onepass parallel thinning algorithm based on a number of criteria, including connectivity, unitwidth convergence, medial axis approximation, noise immunity, and efficiency, is proposed. A pipeline processing model is assumed for the development. Precise analysis of the thinning process is presented to show its properties, and proofs of skeletal connectivity and convergence are provided. The proposed algorithm is further extended to the derivedgrid to attain an isotropic medial axis representation. A set of measures based on the desired properties of thinning is used for quantitative evaluation of various algorithms. Image reconstruction from connected skeletons is also discussed. Evaluation shows that the procedures compare favorably to others.
[1] C. Arcelli, "Pattern thinnig by contour tracing,"Comput. Graph. Image Procesing, vol. 17, pp. 130144, 1981.
[2] C. Arcelli, L. P. Cordella, and S. Levialdi, "From local maximum to connected skeletons,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI3, no. 2, pp. 134143, Mar. 1981.
[3] C. Arcelli and G. S. D. Baja, "A widthindependent fast thinning algorithm,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI7, no. 4, pp. 463474, July 1985.
[4] C. Arcelli and G. S. D. Baja, "A onepass twooperation process to detect the skeletal pixels in the 4distance transform,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI11, no. 4, pp. 411414, Apr. 1989.
[5] G. Bertrand, "Skeletons in derived grids," inProc. Inc. Conf. Patt. Recogn., 1984, pp. 326329.
[6] B. Blum, "A transformation for extracting new descriptors of shape," inProc. Symp. Models Perception Speech Visual Form(Cambridge, MA), 1964.
[7] G. Borgefors, "Distance transformations in arbitrary dimensions,"Comput. vision Graphics Image Processing, vol. 27, pp. 321345, 1984.
[8] R. M. Brown, T. H. Fay, and C. L. Walker, "Handprinted symbol recognition system,"Patt. Recog., vol. 21, no. 2, pp. 91118, 1988.
[9] Y. S. Chen and W. H. Hsu, "A modified fast parallel algorithm for thinning digital patterns,"Pattern Recogn. Lett., vol. 7, no. 2, pp. 99106, 1988.
[10] R. T. Chin, H. K. Wan, D. L. Stover, and R. D. Iverson, "A onepass thinning algorithm and its parallel implementation,"Comput. Vision Graphics Image Processing, vol. 40, pp. 3040, 1987.
[11] P. E. Danielsson, "Euclidean distance mapping,"Comp. Graphics Image Processing, vol. 14, pp. 227248, 1980.
[12] E. R. Davies and A. P. N. Plummer, "Thinning algorithms: A critique and a new methodology,"Patt. Recog., vol. 14, nos. 16, pp. 5363, 1981.
[13] Z. Guo and R. W. Hall, "Parallel thinning with twosubiteration algorithms,"Comm. ACM, vol. 32, no. 3, pp. 359373, 1989.
[14] R. W. Hall, "Fast parallel thinning algorithms: Parallel speed and connectivity preservation,"Comm. ACM, vol. 32, no. 1, pp. 124131, 1989.
[15] C. J. Hilditch, "Linear skeletons from square cupboards," inMachine Intelligence(B. Meltzer and D. Michie, Eds.) New York: American Elsevier, 1969, pp. 403420, vol. 4.
[16] C. M. Holt, A. Stewart, M. Clint, and R. H. Perrott, "An improved parallel thinning algorithm,"Comm. ACM, vol. 30, no. 2, pp. 156160, 1987.
[17] S.H. Hung and T. Kasvand, "Critical points on a perfectly 8 or 6 connected thin binary line,"Patt. Recog., vol. 16, pp. 297306, 1983.
[18] B. K. Jang and R. T. Chin, "Analysis of thinning algorithms using mathematical morphology,"IEEE Trans. Patt. Anal. Machine Intell., PAMI12, no. 6, pp. 541551, Jun. 1990.
[19] P. S. P. Wang, "A comment on a fast parallel algorithm for thinning digital patterns,"Comm. ACM, vol. 29, no. 3, pp. 239242, 1986.
[20] N. J. Naccache and R. Shinghal, "SPTA: A proposed algorithm for thinning binary patterns,"IEEE Trans. Syst. Man, Cybern., vol. 14, pp. 409418, 1984.
[21] K. Preston, Jr. and L. Uhr,Multicomputers and Image Processing. New York: Academic, 1982.
[22] C. Ronse, "Minimal test patterns for coennctivity preservation in parallel thinning algorithms for binary digital images,"Discrete Applied Mathematics, vol. 21, pp. 6779, 1988.
[23] C. Ronse, "A topological characterization of thinning,"Theoret. Comput. Sci., vol. 43, pp. 3141, 1986.
[24] A. Rosenfeld and A. Kak,Digital Picture Processing, New York: Academic, 1976.
[25] A. Rosenfeld and J. Pfaltz, "Sequential operations in digital picture processing,"J. ACM, vol. 4, 1966.
[26] A. Rosenfeld and J. Pfaltz, "Distance functions on digital pictures,"Patt. Recogn., vol. 1, pp. 3361, 1968.
[27] Special issue in computer architectures for image processing,Comput., vol. 16, no. 1, Jan. 1983.
[28] J. I. Toriwaki and S. Yokoi, "Distance transformation and skeletons of digitized pictures with applications," inProgress in Pattern Recognition, (L. N. Kandel and A. Rosenfeld, Eds.) Amsterdam, The Netherlands: NorthHolland, 1981, pp. 187265.
[29] S. L. Xie and M. Suk, "On machine recognition of handprinted Chinese characters by feature relaxation,"Patt. Recogn., vol. 21, no. 1, pp. 17, 1988.
[30] S. Yokoi, J. Toriwaki, and T. Fukumura, "Topological properties in digitized binary pictures,"SystemsComput.Contr., vol. 4, pp. 3239, 1973.
[31] S. Yokoi, J. Toriwaki, and T. Fukumura, "An analysis of topological properties of digitized binary pictures using local features,"Comput. Graph. Image Processing, vol. 4, pp. 6373, 1975.
[32] A. L. DeCegama,Parallel Processing Architectures and VLSI Hardware. Englewood Cliffs, NJ: PrenticeHall, 1989.
[33] K. Hwang and D. Degroot,Parallel Processing for Supercomputers and Artificial Intelligence. New York: McGrawHill, 1989.
[34] Proc. Workshop Comp. Architecture Patt. Anal. Machine Intell., 1987.
[35] L. Abbott, R. M. Haralick, and X. Zhuang, "Pipeline architectures for morphologic image analysis,"Machine Vision Applicat., vol. 1, pp. 2340, 1988.
[36] B.K. Jang, "Shape analysis using mathematical morphology," Ph.D. Thesis, Dept. Elect. Comput. Eng., Univ. WisconsinMadison, 1990.
[37] T. Y. Kong and A. Rosenfeld, "Digital topology: Introduction and survey,"Comput. Vision Graphics Image Processing, vol. 48, pp. 357393, 1989.
[38] J. Serra, Image Analysis and Mathematical Morphology. New York: Academic, 1982.