Parallel distance transforms on a linear array architecture
From MaRDI portal
Recommendations
- Computing the Euclidean distance transform on a linear array of processors
- Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems
- A cost optimal parallel algorithm for weighted distance transforms.
- Parallel distance transforms on pyramid machines: Theory and implementation
- MIMD divide-and-conquer algorithms for the distance transformation. Part I: City Block distance
Cites work
Cited in
(9)- Computing the Euclidean distance transform on a linear array of processors
- A multiplication-free algorithm and a parallel architecture for affine transformation
- A cost optimal parallel algorithm for weighted distance transforms.
- A parallel architecture for curve-evolution partial differential equations
- New and efficient cellular algorithms for image processing
- A parallel algorithm for generating chain code of objects in binary images.
- Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture
- Parallel pipelined image transformations
- Parallel distance transforms on pyramid machines: Theory and implementation
This page was built for publication: Parallel distance transforms on a linear array architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603550)