Constant-time algorithm for medial axis transform on the reconfigurable mesh

Author

Datta, Amitava

Author_Institution

Dept. of Comput. Sci., Western Australia Univ., Perth, WA, Australia

fYear

1999

fDate

12-16 Apr 1999

Firstpage

431

Lastpage

435

Abstract

The medial axis transform (MAT) of a set S is defined as the set of centers and radii of maximal disks that are contained in S. If S is a region of a binary image, the disks are defined as upright maximal squares of black pixels and the region S is the union of these maximal squares. In this paper we present an O(1) time algorithm for computing the medial axis transform of an N×N binary image on a reconfigurable mesh of size N×N×N

Keywords

computational geometry; image representation; parallel algorithms; binary image; maximal squares; medial axis transform; reconfigurable mesh; Books; Computer science; Computer vision; Concurrent computing; Image processing; Image reconstruction; Pattern recognition; Phase change random access memory; Pixel; Shape;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing, 1999. 13th International and 10th Symposium on Parallel and Distributed Processing, 1999. 1999 IPPS/SPDP. Proceedings

Conference_Location

San Juan

Print_ISBN

0-7695-0143-5

Type

conf

DOI

10.1109/IPPS.1999.760512

Filename

760512

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2748383