Parallel distance transforms on pyramid machines: Theory and implementation
From MaRDI portal
Publication:804324
DOI10.1016/0165-1684(90)90027-VzbMATH Open0727.68133OpenAlexW2046314439MaRDI QIDQ804324FDOQ804324
Gunilla Borgefors, Steven L. Tanimoto, Thomas Hartmann
Publication date: 1990
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0165-1684(90)90027-v
distance transformparallel algorithmimage processingcomputer visioncellular-logic machinespyramid machines
Cited In (5)
- A cost optimal parallel algorithm for weighted distance transforms.
- Parallel distance transforms on a linear array architecture
- New and efficient cellular algorithms for image processing
- Fast algorithm for sequential machine to compute pattern spectrum via city-block distance transform
- Parallel computation of distance transforms
Recommendations
- Parallel computation of distance transforms π π
- Parallel distance transforms on a linear array architecture π π
- Parallel computation of exact Euclidean distance transform π π
- Computing the Euclidean distance transform on a linear array of processors π π
- A Work Efficient Parallel Algorithm for Exact Euclidean Distance Transform π π
- Title not available (Why is that?) π π
- A cost optimal parallel algorithm for weighted distance transforms. π π
This page was built for publication: Parallel distance transforms on pyramid machines: Theory and implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804324)