A modified contour generation thinning algorithm

Author

Kwok, Paul C K

Author_Institution

Dept. of Comput. Sci., Calgary Univ., Alta., Canada

fYear

1990

fDate

24-27 Sep 1990

Firstpage

491

Abstract

A modified contour generation thinning algorithm is proposed. It uses three pieces of information to process a contour pixel, compared with four in the case of the original algorithm and nine in the case of a typical sequential or parallel algorithm. This is possible because of the sequential nature of the algorithm, so that as far as a contour pixel is concerned, its predecessor does not take part in the computation of the new contour. Rather, the directions of the contour pixel with respect to the last generated pixel are used. This information together with the status of the contour pixel and its chain code will enable the new contour to be generated. This modification led to a reduction in coding effect, while maintaining the same speed as the original algorithm

Keywords

computerised picture processing; encoding; chain code; contour generation thinning algorithm; contour pixel; modified algorithm; Algorithm design and analysis; Computer science; Fuel processing industries; Gas industry; Image coding; Information analysis; Iterative algorithms; Pattern analysis; Pattern recognition; Petroleum;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Communication Systems, 1990. IEEE TENCON'90., 1990 IEEE Region 10 Conference on

Print_ISBN

0-87942-556-3

Type

conf

DOI

10.1109/TENCON.1990.152658

Filename

152658