Medial axis transform on mesh-connected computers with hyperbus broadcasting

To represent a region of a digital image as the union of maximal upright squares contained in the region is called the medial axis transform. In this paper, we present an O(log n) time parallel algorithm for the medial axis transform of an n x n binary image on an SIMD mesh-connected computers with...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computing 1997-01, Vol.59 (2), p.95-114
Hauptverfasser: CHEN, Y.-J, HORNG, S.-J
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:To represent a region of a digital image as the union of maximal upright squares contained in the region is called the medial axis transform. In this paper, we present an O(log n) time parallel algorithm for the medial axis transform of an n x n binary image on an SIMD mesh-connected computers with hyperbus broadcasting using n super(3) processors.
ISSN:0010-485X
1436-5057
DOI:10.1007/BF02684474