A parallel algorithm for generating chain code of objects in binary images

• Published in: Information sciences Vol. 149; no. 4; pp. 219 - 234
• Main Authors: Chia, Tsorng-Lin, Wang, Kuang-Bor, Chen, Lay-Rong, Chen, Zen
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.02.2003
• Subjects: Chain code; Chain collection; Chain linking; Parallel algorithm; Chain code; Chain linking; Parallel algorithm; Chain collection
• ISSN: 0020-0255; 1872-6291
• DOI: 10.1016/S0020-0255(02)00267-0

This paper addresses parallel execution of chain code generation on a linear array architecture. The contours in the proposed algorithm are viewed as a set of edges (or contour segments) that can be traced by a top-down contour tracing method to generate the chain codes for the outer and inner object contours. A parallel algorithm that contains the chain code generating rules and operations needed is also described, and the algorithm is mapped onto a one-dimensional systolic array containing ⌈ 1 2 (N+1)⌉ processing elements (PEs) to devise this architecture. The architecture extracts the contours of objects and quickly generates the corresponding chain codes after the image data in all rows are inputted in a linear fashion. The total processing time for generating the chain codes in an N× N image is O(3 N). By doing so, the real-time requirement is fulfilled and its execution time is independent of the image content. In addition, a partition method is developed to process an image when the parallel architecture has a fixed number of PEs; say two or more. The total execution time for an N× N image by employing a fixed number of PEs is N( N+1)/ M+2( M−1), when M is the fixed number of PEs.