A simple parallel algorithm for the medial axis transform of binary images

The medial axis transform (MAT) is an image representation scheme. For a binary image, the MAT is defined as a set of upright maximal squares which consist of pixels of value 1 entirely. The MAT plays an important role in image understanding. The paper presents a parallel algorithm for computing the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of 1996 IEEE Second International Conference on Algorithms & Architectures for Parallel Processing, ICA³PP '96 : June 11-13, 1996, Singapore s. 1 - 8
Hlavní autoři: Fujiwara, A., Inoue, M., Masusawa, T., Fyjiwara, H.
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 24.12.2002
Témata:
Concurrent computing
Cost function
Ear
Hypercubes
Information science
Parallel algorithms
Phase change random access memory
Pixel
Time measurement
ISBN:9780780335295, 0780335295
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The medial axis transform (MAT) is an image representation scheme. For a binary image, the MAT is defined as a set of upright maximal squares which consist of pixels of value 1 entirely. The MAT plays an important role in image understanding. The paper presents a parallel algorithm for computing the MAT of an n/spl times/n binary image. We show that the algorithm can be performed in O(log n) time using n2/log n processors on the EREW PRAM and in O(log log n) time using n/sup 2//log log n processors on the common CRCW PRAM. We also show that the algorithm can be performed in O(n/sup 2//p/sup 2/+n) time on a p/spl times/p mesh and in O(n/sup 2//p/sup 2/+(n log p)/p) time on a p/sup 2/ processor hypercube (for 1/spl les/p/spl les/n). The algorithm is cost optimal on the PRAMs, on the mesh (for 1/spl les/p/spl les//spl radic/n) and on the hypercube (for 1/spl les/p/spl les/n/log n).
ISBN:9780780335295
0780335295
DOI:10.1109/ICAPP.1996.562850