A parallel algorithm for detecting dominant points on multiple digital curves
β Scribed by Xintong Zhang; Dongming Zhao
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 542 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
β¦ Synopsis
A new parallel algorithm is proposed for detecting corners of multiple planar curves or shapes. This algorithm is based on an analysis of morphological residues and corner characteristics. The method is different from traditional chain-code based corner detection algorithms which associate with a chain coding and floating point computation. For multiple objects in an image, the proposed algorithm treats them uniformly and applies simultaneously on curves and shapes of multiple objects. The experiments demonstrate that the algorithm can he effectively executed on an SIMD parallel computer. A boundary-constrained morphological method is presented for tilting closed curves into shapes which are subsequently used for corner detection.
π SIMILAR VOLUMES
In this paper the problem of recognizing a black curve in a noisy environment using a multiprocessor system is investigated. A dynamic programming parallel algorithm which can solve that image processing problem is presented. It is shown that, under hypothesis of unbounded parallelism and using a si