Abstract
We develop an O(n2) time serial algorithm to obtain the medial axis transform (MAT) of an n×n image. An O(log n) time CREW PRAM algorithm and an O(log2 n) time SIMD hypercube parallel algorithm for the MAT are also developed. Both of these use O(n2) processors. Two problems associated with the MAT are also studied. These are the area and perimeter reporting problem. We develop an O(log n) time hypercube algorithm for both of these problems. Here n is the number of squares in the MAT and the algorithms use O(n2) processors.
Original language | English |
---|---|
Pages (from-to) | 1218-1224 |
Number of pages | 7 |
Journal | IEEE Transactions on Pattern Analysis and Machine Intelligence |
Volume | 14 |
Issue number | 12 |
DOIs | |
State | Published - 1 Dec 1992 |
Event | Proceedings of the 6th International Parallel Processing Symposium - Beverly Hills, CA, USA Duration: 23 Mar 1992 → 26 Mar 1992 |
Keywords
- Hypercube algorithms
- image processing
- medial axis
- serial and parallel algorithms
- transform