A modified contour generation thinning algorithm

Paul C.K. Kwok

A modified contour generation thinning algorithm

Hong Kong Metropolitan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 is 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.

Original language	English
Title of host publication	90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 90
Pages	491-495
Number of pages	5
Publication status	Published - 1990
Event	1990 IEEE Region 10 Conference on Computer and Communication Systems - IEEE TENCON '90 - Hong Kong Duration: 24 Sept 1990 → 27 Sept 1990

Publication series

Name	90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 90

Conference

Conference	1990 IEEE Region 10 Conference on Computer and Communication Systems - IEEE TENCON '90
City	Hong Kong
Period	24/09/90 → 27/09/90

Cite this

@inproceedings{466983f94a2948fb96597e44137c0034,

title = "A modified contour generation thinning algorithm",

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 is 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.",

author = "Kwok, {Paul C.K.}",

year = "1990",

language = "English",

isbn = "0879425563",

series = "90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 90",

pages = "491--495",

booktitle = "90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 90",

note = "1990 IEEE Region 10 Conference on Computer and Communication Systems - IEEE TENCON '90 ; Conference date: 24-09-1990 Through 27-09-1990",

}

TY - GEN

T1 - A modified contour generation thinning algorithm

AU - Kwok, Paul C.K.

PY - 1990

Y1 - 1990

N2 - 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 is 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.

AB - 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 is 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.

UR - http://www.scopus.com/inward/record.url?scp=0025539631&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025539631

SN - 0879425563

T3 - 90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 90

SP - 491

EP - 495

BT - 90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 90

T2 - 1990 IEEE Region 10 Conference on Computer and Communication Systems - IEEE TENCON '90

Y2 - 24 September 1990 through 27 September 1990

ER -

A modified contour generation thinning algorithm

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this