A Parallel Thinning Algorithm by the 8-Neighbors Connectivity Value


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 2, No. 5, pp. 701-710, Sep. 1995
10.3745/KIPSTE.1995.2.5.701,   PDF Download:

Abstract

A thinning algorithm is a very important procedure in order to increase recognition rate in the character recognition. This paper is the study of a parallel thinning algorithm avaliable for the recognition of various characters, and it proposes the parallel thinning algorithm using the 8-neighbors connectivity value. Characteristics of the proposed algorithm are easiness of implementation of parallelism, the result of thinning is perfectly-8 connectivity and represented by numeric information. The proposed algorithm is very suitable for characters having many curve segments such as English, Japanese etc. Performance evaluation was performed by the measure of similarity to reference skeleton.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
W. N. Sik and S. Y. Koo, "A Parallel Thinning Algorithm by the 8-Neighbors Connectivity Value," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 2, no. 5, pp. 701-710, 1995. DOI: 10.3745/KIPSTE.1995.2.5.701.

[ACM Style]
Won Nam Sik and Son Yoon Koo. 1995. A Parallel Thinning Algorithm by the 8-Neighbors Connectivity Value. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 2, 5, (1995), 701-710. DOI: 10.3745/KIPSTE.1995.2.5.701.