Analysis of thinning algorithms

Author

Zhang, Y.Y. ; Wang, P.S.P.

Author_Institution

Coll. of Comput. Sci., Northeastern Univ., Boston, MA, USA

fYear

1992

fDate

30 Aug-3 Sep 1992

Firstpage

763

Lastpage

766

Abstract

Uses a combinatorial approach to analyse the differences of thinning algorithms among iteration and sub-iteration, thinning by coordinate and by edges of patterns. The authors also propose a serial model thinning algorithm in which the skeletons only consist of three types of points: connected points, end-points, and hole-points

Keywords

combinatorial mathematics; image processing; iterative methods; combinatorial approach; connected points; end-points; hole-points; image processing; iteration thinning; serial model thinning algorithm; skeletons; sub-iteration thinning; Algorithm design and analysis; Computer science; Digital images; Educational institutions; Neural networks; Pattern analysis; Pattern recognition; Shape; Skeleton; Tin;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings., 11th IAPR International Conference on

Conference_Location

The Hague

Print_ISBN

0-8186-2920-7

Type

conf

DOI

10.1109/ICPR.1992.202098

Filename

202098

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3064001