Serial and parallel algorithms for the medial axis transform

Author

Jenq, Jing-Fu ; Sahni, Sartaj

Author_Institution

Dept. of Phys.-Math.-Comput. Sci., Tennessee State Univ., Nashville, TN, USA

Volume

14

Issue

12

fYear

1992

fDate

12/1/1992 12:00:00 AM

Firstpage

1218

Lastpage

1224

Abstract

An O(n²) time serial algorithm is developed for obtaining the medial axis transform (MAT) of an n×n image. An O(log n) time CREW PRAM algorithm and an O(log² n) time SIMD hypercube parallel algorithm for the MAT are also developed. Both of these use O(n²) processors. Two problems associated with the MAT, the area and perimeter reporting problem, are studied. An O(log n) time hypercube algorithm is developed for both of them, where n is the number of squares in the MAT, and the algorithms use O(n²) processors

Keywords

computational complexity; hypercube networks; image processing; parallel algorithms; transforms; CREW PRAM algorithm; SIMD hypercube parallel algorithm; area reporting problem; hypercube algorithm; medial axis transform; parallel algorithms; perimeter reporting problem; serial algorithm; Extraterrestrial measurements; Graphics; Hypercubes; Image coding; Image processing; Inspection; Optimized production technology; Parallel algorithms; Phase change random access memory; Surface topography;

fLanguage

English

Journal_Title

Pattern Analysis and Machine Intelligence, IEEE Transactions on

Publisher

ieee

ISSN

0162-8828

Type

jour

DOI

10.1109/34.177389

Filename

177389