DocumentCode
1728616
Title
Minimizing the computing complexity of iterative sequential thinning algorithm
Author
Xia, Yun
Author_Institution
Inst. de Programmation, Paris VI Univ., France
fYear
1988
Firstpage
721
Abstract
The sequential thinning method proposed, based on the grassfire model, overcomes the two essential difficulties of thinning. First, using contour tracing, thinning can be fulfilled in less than two scans of image. Due to the notion of associated point defined, fire propagation and quenching are simulated in discrete space. This simulation makes it possible to find quench points without neighborhood testing, and the computing complexity is almost minimized. Second, protrusion analysis makes the method capable of eliminating nonsignificant branches of skeleton. Moreover, like median-axis transformation, the obtained skeletons are labelled by quench function. Thus the method is suitable for practical applications
Keywords
computational complexity; computerised picture processing; iterative methods; minimisation; computational complexity; contour tracing; discrete space; grassfire model; iterative sequential thinning algorithm; minimisation; picture processing; protrusion analysis; quench function; quench points; skeleton; Analytical models; Computational modeling; Discrete transforms; Fires; Image analysis; Image processing; Iterative algorithms; Iterative methods; Skeleton; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 1988., 9th International Conference on
Conference_Location
Rome
Print_ISBN
0-8186-0878-1
Type
conf
DOI
10.1109/ICPR.1988.28339
Filename
28339
Link To Document