DocumentCode
3061831
Title
Euclidean distance transform on Polymorphic Processor Array
Author
Baglietto, P. ; Maresca, M. ; Migliardi, M.
Author_Institution
DIST, Genoa Univ., Italy
fYear
1995
fDate
18-20 Sep 1995
Firstpage
288
Lastpage
293
Abstract
Describes a new parallel algorithm for the Euclidean distance transform on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh interconnection network. The transform converts a binary image which consists of object pixels and non-object pixels into an image where every pixel takes the value of the distance between itself and the nearest object pixel in the original image. The proposed algorithm has been implemented using the Polymorphic Parallel C language and has been validated through simulation. Its computational complexity is O(N) (worst case) for pictures of N×N pixels on a Polymorphic Processor Array of N×N processing elements
Keywords
C language; computational complexity; digital simulation; image processing; multiprocessor interconnection networks; parallel algorithms; parallel architectures; parallel languages; reconfigurable architectures; transforms; Euclidean distance transform; Polymorphic Parallel C language; Polymorphic Processor Array; algorithm validation; binary image; computational complexity; massively parallel architecture; nonobject pixels; object pixels; parallel algorithm; pictures; reconfigurable mesh interconnection network; simulation; Computational modeling; Computer architecture; Computer networks; Concurrent computing; Euclidean distance; Multiprocessor interconnection networks; Parallel algorithms; Parallel architectures; Pixel; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Architectures for Machine Perception, 1995. Proceedings. CAMP '95
Conference_Location
Como
Print_ISBN
0-8186-7134-3
Type
conf
DOI
10.1109/CAMP.1995.521052
Filename
521052
Link To Document