Computing the Euclidean distance transform on a linear array of processors

DOI10.1023/A:1023948712732MaRDI QIDQ1404307zbMATH OpenOpenAlexFDO

Authors Marina L. Gavrilova, M. H. Alsuwaiyel

Publication date 21 August 2003

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1023948712732

zbMATH Keywords

distance transformparallel algorithmimage processingEuclidean distancelinear array of processorsfeature transform

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10)

Recommendations

• An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD
• Parallel computation of exact Euclidean distance transform
• Parallel distance transforms on a linear array architecture
• An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
• In-place linear-time algorithms for Euclidean distance transform

Cited in

(4)

• Efficient Computation of the Euclidean Distance Transform
• Parallel distance transforms on a linear array architecture
• Parallel distance transforms on pyramid machines: Theory and implementation
• Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system

This page was built for publication: Computing the Euclidean distance transform on a linear array of processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404307)