Fast parallel algorithm for distance transform

We present an O((log log N)/sup 2/) -time algorithm for computing the distance transform of an N /spl times/ N binary image. Our algorithm is designed for the common concurrent read concurrent write parallel random access machine (CRCW PRAM) and requires O(N/sup 2+/spl epsi///log log N) processors,...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on systems, man and cybernetics. Part A, Systems and humans man and cybernetics. Part A, Systems and humans, 2003-07, Vol.33 (4), p.429-434
Main Authors: Datta, A., Soundaralakshmi, S.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Australia
Computation
Computer vision
Concurrent computing
Cybernetics
Euclidean distance
Image sampling
Mathematical analysis
Parallel algorithms
Pattern recognition
Phase change random access memory
Pixel
Processors
Sampling
Transforms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!