Abstract
The computation of Euclidean distances, as opposed to digital distances (4-distance and 8-distance) involves a large amount of computations. Significant reduction in complexity can be achieved by plotting circles with increasing diameters around a pixel and examining the pixels on the circumferences. Two hardware configurations for computing the Euclidean distances using circles are proposed. The first configuration processes the bitmap serially. The circumferences are examined in parallel. The distances are found after one scan of the bitmap. The second is a cellular configuration and processes the bitmap in parallel. Pixels on the circumferences are examined serially.
Original language | English |
---|---|
Pages (from-to) | 492-497 |
Number of pages | 6 |
Journal | IEE Conference Publication |
Issue number | 307 |
Publication status | Published - 1989 |
Event | Third International Conference on Image Processing and its Applications - Coventry, Engl Duration: 18 Jul 1989 → 20 Jul 1989 |