The algorithm of the Fast Hough Transform presents a strong irregularity which makes its parallelization difficult, especially if we introduce certain improvements into the sequential algorithm, such as the elimination of straight lines. In this work we approach this algorithm as a branch and bound
A New Approach for Circle Detection on Multiprocessors
โ Scribed by A. Kavianpour; S. Shoari; N. Bagherzadeh
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 304 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper considers the problem of detecting circles in images on multiprocessors. We have defined a new transformation that converts circles in an image to families of straight lines, allowing the problem to be converted to line detection which can be solved by any line detection algorithm. Also, we have developed two algorithms for circle detection based on this new transformation. A simulation program for these algorithms implemented on a pyramid architecture is presented. 1994 Academic Press. Inc.
๐ SIMILAR VOLUMES
A new topology for interconnection networks has been proposed. The underlying network graph has N โซุโฌ 4 n nodes (n ี 2) and is almost regular with maximum degree 5 and diameter ี ๏ฃฐ3/4 log 2 N๏ฃป ุ 1. Algorithms for point-to-point routing and single node broadcast have also been developed. It has also
This paper is devoted to fundamental problems of the generalized signal processing approach based on a seemingly abstract idea: to introduce an additional noise source which does not carry any information about a signal for the purpose of improving qualitative characteristics of information processi
and/or devising improved routing disciplines in the case of distributed memory architecture, to reduce the expected access time for a variable. Extensive work has been done on both cache design and message routing. In this paper a new shared-data approach is taken to attack the problem. We consider