A FAST CONTOUR TRACING MATCHING THINNING ALGORITHM

Chen Hui; Wang Haiyang

Volume 18 Issue 4

Jul. 1996

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1996 > 18(4): 431-434

Chen Hui, Wang Haiyang. A FAST CONTOUR TRACING MATCHING THINNING ALGORITHM[J]. Journal of Electronics & Information Technology, 1996, 18(4): 431-434.

Citation:

Chen Hui, Wang Haiyang. A FAST CONTOUR TRACING MATCHING THINNING ALGORITHM[J]. Journal of Electronics & Information Technology, 1996, 18(4): 431-434.

Chen Hui, Wang Haiyang. A FAST CONTOUR TRACING MATCHING THINNING ALGORITHM[J]. Journal of Electronics & Information Technology, 1996, 18(4): 431-434.

Citation:

Chen Hui, Wang Haiyang. A FAST CONTOUR TRACING MATCHING THINNING ALGORITHM[J]. Journal of Electronics & Information Technology, 1996, 18(4): 431-434.

PDF( 766 KB)

A FAST CONTOUR TRACING MATCHING THINNING ALGORITHM

Chen Hui^{①;王海洋},
Wang Haiyang

Received Date: 1994-11-25
Rev Recd Date: 1995-03-07
Publish Date: 1996-07-19

Abstract

Abstract

A fast matching thinning algorithm based on tracing all contours is presented. It produces better image skeleton with faster processing speed. Experimental results show that this method is effective.

FullText(HTML)

References(1)

References

Pals,Bhattacharya P. Pattern Recognition, 1992, 25(5):497-505.[2]Guo Z, Hall R W. Computer Vision, Graphics and Image Process, 1992,55(3):317-328.[3]Bourbakis N G. Pattern Recognition. 1989, 22(4): 387-396.[4]Wang P S P, Zhang Y Y. IEEE Trans. on. Comput., 1989, C-38(5):741-745.[5]Arcelli C. Computer Graphics and Image Process, 1981, 17: 13-16.

Relative Articles

Supplements(0)

Cited By

Proportional views