Length estimators for digitized contours
Computer Vision, Graphics, and Image Processing
Restoration of binary images using contour direction chain codes description
Computer Vision, Graphics, and Image Processing
A new chain-coding algorithm for binary images using run-length codes
Computer Vision, Graphics, and Image Processing
Parallel algorithms for recognizing handwritten characters using shape features
Pattern Recognition
The Chain Pyramid: Hierarchical Contour Processing
IEEE Transactions on Pattern Analysis and Machine Intelligence
A fast algorithm for the restoration of images based on chain codes description and its applications
Computer Vision, Graphics, and Image Processing
Hierarchical representation of chain-encoded binary image contours
Computer Vision and Image Understanding
Fast Chain Coding of Region Boundaries
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Unsupervised image retrieval framework based on rule base system
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
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 [½(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(3N). 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.