Single pass algorithm for the generation of chain-coded contours and contours inclusion relationship

Sze Tsan Choy; Wan Chi Siu

Single pass algorithm for the generation of chain-coded contours and contours inclusion relationship

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

5 Citations (Scopus)

Abstract

In this paper, a single-pass algorithm for extracting 8-direction chain-coded contours from a binary image, and determining contours inclusion relationship is described. The algorithm processes the image using a 2×2 pixels window sliding in a raster scanning fashion. By observing the sequence of patterns through this window, intermediate structures called fragments may be created, lengthened, merged, or closed to form a complete contour. Furthermore, inclusion relationships among fragments and/or contours are maintained throughout the processing, and are operated in such a way that once a contour is formed, its relationship with those contours being enclosed must be correct. Realization of the algorithm on a sequential machine is compared with other algorithms in the literature showing that for images with more contour points, the proposed algorithm is the fastest.

Original language	English
Title of host publication	IEEE Pac Rim Conf Commun Comput Signal Process
Publisher	Publ by IEEE
Pages	256-259
Number of pages	4
ISBN (Print)	0780312198
Publication status	Published - 1 Jan 1993
Event	Proceedings of the IEEE 1993 Pacific Rim Conference on Communications, Computers and Signal Processing - Victoria, BC, Canada Duration: 19 May 1993 → 21 May 1993

Conference

Conference	Proceedings of the IEEE 1993 Pacific Rim Conference on Communications, Computers and Signal Processing
Country/Territory	Canada
City	Victoria, BC
Period	19/05/93 → 21/05/93

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Cite this

@inproceedings{0b698894a1ad4d33afdc67e5d73437c4,

title = "Single pass algorithm for the generation of chain-coded contours and contours inclusion relationship",

abstract = "In this paper, a single-pass algorithm for extracting 8-direction chain-coded contours from a binary image, and determining contours inclusion relationship is described. The algorithm processes the image using a 2×2 pixels window sliding in a raster scanning fashion. By observing the sequence of patterns through this window, intermediate structures called fragments may be created, lengthened, merged, or closed to form a complete contour. Furthermore, inclusion relationships among fragments and/or contours are maintained throughout the processing, and are operated in such a way that once a contour is formed, its relationship with those contours being enclosed must be correct. Realization of the algorithm on a sequential machine is compared with other algorithms in the literature showing that for images with more contour points, the proposed algorithm is the fastest.",

author = "Choy, {Sze Tsan} and Siu, {Wan Chi}",

year = "1993",

month = jan,

day = "1",

language = "English",

isbn = "0780312198",

pages = "256--259",

booktitle = "IEEE Pac Rim Conf Commun Comput Signal Process",

publisher = "Publ by IEEE",

note = "Proceedings of the IEEE 1993 Pacific Rim Conference on Communications, Computers and Signal Processing ; Conference date: 19-05-1993 Through 21-05-1993",

}

TY - GEN

T1 - Single pass algorithm for the generation of chain-coded contours and contours inclusion relationship

AU - Choy, Sze Tsan

AU - Siu, Wan Chi

PY - 1993/1/1

Y1 - 1993/1/1

N2 - In this paper, a single-pass algorithm for extracting 8-direction chain-coded contours from a binary image, and determining contours inclusion relationship is described. The algorithm processes the image using a 2×2 pixels window sliding in a raster scanning fashion. By observing the sequence of patterns through this window, intermediate structures called fragments may be created, lengthened, merged, or closed to form a complete contour. Furthermore, inclusion relationships among fragments and/or contours are maintained throughout the processing, and are operated in such a way that once a contour is formed, its relationship with those contours being enclosed must be correct. Realization of the algorithm on a sequential machine is compared with other algorithms in the literature showing that for images with more contour points, the proposed algorithm is the fastest.

AB - In this paper, a single-pass algorithm for extracting 8-direction chain-coded contours from a binary image, and determining contours inclusion relationship is described. The algorithm processes the image using a 2×2 pixels window sliding in a raster scanning fashion. By observing the sequence of patterns through this window, intermediate structures called fragments may be created, lengthened, merged, or closed to form a complete contour. Furthermore, inclusion relationships among fragments and/or contours are maintained throughout the processing, and are operated in such a way that once a contour is formed, its relationship with those contours being enclosed must be correct. Realization of the algorithm on a sequential machine is compared with other algorithms in the literature showing that for images with more contour points, the proposed algorithm is the fastest.

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

M3 - Conference article published in proceeding or book

SN - 0780312198

SP - 256

EP - 259

BT - IEEE Pac Rim Conf Commun Comput Signal Process

PB - Publ by IEEE

T2 - Proceedings of the IEEE 1993 Pacific Rim Conference on Communications, Computers and Signal Processing

Y2 - 19 May 1993 through 21 May 1993

ER -

Single pass algorithm for the generation of chain-coded contours and contours inclusion relationship

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this